Random oracles with(out) programmability

DOI10.1007/978-3-642-17373-8_18MaRDI QIDQ3058663zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Non-adaptive programmability of random oracle
• scientific article; zbMATH DE number 1775406
• scientific article; zbMATH DE number 1088253
• The random oracle methodology, revisited.
• Black-box separations of hash-and-sign signatures in the non-programmable random oracle model

Cited in

(32)

• Non observability in the random oracle model
• Fine-tuning the ISO/IEC standard \textsf{LightMAC}
• Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
• Formal modeling of random oracle programmability and verification of signature unforgeability using task-PIOAs
• Limits on the Usefulness of Random Oracles
• Optimal security proofs for signatures from identification schemes
• Smooth NIZK arguments
• Algebraic group model with oblivious sampling
• Limits in the provable security of ECDSA signatures
• Ternary forking lemma and its application to the analysis of one code-based signature
• Cryptography and algorithmic randomness
• Security analysis of RSA-BSSA
• Lifting standard model reductions to common setup assumptions
• A survey on functional encryption
• On tight security proofs for Schnorr signatures
• Proof-carrying data from arithmetized random oracles
• The wonderful world of global random oracles
• Augmented random oracles
• Random Oracles and Auxiliary Input
• More efficient digital signatures with tight multi-user security
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
• Black-box separations of hash-and-sign signatures in the non-programmable random oracle model
• 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
• Non-Observable Quantum Random Oracle Model
• Non-adaptive programmability of random oracle
• Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
• HIBE With Short Public Parameters Without Random Oracle
• Black-box use of one-way functions is useless for optimal fair coin-tossing
• Handling adaptive compromise for practical encryption schemes
• Quantifying the security cost of migrating protocols to practice

This page was built for publication: Random oracles with(out) programmability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058663)