Paper Info
Title
Generic Constructions for Secure and Efficient Confirmer Signature Schemes
Abstract
In contrast to ordinary digital signatures, the verification of undeniable signatures and of confirmer signatures requires the cooperation of the signer or of a designated confirmer, respectively. Various schemes have been proposed so far, from practical solutions based on specific number-theoretic assumptions to theoretical constructions using basic cryptographic primitives. To motivate the necessity of new and provably secure constructions for confirmer signatures, we first describe a flaw in a previous realization by Okamoto. We then present two generic constructions for designing provably secure and efficient confirmer variants of many well-known signature schemes, including the schemes by Schnorr, Fiat and Shamir, ElGamal, and the RSA scheme. The constructions employ a new tool called confirmer commitment schemes. In this concept the ability to open the committed value is delegated to a designated confirmer. We present an efficient realization based on the Decision-Diffie-Hellman assumption.
Year
DOI
Venue
1998
10.1007/BFb0054142
ADVANCES IN CRYPTOLOGY - EUROCRYPT '98
Keywords
Field
DocType
designated confirmer signature schemes,undeniable signature schemes,commitment schemes,provable security
Authentication,Computer science,Cryptography,Digital signature,Cryptographic primitive,Theoretical computer science,ElGamal encryption,Public-key cryptography,Distributed computing,Provable security
Conference
Volume
ISSN
Citations 
1403
0302-9743
43
PageRank 
References 
Authors
2.78
22
2
Name
Order
Citations
PageRank
Markus Michels163557.87
Markus Stadler2432.78