One-key compression function based MAC with security beyond birthday bound
From MaRDI portal
Recommendations
- Improved security bound of LightMAC\_Plus and its single-key variant
- Domain extension for MACs beyond the birthday barrier
- Blockcipher-based MACs: beyond the birthday bound without message length
- Multi-user BBB security of public permutations based MAC
- Generic attacks against beyond-birthday-bound MACs
Cites work
- scientific article; zbMATH DE number 2089141 (Why is no real title available?)
- scientific article; zbMATH DE number 1030977 (Why is no real title available?)
- scientific article; zbMATH DE number 2086719 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- scientific article; zbMATH DE number 1418297 (Why is no real title available?)
- scientific article; zbMATH DE number 1418299 (Why is no real title available?)
- scientific article; zbMATH DE number 1418300 (Why is no real title available?)
- 3kf9: enhancing 3GPP-MAC beyond the birthday bound
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
- A Failure-Friendly Design Principle for Hash Functions
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- A new variant of PMAC: beyond the birthday bound
- Advances in cryptology - CRYPTO '99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15--19, 1999. Proceedings
- Advances in cryptology - EUROCRYPT 2002. 21st international conference on the theory and applications of cryptographic techniques, Amsterdam, the Netherlands, April 28 -- May 2, 2002. Proceedings
- Advances in cryptology -- ASIACRYPT 2012. 18th international conference on the theory and application of cryptology and information security, Beijing, China, December 2--6, 2012. Proceedings
- Advances in cryptology -- CRYPTO 2005. 25th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2005. Proceedings
- Advances in cryptology -- EUROCRYPT 2006. 25th annual international conference on the theory and applications of cryptographic techniques, St. Petersburg, Russia, May 28 -- June 1, 2006. Proceedings.
- Another look at HMAC
- Automata, Languages and Programming
- Boosting Merkle-Damgård Hashing for Message Authentication
- Cryptography and Coding
- Domain extension for MACs beyond the birthday barrier
- Fast software encryption. 10th international workshop, FSE 2003, Lund, Sweden, February 24--26, 2003. Revised papers
- Finding Collisions in the Full SHA-1
- Generic Related-Key Attacks for HMAC
- Generic security of NMAC and HMAC with input whitening
- Generic state-recovery and forgery attacks on chopmd-MAC and on NMAC/HMAC
- Generic universal forgery attack on iterative hash-based MACs
- HIGHT: A New Block Cipher Suitable for Low-Resource Device
- How to Break MD5 and Other Hash Functions
- How to Thwart Birthday Attacks against MACs via Small Randomness
- Improved Security Analyses for CBC MACs
- Keying hash functions for message authentication
- Multilane HMAC— Security beyond the Birthday Limit
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- New attacks against standardized MACs.
- New generic attacks against hash-based MACs
- OMAC: one-key CBC MAC.
- PRESENT: An Ultra-Lightweight Block Cipher
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The exact PRF-security of NMAC and HMAC
- The sum of CBC MACs is a secure PRF
- To hash or not to hash again? (In)differentiability results for \(H^2\) and HMAC
- Tweakable Blockciphers with Beyond Birthday-Bound Security
- “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
Cited in
(3)
This page was built for publication: One-key compression function based MAC with security beyond birthday bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817474)
