A bound on the size of separating hash families

Authors:
Simon R. Blackburn;Tuvi Etzion;Douglas R. Stinson;Gregory M. Zaverucha
Affiliations:
Department of Mathematics, Royal Holloway, University of London, Egham, Surrey TW20 0EX, United Kingdom;Department of Computer Science, Technion -- Israel Institute of Technology, Technion City, Haifa 32000, Israel;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada
Venue:
Journal of Combinatorial Theory Series A
Year:
2008

Citing 9
Cited 5

Optimal linear perfect hash families

Journal of Combinatorial Theory Series A
Perfect hash families: probabilistic methods and explicit constructions

Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

SIAM Journal on Discrete Mathematics
An upper bound on the size of a code with the k-identifiable parent property

Journal of Combinatorial Theory Series A
Generalized hashing and parent-identifying codes

Journal of Combinatorial Theory Series A
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

Combinatorics, Probability and Computing
On generalized separating hash families

Journal of Combinatorial Theory Series A
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

IEEE Transactions on Information Theory

Bounds for separating hash families

Journal of Combinatorial Theory Series A
Efficient conditional expectation algorithms for constructing hash families

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Strengthening hash families and compressive sensing

Journal of Discrete Algorithms
Testers and their applications

Proceedings of the 5th conference on Innovations in theoretical computer science
Improved bounds for separating hash families

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper provides an upper bound on the size of a (generalized) separating hash family, a notion introduced by Stinson, Wei and Chen. The upper bound generalizes and unifies several previously known bounds which apply in special cases, namely bounds on perfect hash families, frameproof codes, secure frameproof codes and separating hash families of small type.