Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Selected papers from the 12th Conference on Security and Cryptography for Networks
Guest editors: Clemente Galdi and Vladimir Kolesnikov
Article type: Research Article
Authors: Catalano, Darioa | Fuchsbauer, Georgb | Soleimanian, Azamc; d; *
Affiliations: [a] Dipartimento di Matematica e Informatica, Università di Catania, Catania, Italy. E-mail: catalano@dmi.unict.it | [b] Institute of Logic and Computation, TU Wien, Vienna, Austria. E-mail: georg.fuchsbauer@tuwien.ac.at | [c] LIX, CNRS UMR 7161, Ecole Polytechniquel, Palaiseau, France | [d] Project team Grace, INRIA Saclay, France. E-mail: soleimanian@lix.polytechnique.fr
Correspondence: [*] Corresponding author. E-mail: soleimanian@lix.polytechnique.fr.
Note: [1] This paper is an extended and revised version of a paper presented at the 12th Conference on Security and Cryptography for Networks.
Abstract: A double-authentication preventing signature (DAPS) scheme is a digital signature scheme equipped with a self-enforcement mechanism. Messages consist of an address and a payload component, and a signer is penalized if she signs two messages with the same addresses but different payloads. The penalty is the disclosure of the signer’s signing key. Most of the existing DAPS schemes are proved secure in the random oracle model (ROM), while the efficient ones in the standard model only support address spaces of polynomial size. We present DAPS schemes that are efficient, secure in the standard model under standard assumptions and support large address spaces. Our main construction builds on vector commitments (VC) and double-trapdoor chameleon hash functions (DCH). We also provide a DAPS realization from Groth–Sahai (GS) proofs that builds on a generic construction by Derler et al., which they instantiate in the ROM. The GS-based construction, while less efficient than our main one, shows that a general yet efficient instantiation of DAPS in the standard model is possible. An interesting feature of our main construction is that it can be easily modified to guarantee security even in the most challenging setting where no trusted setup is provided. To the best of our knowledge, ours seems to be the first construction achieving this in the standard model.
Keywords: Digital signature, double-spending, self-enforcement, chameleon hash function
DOI: 10.3233/JCS-200117
Journal: Journal of Computer Security, vol. 30, no. 1, pp. 3-38, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl