Improving the Security of MACs Via Randomized Message Preprocessing

DOI10.1007/978-3-540-74619-5_26MaRDI QIDQ3524909zbMATH OpenOpenAlexFDO

Authors Yevgeniy Dodis, Krzysztof Pietrzak

Publication date 16 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-74619-5_26

Mathematics Subject Classification ID

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

Recommendations

• How to Thwart Birthday Attacks against MACs via Small Randomness
• scientific article; zbMATH DE number 1759780
• scientific article; zbMATH DE number 1030977
• Publication:4941858
• The sum of CBC MACs is a secure PRF

Cited in

(10)

• PMAC with parity: minimizing the query-length influence
• How to Thwart Birthday Attacks against MACs via Small Randomness
• scientific article; zbMATH DE number 1030978 (Why is no real title available?)
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations
• A MAC mode for lightweight block ciphers
• The multi-user security of MACs via universal hashing in the ideal cipher model
• scientific article; zbMATH DE number 1759780 (Why is no real title available?)
• A Leakage Resilient MAC
• Indirect message injection for MAC generation

This page was built for publication: Improving the Security of MACs Via Randomized Message Preprocessing

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