On Fast and Provably Secure Message Authentication Based on Universal Hashing

DOI10.1007/3-540-68697-5_24zbMath1329.94087OpenAlexW1535554763MaRDI QIDQ3452360

Victor Shoup

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_24

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (37)

Attacks on quantum key distribution protocols that employ non-ITS authentication ⋮ Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3 ⋮ Variants of Wegman-Carter message authentication code supporting variable tag lengths ⋮ On modes of operations of a block cipher for authentication and authenticated encryption ⋮ Variationally universal hashing ⋮ Incremental cryptography revisited: PRFs, nonces and modular design ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Generalizing PMAC Under Weaker Assumptions ⋮ A new multi-linear universal hash family ⋮ On-line ciphers and the Hash-CBC constructions ⋮ Tweakable Blockciphers with Asymptotically Optimal Security ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Improving classical authentication over a quantum channel ⋮ The universality of iterated hashing over variable-length strings ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ Quantum attacks on PRFs based on public random permutations ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Output masking of tweakable Even-Mansour can be eliminated for message authentication code ⋮ Universal hashing based on field multiplication and (near-)MDS matrices ⋮ On the security of keyed hashing based on public permutations ⋮ A trade-off between collision probability and key size in universal hashing using polynomials ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Improved security analysis for nonce-based enhanced hash-then-mask MACs ⋮ Tweakable block ciphers ⋮ MMH: Software message authentication in the Gbit/second rates ⋮ MRD Hashing ⋮ Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications ⋮ EHE: NONCE MISUSE-RESISTANT MESSAGE AUTHENTICATION ⋮ 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 ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ MRD hashing. ⋮ The summation-truncation hybrid: reusing discarded bits for free

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
• New hash functions and their use in authentication and set equality
• Foiling Birthday Attacks in Length-Doubling Transformations
• Keying Hash Functions for Message Authentication
• Fast Hashing on the Pentium
• Solving sparse linear equations over finite fields
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Codes Which Detect Deception
• Shift-register synthesis and BCH decoding

This page was built for publication: On Fast and Provably Secure Message Authentication Based on Universal Hashing