To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC

DOI10.1007/978-3-642-32009-5_21zbMath1296.94106OpenAlexW105372217MaRDI QIDQ2914269

Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_21

zbMATH Keywords

indifferentiabilityhash functionsHMAC

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

From Indifferentiability to Constructive Cryptography (and Back) ⋮ The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC ⋮ On the concrete security of TLS 1.3 PSK mode ⋮ Query-Complexity Amplification for Random Oracles ⋮ When messages are keys: is HMAC a dual-PRF? ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ One-Key Compression Function Based MAC with Security Beyond Birthday Bound ⋮ Analysing the HPKE standard ⋮ Password hashing and preprocessing ⋮ Indifferentiability of 8-Round Feistel Networks ⋮ Handling adaptive compromise for practical encryption schemes

This page was built for publication: To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC