One-Key Compression Function Based MAC with Security Beyond Birthday Bound

DOI10.1007/978-3-319-40253-6_21zbMath1403.94056OpenAlexW2486933915MaRDI QIDQ2817474

Goutam Paul, Mridul Nandi, Avijit Dutta

Publication date: 31 August 2016

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40253-6_21

zbMATH Keywords

MACbeyond birthdayNIstructure-graph

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Revisiting structure graphs: applications to CBC-MAC and EMAC

Uses Software

• PRESENT
• HIGHT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• Advances in cryptology - CRYPTO '99. 19th annual international cryptology conference Santa Barbara, CA, USA, August 15--19, 1999. Proceedings
• Fast software encryption. 10th international workshop, FSE 2003, Lund, Sweden, February 24--26, 2003. Revised papers
• 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
• Generic Security of NMAC and HMAC with Input Whitening
• Another look at HMAC
• New Generic Attacks against Hash-Based MACs
• The Exact PRF-Security of NMAC and HMAC
• Tweakable Blockciphers with Beyond Birthday-Bound Security
• To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
• Domain Extension for MACs Beyond the Birthday Barrier
• Generic State-Recovery and Forgery Attacks on ChopMD-MAC and on NMAC/HMAC
• Keying Hash Functions for Message Authentication
• HIGHT: A New Block Cipher Suitable for Low-Resource Device
• PRESENT: An Ultra-Lightweight Block Cipher
• A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
• How to Thwart Birthday Attacks against MACs via Small Randomness
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
• A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
• 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
• Generic Related-Key Attacks for HMAC
• The Sum of CBC MACs Is a Secure PRF
• A New Variant of PMAC: Beyond the Birthday Bound
• How to Break MD5 and Other Hash Functions
• Boosting Merkle-Damgård Hashing for Message Authentication
• Generic Universal Forgery Attack on Iterative Hash-Based MACs
• Finding Collisions in the Full SHA-1
• Improved Security Analyses for CBC MACs
• A Failure-Friendly Design Principle for Hash Functions
• Multilane HMAC— Security beyond the Birthday Limit
• Automata, Languages and Programming
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• Cryptography and Coding
• Fast Software Encryption
• Fast Software Encryption

This page was built for publication: One-Key Compression Function Based MAC with Security Beyond Birthday Bound