Augmented random oracles

Related Items

Proof-carrying data from arithmetized random oracles

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The random oracle model: a twenty-year retrospective
Another step towards realizing random oracles: non-malleable point obfuscation
On perfect correctness in (lockable) obfuscation
Indifferentiability for public key cryptosystems
The distinction between fixed and random generators in group-based assumptions
Lower bounds for non-black-box zero knowledge
On the Correlation Intractability of Obfuscated Pseudorandom Functions
Contention in Cryptoland: Obfuscation, Leakage and UCE
The Magic of ELFs
Instantiating Random Oracles via UCEs
On Virtual Grey Box Obfuscation for General Circuits
Barriers in cryptography with weak, correlated and leaky sources
Correlated-Input Secure Hash Functions
Random Oracles with(out) Programmability
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
Deterministic and Efficiently Searchable Encryption
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Why “Fiat-Shamir for Proofs” Lacks a Proof
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
Random-Oracle Uninstantiability from Indistinguishability Obfuscation
Advances in Cryptology – CRYPTO 2004
Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
Separating succinct non-interactive arguments from all falsifiable assumptions
Advances in Cryptology - CRYPTO 2003
Merkle-Damgård Revisited: How to Construct a Hash Function
On the Generic Insecurity of the Full Domain Hash
Theory of Cryptography