Random Oracles are Practical: A Paradigm for Designing Efficient Protocols...  Home/Search
Context
Related
| ucsd.edu/users/mihir/papers/ro.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucdavis.edu/~rogaway/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 P 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... (Update)
Similar documents (at the sentence level):
79.3%: Random Oracles are Practical: A Paradigm for Designing.. - Bellare, Rogaway (1995) (Correct)
Active bibliography (related documents): More All
0.4: A New Suggestion for How to Encrypt with RSA - Bellare, Rogaway (1994) (Correct)
0.4: The Security of Cipher Block Chaining - Bellare, Kilian, Rogaway (1994) (Correct)
0.4: Towards realizing random oracles: Hash functions that hide all.. - Canetti (2000) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ are-appears,
author = "Random Oracles Are",
title = "Appears in the proceedings of the First ACM Conference on Computer and
Communications Security, ACM, November 1993.",
url = "citeseer.ist.psu.edu/766441.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public key cry.. - Rivest, Shamir et al. - 1978
635 New directions in cryptography - Diffie, Hellman - 1976
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
411 How to prove yourself: practical solutions to identification.. - Fiat, Shamir - 1986
339 Theory and applications of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
287 The MD5 message-digest algorithm (context) - Rivest - 1992
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
206 Zero knowledge proofs of identity (context) - Feige, Fiat et al. - 1987
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Rackoff - 1988
114 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1991
111 the composition of zero knowledge proof systems - Goldreich, Krawczyk - 1990
109 Digitalized signatures and public-key functions as intractab.. (context) - Rabin - 1979
103 A simple unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989
95 Multiple non-interactive zero-knowledge proofs based on a si.. (context) - Feige, Lapidot et al. - 1990
77 Non-interactive zero knowledge and its applications (context) - Blum, Feldman et al. - 1988
63 An efficient probabilistic public-key encryption scheme whic.. (context) - Blum, Goldwasser - 1984
55 The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
55 A uniform complexity treatment of encryption and zero-knowle.. - Goldreich - 1993
55 Message authentication with one-way hash functions - Tsudik
52 Foundations of cryptography - Goldreich - 1989
47 The round complexity of secure protocols - Beaver, Micali et al. - 1990
39 Zero-knowledge proofs of knowledge without interaction (context) - De Santis, Persiano - 1992
38 A modification of the RSA public key encryption procedure (context) - Williams - 1980
36 Non-interactive zero-knowledge proof systems (context) - Blum, De Santis et al. - 1991
28 the cryptographic applications of random functions (context) - Goldreich, Goldwasser et al. - 1984
24 A hard predicate for all one-way functions (context) - Goldreich, Levin - 1989
18 How to sign given any trapdoor permutation - Bellare, Micali - 1992
18 CS proofs (context) - Micali
13 A study of password security (context) - Luby, Rackoff
8 Towards practical public key cryptosystems secure against ch.. (context) - ard - 1991
5 New approaches to secret key exchange (context) - Leighton, Micali - 1993
4 Provably fast and secure digital signature algorithms based .. (context) - Leighton, Micali - 1993
4 Symmetric public key cryptosystems (context) - Galil, Haber et al. - 1989
3 PKCS #1: RSA Encryption Standard (context) - Security - 1991
3 Collisions for the compression function of MD5 (context) - den Boer, Bosselaers - 1993
2 An asymmetric authentication protocol (context) - Rogaway, Blakley - 1993
Documents on the same site (http://www.cs.ucdavis.edu/~rogaway/papers/): More
On the Construction of Variable-Input-Length Ciphers - Bellare, Rogaway (1999) (Correct)
Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000) (Correct)
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC