Abstract
We present a practical existentially unforgeable signature scheme and point out applications where its application is desirable. A signature scheme is existentially unforgeable if, given any polynomial (in the security parameter) number of pairs
where S(m) denotes the signature on the message m, it is computationally infeasible to generate a pair (m k+1, S(m k+1)) for any message m k+1 ∉ {m 1, ... m k{. We have developed a signature scheme that requires at most 6 times the amount of time needed to generate a signature using RSA (which is not existentially unforgeable).
Research Performed when this author was with the IBM Almaden Research Center.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare and S. Micali, How to Sign Given Any Trapdoor Function, Proc. 20th ACM Annual Symposium on the Theory of Computing, 1988, pp.32–42.
J. Bos and D. Chaum, Provably Unforgeable Signatures, Proc. Advances in Cryptology — Crypto’92 Proceedings, Springer Verlag, 1993, pp. 1–14.
W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Trans. on Information Theory 22(6), 1976, pp. 644-654.
T. El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. Inform. Theory, IT-31(4), 1985, pp. 469–472
S. Even, O. Goldreich, and S. Micali, On-line/Off-line Digital Signatures, Proc. Advances in Cryptology — Crypto’ 89, Springer Verlag, pp. 263–275, 1990.
A. Fiat, Batch RSA, Proc. Advances in Cryptology — Crypto’ 89, Springer Verlag, 1990.
A. Fiat and A. Shamir, How to Prove Yourself, Proc. of Advances in Cryptology — Crypto’ 86, Springer Verlag, 1987, pp. 641–654.
A. Fiat and A. Shamir, Method, Apparatus, and Article for Identification and Signature, United States Patent 4,748,668 (5/31/88)
O. Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, Proc. Advances in Cryptology — Crypto’ 86, Springer Verlag, 1987.
S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM J. Computing 17(2), pp. 281–301, 1988.
R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, Proc. of the 30th Symp. on Foundations of Computer Science, 1989, pp. 236–241. Full version: Technical Report CS93-12, Weizmann Institute.
R. Merkle, A Digital Signature Based on a Conventional Encryption Function, Proc. Advances in Cryptology — Crypto’ 87, Springer Verlag, 1988, pp. 369–378.
R. C. Merkle and M. Hellman, Hiding information and Signature in Trapdoor Knapsack, IEEE Transaction on Information Theory, Vol 24, 1978, pp. 525–530.
S. Micali and A. Shamir, An Improvement of the Fiat-Shamir Identification and Signature Scheme, Proc. Advances in Cryptology — Crypto’ 88, LNCS 403, Springer-Verlag, pp. 244–247, 1990
M. Naor and M. Yung, Universal One Way Hash Functions and Their Cryptographic Applications, Proc. 21st ACM Annual Symposium on the Theory of Computing, 1989, pp. 33–43.
M. O. Rabin Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
R. Rivest, A. Shamir, and L. Adelman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of ACM, 21 (1978), pp. 120–126.
J. Rompel, One-way Function are Necessary and Sufficient for Signatures, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 387–394.
C. P. Schnorr, Efficient Signature Generation by Smart Cards, J. Cryptology 4, pp. 161–174, 1991.
A. Shamir, On the Generation of Cryptographically Strong Pseudo-Random Number Sequences, ACM Trans. Comput. Sys., 1 (1983), pp. 38–44.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dwork, C., Naor, M. (1994). An Efficient Existentially Unforgeable Signature Scheme and its Applications. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive