A Note on the Security Framework of Two-key DbHtS MACs

DOI10.1007/978-3-031-15777-6_4zbMATH Open1512.94086MaRDI QIDQ6487350FDOQ6487350

Authors: Ting-Ting Guo, Peng Wang 

Publication date: 9 December 2022

Recommendations

• Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting
• Tight security bounds for double-block hash-then-sum MACs
• Generic attacks against beyond-birthday-bound MACs
• Multi-user BBB security of public permutations based MAC
• The sum of CBC MACs is a secure PRF

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• GIFT: a small present. Towards reaching the limit of lightweight encryption
• PRESENT: An Ultra-Lightweight Block Cipher
• Tight security bounds for key-alternating ciphers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• 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
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• 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
• Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting

Cited In (4)

• Title not available (Why is that?)
• Another Look at Security Theorems for 1-Key Nested MACs
• Tight security bounds for double-block hash-then-sum MACs
• Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting

This page was built for publication: A Note on the Security Framework of Two-key DbHtS MACs

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