Query-complexity amplification for random oracles

DOI10.1007/978-3-319-17470-9_10MaRDI QIDQ2947529zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• Quantum security of hash functions and property-preservation of iterated hashing
• Security Amplification for Interactive Cryptographic Primitives
• Disproving the conjectures from ``On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model

Cites work

• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 2086702 (Why is no real title available?)
• Careful with composition: limitations of the indifferentiability framework
• Constructive cryptography -- a new paradigm for security definitions and proofs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• From single-bit to multi-bit public-key encryption via non-malleable codes
• Indistinguishability Amplification
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Multi-instance security and its application to password-based cryptography
• On the Indifferentiability of the Sponge Construction
• Resource-restricted indifferentiability
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The equivalence of the random oracle model and the ideal cipher model, revisited
• Theory of Cryptography
• To hash or not to hash again? (In)differentiability results for \(H^2\) and HMAC
• Understanding adaptivity: random systems revisited

Cited in

(4)

• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
• scientific article; zbMATH DE number 5899292 (Why is no real title available?)
• scientific article; zbMATH DE number 1670881 (Why is no real title available?)
• Amplification and Derandomization without Slowdown

This page was built for publication: Query-complexity amplification for random oracles

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