How To Sign Given Any Trapdoor Function
- 1 January 1990
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 200-215
- https://doi.org/10.1007/0-387-34799-2_15
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
This publication has 11 references indexed in Scilit:
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- How to sign given any trapdoor functionPublished by Association for Computing Machinery (ACM) ,1988
- How to construct random functionsJournal of the ACM, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- One-way functions and pseudorandom generatorsPublished by Association for Computing Machinery (ACM) ,1985
- 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
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- New directions in cryptographyIEEE Transactions on Information Theory, 1976