Improved bounds for separating hash families

Abstract

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.