Boosting Merkle-Damgård Hashing for Message Authentication
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1030977
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
- scientific article; zbMATH DE number 1030979
- Keying hash functions for message authentication
Cites work
- A composition theorem for universal one-way hash functions
- A Failure-Friendly Design Principle for Hash Functions
- Automata, Languages and Programming
- Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1030978 (Why is no real title available?)
- scientific article; zbMATH DE number 1088254 (Why is no real title available?)
- scientific article; zbMATH DE number 1951622 (Why is no real title available?)
- scientific article; zbMATH DE number 1394313 (Why is no real title available?)
- scientific article; zbMATH DE number 1418299 (Why is no real title available?)
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Multi-Property-Preserving Hash Domain Extension and the EMD Transform
- New Proofs for NMAC and HMAC: Security Without Collision-Resistance
- On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract)
- On the security of iterated message authentication codes
- One Way Hash Functions and DES
- Strengthening Digital Signatures Via Randomized Hashing
- “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
Cited in
(11)- Lesamnta-LW revisited: improved security analysis of primitive and new PRF mode
- How to incorporate associated data in sponge-based authenticated encryption
- One-key compression function based MAC with security beyond birthday bound
- Boosting OMD for almost free authentication of associated data
- Speeding up the wide-pipe: secure and fast hashing
- On fast and provably secure message authentication based on universal hashing
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
- “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
- Improving tightness gap of GGM construction and its applications
This page was built for publication: Boosting Merkle-Damgård Hashing for Message Authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387101)