How to sign given any trapdoor permutation
- 2 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 39 (1), 214-233
- https://doi.org/10.1145/147508.147537
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- One-way functions are necessary and sufficient for secure signaturesPublished by Association for Computing Machinery (ACM) ,1990
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Strong signature schemesPublished by Association for Computing Machinery (ACM) ,1983
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1983
- New directions in cryptographyIEEE Transactions on Information Theory, 1976