Domain Extension of Public Random Functions: Beyond the Birthday Barrier

DOI10.1007/978-3-540-74143-5_11MaRDI QIDQ3612550zbMATH OpenOpenAlexFDO

Authors Ueli M. Maurer, Stefano Tessaro

Publication date 10 March 2009

Published in Advances in Cryptology - CRYPTO 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74143-5_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• On pseudo-random oracles
• Salvaging Merkle-Damgård for Practical Applications
• Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
• Indifferentiability beyond the birthday bound for the xor of two public random permutations
• Hardness-preserving reductions via cuckoo hashing

Cited in

(11)

• Short variable length domain extenders with beyond birthday bound security
• On the ring-LWE and polynomial-LWE problems
• Hardness-preserving reductions via cuckoo hashing
• Parallel Hashing via List Recoverability
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
• Optimal collision security in double block length hashing with single length key
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• Faster Multicollisions
• Revisiting the indifferentiability of the sum of permutations
• Random oracle combiners: Merkle-Damgård style

This page was built for publication: Domain Extension of Public Random Functions: Beyond the Birthday Barrier

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