Minimizing the use of random oracles in authenticated encryption schemes
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Keying Hash Functions for Message AuthenticationPublished by Springer Nature ,1996
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinPublished by Springer Nature ,1996
- Security Proofs for Signature SchemesPublished by Springer Nature ,1996
- Optimal asymmetric encryptionPublished by Springer Nature ,1995
- Immunizing public key cryptosystems against chosen ciphertext attacksIEEE Journal on Selected Areas in Communications, 1993
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- Public-key cryptosystems provably secure against chosen ciphertext attacksPublished by Association for Computing Machinery (ACM) ,1990
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- Probabilistic encryptionJournal of Computer and System Sciences, 1984