Random Oracles with(out) Programmability

DOI10.1007/978-3-642-17373-8_18zbMath1253.94047OpenAlexW1574186939MaRDI QIDQ3058663

Thomas Ristenpart, Stefano Tessaro, Martijn Stam, Anja Lehmann, Thomas Shrimpton, Marc Fischlin

Publication date: 7 December 2010

Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_18

zbMATH Keywords

random oracle modelhash functionsprogrammabilityindifferentiability framework

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (21)

Smooth NIZK arguments ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ The wonderful world of global random oracles ⋮ Security analysis of RSA-BSSA ⋮ On tight security proofs for Schnorr signatures ⋮ Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ A survey on functional encryption ⋮ Augmented random oracles ⋮ Ternary forking lemma and its application to the analysis of one code-based signature ⋮ Lifting standard model reductions to common setup assumptions ⋮ Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme ⋮ Non-adaptive programmability of random oracle ⋮ Signatures from sequential-OR proofs ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ More efficient digital signatures with tight multi-user security ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Handling adaptive compromise for practical encryption schemes ⋮ Quantifying the security cost of migrating protocols to practice ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Cryptography and algorithmic randomness

This page was built for publication: Random Oracles with(out) Programmability