Tight security bounds for double-block hash-then-sum MACs
From MaRDI portal
Publication:2055619
DOI10.1007/978-3-030-45721-1_16zbMath1479.94327OpenAlexW3023697224MaRDI QIDQ2055619
Jooyoung Lee, Seongkwang Kim, Byeonghak Lee
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_16
Related Items
Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting, XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation, Proof of mirror theory for a wide range of \(\xi_{\max }\), Key-reduced variants of 3Kf9 with beyond-birthday-bound security, A modular approach to the security analysis of two-permutation constructions, Improved multi-user security using the squared-ratio method, Quantum attacks against BBB secure PRFs or MACs built from public random permutations, Quantum linearization attacks, Categorization of faulty nonce misuse resistant message authentication, 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, Attacks on beyond-birthday-bound MACs in the quantum setting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- Generic attacks against beyond-birthday-bound MACs
- Blockcipher-based MACs: beyond the birthday bound without message length
- The LED Block Cipher
- Keying Hash Functions for Message Authentication
- PRESENT: An Ultra-Lightweight Block Cipher
- A MAC Mode for Lightweight Block Ciphers
- 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
- GIFT: A Small Present
- The Sum of CBC MACs Is a Secure PRF
- A New Variant of PMAC: Beyond the Birthday Bound
- Fast Software Encryption
- The security of the cipher block chaining message authentication code
