Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations

DOI10.1007/11799313_15MaRDI QIDQ3618656zbMATH OpenOpenAlexFDO

Authors Kazuhiko Minematsu, Yukiyasu Tsunoo

Publication date 2 April 2009

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

Full work available at URL https://doi.org/10.1007/11799313_15

zbMATH Keywords

AESBlock cipherDifferentially-uniform permutationMAC

Mathematics Subject Classification ID

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

Recommendations

• On the security of two MAC algorithms
• On the adaptive security of MACs and PRFs
• \(\mathcal{E}\)-MACs: towards more secure and more efficient constructions of secure channels
• E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels
• Differential power analysis of MAC-Keccak at any key-length
• Improved algebraic MACs and practical keyed-verification anonymous credentials
• Tight security bounds for double-block hash-then-sum MACs
• Improving the Security of MACs Via Randomized Message Preprocessing
• Almost universal forgery attacks on AES-based MAC's

Cited in

(18)

• Multi-user BBB security of public permutations based MAC
• \(\mathsf{DWCDM}_+\): a BBB secure nonce based MAC
• Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• ASC-1: an authenticated encryption stream cipher
• ALE: AES-based lightweight authenticated encryption
• Generalizing PMAC under weaker assumptions
• Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
• Badger – A Fast and Provably Secure MAC
• scientific article; zbMATH DE number 1030978 (Why is no real title available?)
• Efficient design strategies based on the \textsf{AES} round function
• Almost universal forgery attacks on AES-based MAC's
• Extending AES improvements: a proposal for alpha-MAC in view of collision resistance
• Another Look at Security Theorems for 1-Key Nested MACs
• E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• On Efficient Message Authentication Via Block Cipher Design Techniques
• A simple forgery attack on Pelican

This page was built for publication: Provably Secure MACs from Differentially-Uniform Permutations and AES-Based Implementations

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