New proofs for NMAC and HMAC: security without collision resistance

DOI10.1007/s00145-014-9185-xzbMath1332.94056OpenAlexW2043711803MaRDI QIDQ901373

Mihir Bellare

Publication date: 11 January 2016

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-014-9185-x

zbMATH Keywords

pseudorandom functionsmessage authenticationhash functionsCarter-Wegman

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

Unintended features of APIs: cryptanalysis of incremental HMAC ⋮ An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ Key-schedule security for the TLS 1.3 standard ⋮ When messages are keys: is HMAC a dual-PRF? ⋮ On Efficient Message Authentication Via Block Cipher Design Techniques ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Analysing the HPKE standard ⋮ An efficient and generic construction for Signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• Universal hashing and authentication codes
• Keying Hash Functions for Message Authentication
• Breaking and provably repairing the SSH authenticated encryption scheme
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• A cryptanalytic time-memory trade-off
• RIPEMD-160: A strengthened version of RIPEMD
• On the security of iterated message authentication codes
• Rigorous Time/Space Trade-offs for Inverting Functions
• Advances in Cryptology – CRYPTO 2004
• How to Break MD5 and Other Hash Functions
• Finding Collisions in the Full SHA-1
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• The security of the cipher block chaining message authentication code

This page was built for publication: New proofs for NMAC and HMAC: security without collision resistance