On fast and provably secure message authentication based on universal hashing
From MaRDI portal
Recommendations
Cites work
- A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Codes Which Detect Deception
- Fast hashing on the Pentium
- Foiling birthday attacks in length-doubling transformations
- scientific article; zbMATH DE number 177858 (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 1030979 (Why is no real title available?)
- scientific article; zbMATH DE number 1406775 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- Keying hash functions for message authentication
- New hash functions and their use in authentication and set equality
- Shift-register synthesis and BCH decoding
- Solving sparse linear equations over finite fields
Cited in
(46)- Optimal forgeries against polynomial-based MACs and GCM
- Output masking of tweakable Even-Mansour can be eliminated for message authentication code
- Analysis of the single-permutation encrypted Davies-Meyer construction
- On-line ciphers and the Hash-CBC constructions
- Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
- The circulant hash revisited
- Breaking LWC candidates: sESTATE and Elephant in quantum setting
- The summation-truncation hybrid: reusing discarded bits for free
- Incremental cryptography revisited: PRFs, nonces and modular design
- A trade-off between collision probability and key size in universal hashing using polynomials
- MRD hashing.
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Improved security analysis for nonce-based enhanced hash-then-mask MACs
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3
- On ``the power of verification queries in unconditionally secure message authentication
- Tweakable blockciphers with asymptotically optimal security
- On weak keys and forgery attacks against polynomial-based MAC schemes
- On modes of operations of a block cipher for authentication and authenticated encryption
- Generalizing PMAC under weaker assumptions
- “Sandwich” Is Indeed Secure: How to Authenticate a Message with Just One Hashing
- A new multi-linear universal hash family
- Improving classical authentication over a quantum channel
- The universality of iterated hashing over variable-length strings
- scientific article; zbMATH DE number 1951607 (Why is no real title available?)
- scientific article; zbMATH DE number 2077191 (Why is no real title available?)
- Tweakable block ciphers
- MMH: Software message authentication in the Gbit/second rates
- MRD hashing
- Related-key almost universal hash functions: definitions, constructions and applications
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- EHE: NONCE MISUSE-RESISTANT MESSAGE AUTHENTICATION
- Categorization of faulty nonce misuse resistant message authentication
- Quantum attacks on PRFs based on public random permutations
- Beyond Uber: instantiating generic groups via PGGs
- Universal hashing based on field multiplication and (near-)MDS matrices
- On the security of keyed hashing based on public permutations
- Forgery attacks on several beyond-birthday-bound secure MACs
- Multi-user security of the Elephant v2 authenticated encryption mode
- The committing security of MACs with applications to generic composition
- Toward full n-bit security and nonce misuse resistance of block cipher-based MACs
- Variants of Wegman-Carter message authentication code supporting variable tag lengths
- Variationally universal hashing
- On weak keys and forgery attacks against polynomial-based MAC schemes
This page was built for publication: On fast and provably secure message authentication based on universal hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452360)
