Random oracles are practical
Mihir Bellare Y, Phillip Rogaway · Proceedings of the ACM Conference on Computer and Communications Security · 1993
We argue that the random oracle model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol PR for the random oracle model, and then replacing oracle accesses by the computation of an “appropriately chosen” function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including encryption, signatures, and zero-knowledge proofs.
Cited by 4,712 works. doi:10.1145/168588.168596 Open-access PDF
Authors
References
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- A method for obtaining digital signatures and public-key cryptosystems
- The MD5 Message-Digest Algorithm
- Probabilistic encryption
- How to construct random functions
- DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
- MD4 Message Digest Algorithm
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits