Minimizing the use of random oracles in authenticated encryption schemes
Authors:
- Mihir BellareMBMihir Bellare
- Phillip RogawayPRPhillip Rogaway
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 1-16
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Keying Hash Functions for Message Authentication1996
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin1996
- Security Proofs for Signature Schemes1996
- Optimal asymmetric encryption1995
- Immunizing public key cryptosystems against chosen ciphertext attacksIEEE Journal on Selected Areas in Communications, 1993
- Random oracles are practical1993
- Non-malleable cryptography1991
- Public-key cryptosystems provably secure against chosen ciphertext attacks1990
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- Probabilistic encryptionJournal of Computer and System Sciences, 1984