Autors:

CiteWeb id: 19930000111

CiteWeb score: 4104

DOI: 10.1145/168588.168596

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 P R 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.

The publication "Random oracles are practical: a paradigm for designing efficient protocols" is placed in the Top 10000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 1000. Additionally, the publicaiton "Random oracles are practical: a paradigm for designing efficient protocols" is placed in the Top 1000 among other scientific works published in 1993.
Links to full text of the publication: