Multilane HMAC— Security beyond the Birthday Limit

DOI10.1007/978-3-540-77026-8_3zbMath1153.94439OpenAlexW1557668170MaRDI QIDQ5458198

Kan Yasuda

Publication date: 11 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_3

zbMATH Keywords

hash functionbirthday attackmessage authentication codeHMACNMACmultilanefailure-friendly

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

PMAC with Parity: Minimizing the Query-Length Influence ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ One-Key Compression Function Based MAC with Security Beyond Birthday Bound

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• Foiling Birthday Attacks in Length-Doubling Transformations
• Keying Hash Functions for Message Authentication
• On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract)
• “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
• About Feistel Schemes with Six (or More) Rounds
• On the security of iterated message authentication codes
• A Failure-Friendly Design Principle for Hash Functions
• Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions
• Fast Software Encryption
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance

This page was built for publication: Multilane HMAC— Security beyond the Birthday Limit