Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
NP is as easy as detecting unique solutions
Theoretical Computer Science
A probabilistic distributed algorithm for set intersection and its analysis
Theoretical Computer Science
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
Applications of combinatorial designs in computer science
ACM Computing Surveys (CSUR)
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Universal Hashing and Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Universal Hashing and Geometric Codes
Designs, Codes and Cryptography
Efficient Strongly Universal and Optimally Universal Hashing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Universal Hashing and Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Theoretical Computer Science - Computing and combinatorics
ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I
Crypto topics and applications I
Algorithms and theory of computation handbook
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
On security of universal hash function based multiple authentication
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Hi-index | 0.00 |
The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a collection of hash functions in such a way that a random choice of a function in the class yields a low probability that any two distinct inputs will collide. In this paper, we present some characterizations of universal classes of hash functions in terms of combinatorial designs such as resolvable balanced incomplete block designs and orthogonal arrays. The two classes of hash functions that we study are called optimally universal and strongly universal. We show that optimally universal classes of hash functions are equivalent to resolvable balanced incomplete block designs and strongly universal classes are equivalent to orthogonal arrays. Consequently, known classes of combinatorial designs yield new, small, and efficient classes of universal hash functions.