Domain Extension of Public Random Functions: Beyond the Birthday Barrier

DOI10.1007/978-3-540-74143-5_11zbMath1215.94063OpenAlexW2099783882MaRDI QIDQ3612550

Stefano Tessaro, Ueli M. Maurer

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)

Related Items (9)

Parallel Hashing via List Recoverability ⋮ On the ring-LWE and polynomial-LWE problems ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Optimal collision security in double block length hashing with single length key ⋮ Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ Faster Multicollisions

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