On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
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
New Constructions for IPP Codes
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
On generalized separating hash families
Journal of Combinatorial Theory Series A
Explicit constructions for perfect hash families
Designs, Codes and Cryptography
A bound on the size of separating hash families
Journal of Combinatorial Theory Series A
Bounds for separating hash families
Journal of Combinatorial Theory Series A
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
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
| Hi-index | 0.00 |
An $${(N;n,m,\{w_1,\ldots, w_t\})}$$ -separating hash family is a set $${\mathcal{H}}$$ of N functions $${h: \; X \longrightarrow Y}$$ with $${|X|=n, |Y|=m, t \geq 2}$$ having the following property. For any pairwise disjoint subsets $${C_1, \ldots, C_t \subseteq X}$$ with $${|C_i|=w_i, i=1, \ldots, t}$$ , there exists at least one function $${h \in \mathcal{H}}$$ such that $${h(C_1), h(C_2), \ldots, h(C_t)}$$ are pairwise disjoint. Separating hash families generalize many known combinatorial structures such as perfect hash families, frameproof codes, secure frameproof codes, identifiable parent property codes. In this paper we present new upper bounds on n which improve many previously known bounds. Further we include constructions showing that some of these bounds are tight.