Combinatorial techniques for universal hashing

DOI10.1016/S0022-0000(05)80007-8MaRDI QIDQ1329163zbMATH OpenOpenAlexFDO

Authors D. R. Stinson

Publication date 13 February 1995

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(05)80007-8

zbMATH Keywords

combinatorial designshash functionorthogonal arrays

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorics in computer science (68R05)

Recommendations

• Universal hashing and geometric codes
• scientific article; zbMATH DE number 1161253
• A combinatorial characterization of certain universal classes of hash functions
• scientific article; zbMATH DE number 1418345
• scientific article; zbMATH DE number 177800

Cites work

• A note on universal classes of hash functions
• A probabilistic distributed algorithm for set intersection and its analysis
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Affine resolvable balanced incomplete block designs: a survey
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Graph isomorphism is in the low hierarchy
• scientific article; zbMATH DE number 3908438 (Why is no real title available?)
• scientific article; zbMATH DE number 4008394 (Why is no real title available?)
• scientific article; zbMATH DE number 176541 (Why is no real title available?)
• scientific article; zbMATH DE number 193109 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3097793 (Why is no real title available?)
• scientific article; zbMATH DE number 3106671 (Why is no real title available?)
• New hash functions and their use in authentication and set equality
• NP is as easy as detecting unique solutions
• Privacy Amplification by Public Discussion
• THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
• Universal classes of hash functions

Cited in

(17)

• The computational complexity of universal hashing
• Universal hashing and authentication codes
• Universal hashing and geometric codes
• On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
• Mosaics of combinatorial designs for information-theoretic security
• Коды аутентификации с секретностью (обзор)
• Uniform Hashing in Constant Time and Optimal Space
• scientific article; zbMATH DE number 1161253 (Why is no real title available?)
• Computing and Combinatorics
• A combinatorial characterization of certain universal classes of hash functions
• Direct proof of security of Wegman-Carter authentication with partially known key
• scientific article; zbMATH DE number 1418345 (Why is no real title available?)
• On a family of universal hash functions
• $\varepsilon$-Almost collision-flat universal hash functions and mosaics of designs
• New bounds on the covering radius of orthogonal arrays of even strength
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
• Universal hash functions for an infinite universe and hash trees

This page was built for publication: Combinatorial techniques for universal hashing

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