Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
From MaRDI portal
Publication:2129001
DOI10.1007/978-3-030-84252-9_11zbMATH Open1487.94137OpenAlexW3118229390MaRDI QIDQ2129001FDOQ2129001
Authors: Yaobin Shen, Lei Wang, Jian Weng, Dawu Gu 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_11
Recommendations
- scientific article; zbMATH DE number 2089141
- Beyond birthday bound secure MAC in faulty nonce model
- Generic attacks against beyond-birthday-bound MACs
- A Note on the Security Framework of Two-key DbHtS MACs
- Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption
- Tight security bounds for double-block hash-then-sum MACs
- Multi-user BBB security of public permutations based MAC
- Blockcipher-based MACs: beyond the birthday bound without message length
Cites Work
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- PRESENT: An Ultra-Lightweight Block Cipher
- Tight security bounds for key-alternating ciphers
- The security of the cipher block chaining message authentication code
- Title not available (Why is that?)
- Keying hash functions for message authentication
- Another look at tightness
- Title not available (Why is that?)
- OMAC: one-key CBC MAC.
- Revisiting structure graphs: applications to CBC-MAC and EMAC
- The “Coefficients H” Technique
- 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
- Improved Security Analyses for CBC MACs
- Title not available (Why is that?)
- Multi-key security: the Even-Mansour construction revisited
- The Multi-user Security of Double Encryption
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Optimally secure block ciphers from ideal primitives
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Analyzing multi-key security degradation
- How to decrypt or even substitute DES-encrypted messages in \(2^{28}\) steps.
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Generic attacks against beyond-birthday-bound MACs
- Blockcipher-based MACs: beyond the birthday bound without message length
- Tight security bounds for double-block hash-then-sum MACs
- A MAC mode for lightweight block ciphers
- On the adaptive security of MACs and PRFs
Cited In (10)
- A Note on the Security Framework of Two-key DbHtS MACs
- Improved multi-user security using the squared-ratio method
- \textsf{LightMAC}: fork it and make it faster
- How to Thwart Birthday Attacks against MACs via Small Randomness
- A sponge-based PRF with good multi-user security
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Tight security bounds for double-block hash-then-sum MACs
- The multi-user security of MACs via universal hashing in the ideal cipher model
- Multi-user BBB security of public permutations based MAC
- Key-reduced variants of 3Kf9 with beyond-birthday-bound security
Uses Software
This page was built for publication: Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129001)
