Optimal asymmetric encryption
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 950, 92-111
- https://doi.org/10.1007/bfb0053428
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- 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