Universal Hashing and Multiple Authentication

DOI10.1007/3-540-68697-5_2zbMath1329.94050OpenAlexW2104652178MaRDI QIDQ3452336

Mustafa Atici, Douglas R. Stinson

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_2

zbMATH Keywords

authentication codeuniversal hashing

Mathematics Subject Classification ID

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

Related Items (6)

Study on the security of the authentication scheme with key recycling in QKD ⋮ A construction method for optimally universal hash families and its consequences for the existence of RBIBDs ⋮ Direct proof of security of Wegman-Carter authentication with partially known key ⋮ MMH: Software message authentication in the Gbit/second rates ⋮ Fast message authentication using efficient polynomial evaluation ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hash functions and their use in authentication and set equality
• Universal hashing and authentication codes
• Universal hashing and geometric codes
• Construction of orthogonal arrays
• Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
• Codes Which Detect Deception

This page was built for publication: Universal Hashing and Multiple Authentication