Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof codes, which are equivalent to separating hash families of type {w, w}. We also consider existence results for separating hash families of type {w1, w2} that can be obtained from the probabilistic method. The asymptotic behaviour of these bounds is analyzed.

• Type: Journal
• Year: 2008
• Where: TIT
• Authors: Douglas R. Stinson, Gregory M. Zaverucha
• Keywords: Hash Families, Necessary Conditions, Probabilistic Method, TIT 2008