Forgery attacks on several beyond-birthday-bound secure MACs
From MaRDI portal
Publication:6595812
DOI10.1007/978-981-99-8727-6_6zbMATH Open1547.94417MaRDI QIDQ6595812
Yaobin Shen, François-Xavier Standaert, Lei Wang
Publication date: 30 August 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Encrypt or decrypt -- to make a single-key beyond birthday secure nonce-based MAC
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Tight security bounds for double-block hash-then-sum MACs
- Multi-user BBB security of public permutations based MAC
- Beyond birthday bound secure MAC in faulty nonce model
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal
- On Fast and Provably Secure Message Authentication Based on Universal Hashing
- PRESENT: An Ultra-Lightweight Block Cipher
- How to Thwart Birthday Attacks against MACs via Small Randomness
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
- KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- GIFT: A Small Present
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: Forgery attacks on several beyond-birthday-bound secure MACs
