Who Cited It

Random oracles are practical

1993 · 4,733 citations · 14 from inside this corpus

Mihir Bellare, Phillip Rogaway

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

Random oracles are practical (1993)Random oracles are practicalA method for obtaining digital signatures and public-key cryptosystems (1978)A method for obtaining digita…A method for obtaining digital signatures and public-key cryptosystems (1983)A method for obtaining digita…How To Prove Yourself: Practical Solutions to Identification and Signature Problems (2007)How To Prove Yourself: Practi…The Knowledge Complexity of Interactive Proof Systems (1989)The Knowledge Complexity of I…A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks (1988)A Digital Signature Scheme Se…Foundations of Cryptography (2004)Foundations of CryptographyHandbook of applied cryptography (1997)Handbook of applied cryptogra…Public-Key Cryptosystems Based on Composite Degree Residuosity Classes (2007)Public-Key Cryptosystems Base…Identity-Based Encryption from the Weil Pairing (2001)Identity-Based Encryption fro…Attribute-based encryption for fine-grained access control of encrypted data (2006)Attribute-based encryption fo…Ciphertext-Policy Attribute-Based Encryption (2007)Ciphertext-Policy Attribute-B…The Sybil Attack (2002)The Sybil AttackIdentity-Based Encryption from the Weil Pairing (2003)Identity-Based Encryption fro…Short Signatures from the Weil Pairing (2001)Short Signatures from the Wei…Provable data possession at untrusted stores (2007)Provable data possession at u…Security Arguments for Digital Signatures and Blind Signatures (2000)Security Arguments for Digita…Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles (2004)Efficient Selective-ID Secure…Entity Authentication and Key Distribution (2007)Entity Authentication and Key…Short Signatures Without Random Oracles (2004)Short Signatures Without Rand…A practical public key cryptosystem provably secure against adaptive chosen ciphertext at… (1998)A practical public key crypto…
20 of 20 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.
this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

PaperYearCited
A method for obtaining digital signatures and public-key cryptosystems197813,242
A method for obtaining digital signatures and public-key cryptosystems198313,151
How To Prove Yourself: Practical Solutions to Identification and Signature Problems20073,925
The Knowledge Complexity of Interactive Proof Systems19893,291
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks19882,819
Foundations of Cryptography20041,795

What cites it, inside the corpus

PaperYearCited
Handbook of applied cryptography199710,465
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes20077,277
Identity-Based Encryption from the Weil Pairing20017,069
Attribute-based encryption for fine-grained access control of encrypted data20065,029
Ciphertext-Policy Attribute-Based Encryption20075,003
The Sybil Attack20024,424
Identity-Based Encryption from the Weil Pairing20033,570
Short Signatures from the Weil Pairing20013,000
Provable data possession at untrusted stores20072,717
Security Arguments for Digital Signatures and Blind Signatures20002,223
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles20041,781
Entity Authentication and Key Distribution20071,764
Short Signatures Without Random Oracles20041,461
A practical public key cryptosystem provably secure against adaptive chosen ciphertext at…19981,445

Links

DOI · Open access copy · OpenAlex record

Topics

Cryptography and Data SecurityComputer Science
Complexity and Algorithms in GraphsComputer Science
Computability, Logic, AI AlgorithmsComputer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

  • supports2 author record(s) attached.
  • supports57 reference(s) recorded.
  • neutralThe DOI carries no year to check against.
  • supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:44+00:00.

sha256 648f8491aaceaa34…