# Random oracle

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2013

Highly Cited

2013

- IACR Cryptology ePrint Archive
- 2013

Our main result gives a way to instantiate the random oracle with a concrete hash function in “full domain hash” applications… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- EUROCRYPT
- 2006

We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IACR Cryptology ePrint Archive
- 2004

We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- IACR Cryptology ePrint Archive
- 2003

The goals of this paper are three-fold. First we introduce and motivate a generalization of the fundamental concept of the… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

- CRYPTO
- 2002

We show that there exists a natural protocol problem which has a simple solution in the random-oracle (RO) model and which has no… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- IACR Cryptology ePrint Archive
- 1999

We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- J. ACM
- 1998

We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- STOC
- 1998

WC take a formal look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- ACM Conference on Computer and Communications…
- 1993

We argue that the random oracle model—where all parties have access to a public random oracle—provides a bridge between… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- STOC
- 1985

In a previous paper [BS] we proved, using the elements of the theory of <italic>nilpotent groups</italic>, that some of the… (More)

Is this relevant?