Get started
Keyword

random oracle model

Description: An idealized cryptographic security model in which hash functions are represented as oracles returning consistent, uniformly random outputs.
Wikidata ID: wiki/Q228184
OpenAlex ID: keywords/random-oracle-model
Identity-Based Encryption from the Weil Pairing
2001 · Dan Boneh, Matt Franklin · Lecture notes in computer science · 7,225
Random oracles are practical
1993 · Mihir Bellare, Phillip Rogaway · Proceedings of the ACM Conference on Computer and Communications Security · 4,712
PDF
Identity-Based Encryption from the Weil Pairing
2003 · Dan Boneh, Matthew Franklin · SIAM Journal on Computing · 3,528
Security Arguments for Digital Signatures and Blind Signatures
2000 · David Pointcheval, Jacques Stern · Journal of Cryptology · 2,212
PDF
Short Group Signatures
2004 · Dan Boneh, Xavier Boyen, et al. · Lecture notes in computer science · 2,128
Efficient Identity-Based Encryption Without Random Oracles
2005 · Brent Waters · Lecture notes in computer science · 2,034
How to Leak a Secret
2001 · Ronald L. Rivest, Adi Shamir, et al. · Lecture notes in computer science · 1,616
Compact Proofs of Retrievability
2008 · Hovav Shacham, Brent Waters · Lecture notes in computer science · 1,436
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
2001 · Jan Camenisch, Anna Lysyanskaya · Lecture notes in computer science · 1,321
Decentralizing Attribute-Based Encryption
2011 · Allison Lewko, Brent Waters · Lecture notes in computer science · 1,245
Secure Integration of Asymmetric and Symmetric Encryption Schemes
1999 · Eiichiro Fujisaki, Tatsuaki Okamoto · Lecture notes in computer science · 1,154
Hierarchical ID-Based Cryptography
2002 · Craig Gentry, Alice Silverberg · Lecture notes in computer science · 1,109
PDF
Security Proofs for Signature Schemes
1996 · David Pointcheval, Jacques Stern · Lecture notes in computer science · 1,095
Functional Encryption: Definitions and Challenges
2011 · Dan Boneh, Amit Sahai, et al. · Lecture notes in computer science · 1,046
The random oracle methodology, revisited
2004 · Ran Canetti, Oded Goldreich, et al. · Journal of the ACM · 978
PDF
Direct anonymous attestation
2004 · Ernie Brickell, Jan Camenisch, et al. · Proceedings of the ACM Conference on Computer and Communications Security · 950
An Identity-Based Signature from Gap Diffie-Hellman Groups
2002 · Jae Cha Choon, Jung Hee Cheon · Lecture notes in computer science · 926
Practical Threshold Signatures
2000 · Victor Shoup · Lecture notes in computer science · 899
Lattice Signatures without Trapdoors
2012 · Vadim Lyubashevsky · Lecture notes in computer science · 868
Efficient Identity Based Signature Schemes Based on Pairings
2003 · Florian Hess · Lecture notes in computer science · 854
Relations among notions of security for public-key encryption schemes
1998 · Mihir Bellare, Anand Desai, et al. · Lecture notes in computer science · 814
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
2000 · Giuseppe Ateniese, Jan Camenisch, et al. · Lecture notes in computer science · 807
Extending Oblivious Transfers Efficiently
2003 · Yuval Ishai, Joe Kilian, et al. · Lecture notes in computer science · 767
HMQV: A High-Performance Secure Diffie-Hellman Protocol
2005 · Hugo Krawczyk · Lecture notes in computer science · 760
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
2000 · Victor Boyko, Philip MacKenzie, et al. · Lecture notes in computer science · 733
Works count: 6,231
Citation count: 170,700
Year
Topic
Type