Abstract
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.
Keywords
Computer scienceTheoretical computer scienceProgramming language
Affiliated Institutions
Related Publications
Nonmalleable Cryptography
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is tha...
Non-interactive cryptocomputing for NC/sup 1/
The area of "computing with encrypted data" has been studied by numerous authors in the past twenty years since it is fundamental to understanding properties of encryption and i...
Strengths and Weaknesses of Quantum Computing
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabil...
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning...
Publication Info
- Year
- 1993
- Type
- article
- Pages
- 62-73
- Citations
- 4612
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
4612
OpenAlex
Cite This
Mihir Bellare,
Phillip Rogaway
(1993).
Random oracles are practical.
, 62-73.
https://doi.org/10.1145/168588.168596
Identifiers
- DOI
- 10.1145/168588.168596