Mihir Bellare
Silvio Micali
ABSTRACT
We present a digital signature scheme which combines high security with the property of being based on a very general assumption: the existence of trapdoor permutations. Previous signature schemes with comparable levels of security were based on assumptions of the computational hardness of particular algebraic problems such as factoring. Our contribution is to free this important cryptographic primitive from the fortunes of any specific algebraic problem by establishing a truly general signature scheme.
- BBS.Blum, L., M. EClum, and M. Shu{,, "A Simple Unpredi. ctable Pseudo-Raitdom Number Generator," SiAM Journal on Computing, Vo},. 15, No. 2 (May 1986), 364-383. Google Scholar
Digital Library
- BM.Blum, M., and S. Micali, "How to Generate Cryptographically S;rong Sequences of Pseudo-Random tilts," SIAM Journal on Computing, Vol. 13, No. 4 (November 1984)850-864. Google ScholarDigital Library
- DH.Diffie, W. and M. E. Hellman, "New Directions in Cryptography," tEEE Trans. Info. Theory IT-22 (November 1976), 644-654.Google ScholarDigital Library
- GM.Goldwasser, S., and S. Micali, "Probabalistic Encryption," Journal of Computer and System Sciences 28 (April 1984), 270-299.Google ScholarCross Ref
- GMR.Goldwasser, S., and S. Micali, slid R. RJvest, "A Digital Signature Schenle Secure Against Adaptive Chosen-M~ssage Attacks," to appear in S{AM Journal on Computing, April 1928. (An earlier version appeared as "A Paradoxical Solution to the Signature Problem," Proceedings of the 25th Annual Symposium on the Foundations of C'omputer Science, IEEE (1984), 441-4,18). Google ScholarDigital Library
- GMY.Goldwasser, S., S. Micali, and A. Yao, "Strong Signature Schemes," Proceedings of the 15th Annual A CM Symposium on the Theory of Computing (Boston, 1983), 431-439. Google ScholarDigital Library
- La.Lamport, L. "Constructing Digital Signatures from a One-V~ray Function," SRI Intl. CSL-98. (October 1979)Google Scholar
- Le.Levin, L., "One Way l?unctions and Pseudo Random Generators," Proceedings of the 17th Annual ACM Symposium on the Theory of Computing (Providence, 1985), 363-365. Google ScholarDigital Library
- M.Merkle, R., "A DigitM Signature Based on a Conventional Encryption F~nction," presented at CRYPTO 87 (August 1987), Santa Barbara. Google ScholarDigital Library
- RSA.Rivest, R., A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Communications of the A CM (Feb 78), 120-26. Google ScholarDigital Library
- Y.Yao, A. C., "Theory and Applications of Trapdoor Functions," Proceedings of the 23rd Annual Symposium on the Foundations of Computer Science, IEEE (1982) 80-91.Google Scholar
Index Terms
- How to sign given any trapdoor function
Recommendations
How to sign given any trapdoor permutation
A digital signature scheme is presented, which is based on the existence of any trapdoor permutation. The scheme is secure in the strongest possible natural sense: namely, it is secure against existential forgery under adaptive chosen message attack.
Trapdoor sanitizable signatures made easy
ACNS'10: Proceedings of the 8th international conference on Applied cryptography and network securityA sanitizable signature scheme allows a signer to partially delegate signing rights on a message to another party, called a sanitizer. After the message is signed, the sanitizer can modify pre-determined parts of the message and generate a new signature ...
Comments