EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC

DOI10.1007/978-3-662-53018-4_5zbMath1351.94034OpenAlexW2490548159MaRDI QIDQ2835585

Yannick Seurin, Benoît Cogliati

Publication date: 30 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_5

zbMATH Keywords

beyond-birthday-bound securityDavies-Meyer constructionnonce-misuse resistanceWegman-Carter MAC

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (22)

BBB Secure Nonce Based MAC Using Public Permutations ⋮ Towards tight security of cascaded LRW2 ⋮ Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ Multi-user security of the sum of truncated random permutations ⋮ A modular approach to the security analysis of two-permutation constructions ⋮ Improved multi-user security using the squared-ratio method ⋮ Quantum linearization attacks ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Improved security analysis for nonce-based enhanced hash-then-mask MACs ⋮ How to build optimally secure PRFs using block ciphers ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ Multi-user BBB security of public permutations based MAC ⋮ The summation-truncation hybrid: reusing discarded bits for free

Uses Software

• MMH
• Poly1305-AES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CBC MACs for arbitrary-length messages: The three-key constructions
• New hash functions and their use in authentication and set equality
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Minimizing the Two-Round Even-Mansour Cipher
• On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes
• The Indistinguishability of the XOR of $$k$$ Permutations
• Twisted Polynomials and Forgery Attacks on GCM
• Domain Extension for MACs Beyond the Birthday Barrier
• MAC Reforgeability
• Keying Hash Functions for Message Authentication
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• How to Thwart Birthday Attacks against MACs via Small Randomness
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
• The “Coefficients H” Technique
• Codes Which Detect Deception
• MMH: Software message authentication in the Gbit/second rates
• Cycling Attacks on GCM, GHASH and Other Polynomial MACs and Hashes
• 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
• The Sum of CBC MACs Is a Secure PRF
• A New Variant of PMAC: Beyond the Birthday Bound
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• Tight Security Bounds for Key-Alternating Ciphers
• Improved Security Analyses for CBC MACs
• Fast Software Encryption
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• Progress in Cryptology - INDOCRYPT 2004
• Fast Software Encryption
• The security of the cipher block chaining message authentication code

This page was built for publication: EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC