Abstract
We present a digital signature scheme based on trapdoor permutations. This scheme is secure against existential forgery under adaptive chosen message attack. The only previous scheme with the same level of security was based on factoring.
Although the main thrust of our work is the question of reduced assumptions, we believe that the scheme itself is of some independent interest. We mention improvements on the basic scheme which lead to a memoryless and more efficient version.
Keywords
- Signature Scheme
- Security Parameter
- Signing Algorithm
- Digital Signature Scheme
- Probabilistic Polynomial Time
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.
supported in part by NSF grant DCR-84-13577 and ARO grant DAALO3-86-K-0171
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bellare, M., and S. Micali, “How to Sign Given Any Trapdoor Function,” Proceedings of the 20th STOC, ACM (1988), 32–42.
Blum, L., M. Blum, and M. Shub, “A Simple Unpredictable Pseudo-Random Number Generator,” SIAM Journal on Computing, Vol. 15, No. 2 (May 1986), 364–383.
Blum, M., and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,” SIAM Journal on Computing, Vol. 13, No. 4 (November 1984), 850–864.
Diffie, W. and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. Info. Theory IT-22 (November 1976), 644–654.
Goldreich, O., “Two Remarks Concerning the GMR Signature Scheme,” MIT Laboratory for Computer Science Technical Report 715, (September 1986).
Goldreich, O., M. Luby, and H. Krawczyk, “On the Existence of Pseudorandom Generators,” CRYPTO 88.
Goldreich, O., S. Goldwasser, and S. Micali, “How To Construct Random Functions,” Journal of the Association for Computing Machinery, Vol. 33, No. 4 (October 1986), 792–807.
Goldwasser, S., and S. Micali, “Probabalistic Encryption,” Journal of Computer and System Sciences 28 (April 1984), 270–299.
Goldwasser, S., S. Micali and R. Rivest, “A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,” SIAM Journal on Computing, vol. 17, No. 2, (April 1988), 281–308.
Goldwasser, S., S. Micali, and A. Yao, “Strong Signature Schemes,” Proceedings of the 15th STOC, ACM (1983), 431–439.
Guillou, L., “A Zero-Knowledge Evolution of the Paradoxical GMR Signature Scheme”, manuscript (February 1988).
Lamport, L. “Constructing Digital Signatures from a One-Way Function,” SRI Intl. CSL-98. (October 1979)
Levin, L., “One Way Functions and Pseudo Random Generators,” Proceedings of the 17th STOC, ACM (1985), 363–365.
Merkle, R., “A Digital Signature Based on a Conventional Encryption Function,” Advances in Cryptology-CRYPTO 87 (Lecture Notes in Computer Science, 293), Springer-Verlag, 1987.
Rivest, R., A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM (Feb 78), 120–26.
Yao, A. C, “Theory and Applications of Trapdoor Functions,” Proceedings of the 23rd FOCS, IEEE (1982) 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Micali, S. (1990). How To Sign Given Any Trapdoor Function. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_15
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_15
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive