Mihir Bellare, Phillip Rogaway  Home/Search
Context Related
Links: DBLP | ucdavis.edu/~rogaway/papers...oracle.ps ucsd.edu/users/mihir/papers/ro.ps.gz mit.edu/pub/dm/pap...lare:oracles.ps.gz 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 Problem Downloading? From: ucdavis.edu/papers (more) From: cryptosoft.com/html/secpub (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^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... (Update)
Cited by: More
Reconciling Two Views of Cryptography - The Computational Soundness (Correct)
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006) (Correct)
On the Role of Definitions in and Beyond Cryptography - Phillip Rogaway Dept (Correct)
Similar documents (at the sentence level):
78.7%: Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are (Correct)
Active bibliography (related documents): More All
0.6: 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.3: Minimizing the Use of Random Oracles in Authenticated.. - Bellare, Rogaway (1997) (Correct)
Similar documents based on text: More All
0.3: DHAES: An Encryption Scheme Based on the Diffie-Hellman.. - Abdalla, Bellare, Rogaway (1999) (Correct)
0.3: Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000) (Correct)
0.2: The AuthA Protocol for Password-Based Authenticated Key Exchange - Bellare, Rogaway (2000) (Correct)
Related documents from co-citation: More All
38: A method for obtaining digital signatures and public-key cryptosystems; Communic.. - Rivest, Shamir et al. - 1978
35: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack - Goldwasser, Micali et al. - 1988
26: The exact security of digital signatures---how to sign with RSA and Rabin - Bellare, Rogaway - 1996
BibTeX entry: (Update)
M. Bellare and P. Rogaway. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62--73, Fairfax, Virginia, U.S.A., 1993. ACM press. http://citeseer.ist.psu.edu/bellare95random.html More
@inproceedings{ bellare93random,
author = "Mihir Bellare and Phillip Rogaway",
title = "Random Oracles are Practical: A Paradigm for Designing Efficient Protocols",
booktitle = "{ACM} Conference on Computer and Communications Security",
pages = "62-73",
year = "1993",
url = "citeseer.ist.psu.edu/bellare95random.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 ACM
531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989 ACM DBLP
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988 ACM DBLP
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986 ACM DBLP
411 How to prove yourself: practical solutions to identification.. - Fiat, Shamir ACM DBLP
339 Theory and applications of trapdoor functions (context) - Yao - 1982
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984 ACM DBLP
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991 ACM
287 The MD5 message-digest algorithm (context) - Rivest - 1992
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984 ACM DBLP
206 Zero knowledge proofs of identity (context) - Feige, Fiat et al. - 1987 ACM DBLP
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988 ACM DBLP
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990 ACM DBLP
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Rackoff - 1988 ACM DBLP
114 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1991 ACM DBLP
111 the composition of zero knowledge proof systems - Goldreich, Krawczyk - 1990
109 Digitalized signatures and public-key functions as intractab.. (context) - Rabin - 1979 ACM
103 A simple unpredictable pseudo-random number generator (context) - Blum, Blum et al. - 1986 DBLP
95 Limits on the provable consequences of one-way permutations - Impagliazzo, Rudich - 1989 ACM DBLP
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 - 1985 DBLP
55 Message authentication with one-way hash functions - Tsudik ACM DBLP
55 A uniform complexity treatment of encryption and zero-knowle.. - Goldreich - 1993
55 The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988 ACM DBLP
52 Foundations of cryptography - Goldreich - 1989 ACM
47 The round complexity of secure protocols - Beaver, Micali et al. - 1990 ACM
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 ACM DBLP
28 the cryptographic applications of random functions (context) - Goldreich, Goldwasser et al. - 1985
24 A hard predicate for all one-way functions (context) - Goldreich, Levin - 1989
18 CS proofs (context) - Micali
18 How to sign given any trapdoor permutation - Bellare, Micali - 1992 ACM DBLP
13 A study of password security (context) - Luby, Rackoff ACM DBLP
11 Zero-knowledge proofs of knowledge without interaction (context) - De Santis, Persiano - 1992
8 Towards practical public key cryptosystems secure against ch.. (context) - ard - 1991
6 PKCS #1: RSA Encryption Standard (context) - Security - 1991
5 Collisions for the compression function of MD5 (context) - den Boer, Bosselaers ACM
5 New approaches to secret key exchange (context) - Leighton, Micali
4 Symmetric public key cryptosystems (context) - Galil, Haber et al. - 1989
4 Provably fast and secure digital signature algorithms based .. (context) - Leighton, Micali - 1993
2 An asymmetric authentication protocol (context) - Rogaway, Blakley - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://seclab.cs.ucdavis.edu/papers.html): More
Proactive Password Checking - Bishop (1992) (Correct)
An Isolated Network for Research - Bishop, Heberlein (1996) (Correct)
Data Level Inference Detection in Database Systems - Yip, Levitt (1998) (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