Universal hashing and multiple authentication

DOI10.1007/3-540-68697-5_2MaRDI QIDQ3452336zbMATH OpenOpenAlexFDO

Authors Mustafa Atici, D. 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

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

Recommendations

• scientific article; zbMATH DE number 176541
• scientific article; zbMATH DE number 1088919
• Universal hashing and authentication codes
• Universal hash-function families: from hashing to authentication
• scientific article; zbMATH DE number 1024067

Cites work

• Codes Which Detect Deception
• Construction of orthogonal arrays
• scientific article; zbMATH DE number 1676651 (Why is no real title available?)
• scientific article; zbMATH DE number 176541 (Why is no real title available?)
• scientific article; zbMATH DE number 697806 (Why is no real title available?)
• scientific article; zbMATH DE number 1024067 (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?)
• New hash functions and their use in authentication and set equality
• Universal hash functions from exponential sums over finite fields and Galois rings
• Universal hashing and authentication codes
• Universal hashing and geometric codes

Cited in

(13)

• Universal hashing and authentication codes
• Multireceiver authentication codes: Models, bounds, constructions, and extensions
• scientific article; zbMATH DE number 1676651 (Why is no real title available?)
• Fuzzy universal hashing and approximate authentication
• Study on the security of the authentication scheme with key recycling in QKD
• scientific article; zbMATH DE number 176541 (Why is no real title available?)
• scientific article; zbMATH DE number 1951607 (Why is no real title available?)
• MMH: Software message authentication in the Gbit/second rates
• Fast message authentication using efficient polynomial evaluation
• Direct proof of security of Wegman-Carter authentication with partially known key
• Short-output universal hash functions and their use in fast and secure data authentication
• Stronger Security Bounds for Wegman-Carter-Shoup Authenticators
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs

This page was built for publication: Universal hashing and multiple authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452336)