A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
From MaRDI portal
Publication:3525682
Recommendations
Cites work
- scientific article; zbMATH DE number 1722692 (Why is no real title available?)
- 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 1030978 (Why is no real title available?)
- scientific article; zbMATH DE number 2044536 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2085215 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- scientific article; zbMATH DE number 2086719 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (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 1418300 (Why is no real title available?)
- A Failure-Friendly Design Principle for Hash Functions
- A composition theorem for universal one-way hash functions
- About Feistel schemes with six (or more) rounds
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Extended Multi-Property-Preserving and ECM-Construction
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes
- Foiling birthday attacks in length-doubling transformations
- Keying hash functions for message authentication
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
- Multilane HMAC— Security beyond the Birthday Limit
- On the security of iterated message authentication codes
- The sum of PRPs is a secure PRF
Cited in
(6)- One-key compression function based MAC with security beyond birthday bound
- Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
- On the one-per-message unforgeability of (EC)DSA and its variants
- Boosting Merkle-Damgård Hashing for Message Authentication
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
This page was built for publication: A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525682)