A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier

DOI10.1007/978-3-540-71039-4_20zbMATH Open1154.94478OpenAlexW1598238103MaRDI QIDQ3525682FDOQ3525682

Authors: Kan Yasuda 

Publication date: 18 September 2008

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71039-4_20

Recommendations

• Boosting Merkle-Damgård Hashing for Message Authentication
• Domain extension for MACs beyond the birthday barrier
• Multi-property-preserving domain extension using polynomial-based modes of operation
• scientific article; zbMATH DE number 2086719
• scientific article; zbMATH DE number 1418300

zbMATH Keywords

birthday barriermessage authentication codecompression functionchecksummode of operationpseudo-random functiondomain extensiontweakquasi-random function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Keying hash functions for message authentication
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Failure-Friendly Design Principle for Hash Functions
• Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• A composition theorem for universal one-way hash functions
• Title not available (Why is that?)
• On the security of iterated message authentication codes
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• About Feistel schemes with six (or more) rounds
• Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
• Title not available (Why is that?)
• Foiling birthday attacks in length-doubling transformations
• The sum of PRPs is a secure PRF
• Multilane HMAC— Security beyond the Birthday Limit
• Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
• Title not available (Why is that?)
• Extended Multi-Property-Preserving and ECM-Construction
• Title not available (Why is that?)

Cited In (6)

• One-key compression function based MAC with security beyond birthday bound
• Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
• On the one-per-message unforgeability of (EC)DSA and its variants
• Boosting Merkle-Damgård Hashing for Message Authentication
• A Generic Method to Design Modes of Operation Beyond the Birthday Bound
• A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier

This page was built for publication: A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier

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