Universal hashing and authentication codes
From MaRDI portal
Publication:1335421
DOI10.1007/BF01388651zbMath0812.94011MaRDI QIDQ1335421
Publication date: 20 May 1995
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Related Items
Quantum readout of Physical Unclonable Functions ⋮ Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3 ⋮ Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio ⋮ Universal Hashing and Multiple Authentication ⋮ Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings ⋮ FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION ⋮ Variationally universal hashing ⋮ Some constructions of systematic authentication codes using Galois rings ⋮ Study on the security of the authentication scheme with key recycling in QKD ⋮ Construction of orthogonal arrays ⋮ A construction method for optimally universal hash families and its consequences for the existence of RBIBDs ⋮ A new multi-linear universal hash family ⋮ Unnamed Item ⋮ On one-round reliable message transmission ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ On the game-theoretical approach to the analysis of authentication codes ⋮ Efficient bit sifting scheme of post-processing in quantum key distribution ⋮ The universality of iterated hashing over variable-length strings ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ New proofs for NMAC and HMAC: security without collision resistance ⋮ A trade-off between collision probability and key size in universal hashing using polynomials ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ On Efficient Message Authentication Via Block Cipher Design Techniques ⋮ Concealment and Its Applications to Authenticated Encryption ⋮ MMH: Software message authentication in the Gbit/second rates ⋮ Fast message authentication using efficient polynomial evaluation ⋮ MRD Hashing ⋮ RIV for Robust Authenticated Encryption ⋮ Об одном семействе универсальных функций хеширования ⋮ On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers ⋮ An effective greedy heuristic for the social golfer problem ⋮ Practical unconditionally secure two-channel message authentication ⋮ Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector ⋮ Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms ⋮ Sharp lower bounds on the extractable randomness from non-uniform sources ⋮ A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage ⋮ MRD hashing. ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ Quantum key distribution using universal hash functions over finite fields ⋮ Quantum Authentication with Key Recycling ⋮ Mosaics of combinatorial designs for information-theoretic security
Cites Work
- Unnamed Item
- Unnamed Item
- The combinatorics of authentication and secrecy codes
- Some constructions and bounds for authentication codes
- A note on universal classes of hash functions
- New hash functions and their use in authentication and set equality
- Combinatorial characterizations of authentication codes
- Universal classes of hash functions
- Combinatorial techniques for universal hashing
- Partial λ-Geometries and Generalized Hadamard Matrices Over Groups
- A combinatorial characterization of certain universal classes of hash functions
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
This page was built for publication: Universal hashing and authentication codes
