Combinatorial techniques for universal hashing

DOI10.1016/S0022-0000(05)80007-8zbMath0806.68084OpenAlexW2057746492MaRDI QIDQ1329163

Douglas 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

orthogonal arrayshash functioncombinatorial designs

Mathematics Subject Classification ID

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

Related Items (6)

Universal hashing and authentication codes ⋮ 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 ⋮ On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers ⋮ Коды аутентификации с секретностью (обзор) ⋮ Mosaics of combinatorial designs for information-theoretic security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic distributed algorithm for set intersection and its analysis
• NP is as easy as detecting unique solutions
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Graph isomorphism is in the low hierarchy
• A note on universal classes of hash functions
• New hash functions and their use in authentication and set equality
• Affine resolvable balanced incomplete block designs: a survey
• Universal classes of hash functions
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Privacy Amplification by Public Discussion
• THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS

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