Query-Complexity Amplification for Random Oracles

DOI10.1007/978-3-319-17470-9_10zbMath1375.94118OpenAlexW2188421441MaRDI QIDQ2947529

Björn Tackmann, Grégory Demay, Peter Gaži, Ueli M. Maurer

Publication date: 24 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_10

zbMATH Keywords

indifferentiabilityhash functionsrandom oraclemoderately hard functions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
• Multi-instance Security and Its Application to Password-Based Cryptography
• To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
• Careful with Composition: Limitations of the Indifferentiability Framework
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Indistinguishability Amplification
• Understanding Adaptivity: Random Systems Revisited
• Resource-Restricted Indifferentiability
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
• The equivalence of the random oracle model and the ideal cipher model, revisited
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Indifferentiability of the Sponge Construction
• Theory of Cryptography