Blockcipher-based MACs: beyond the birthday bound without message length

DOI10.1007/978-3-319-70700-6_16zbMath1417.94076OpenAlexW2769216713MaRDI QIDQ1701456

Yusuke Naito

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_16

zbMATH Keywords

PRPblockciphercounterPRFbeyond the birthday boundmessage authentication codes (MAC)message length

Mathematics Subject Classification ID

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

Related Items (15)

Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Extending AES improvements: A proposal for Alpha-MAC in view of collision resistance ⋮ \(\mathsf{CENCPP}^\ast\): beyond-birthday-secure encryption from public permutations ⋮ Tight security of cascaded LRW2 ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ Key-reduced variants of 3Kf9 with beyond-birthday-bound security ⋮ Quantum linearization attacks ⋮ Fine-tuning the ISO/IEC standard \textsf{LightMAC} ⋮ \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher ⋮ On the Efficiency of ZMAC-Type Modes ⋮ Quantum attacks on beyond-birthday-bound MACs ⋮ Improved security analysis for nonce-based enhanced hash-then-mask MACs ⋮ How to build optimally secure PRFs using block ciphers ⋮ Tight security bounds for double-block hash-then-sum MACs ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting

This page was built for publication: Blockcipher-based MACs: beyond the birthday bound without message length