A bound on the size of separating hash families

作者：Blackburn Simon R^*; Etzion Tuvi; Stinson Douglas R; Zaverucha Gregory M

来源：Journal of Combinatorial Theory - Series A, 2008, 115(7): 1246-1256.

DOI：10.1016/j.jcta.2008.01.009

• separating hash family
• perfect hash family
• frameproof code
• secure frameproof code

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.

• 出版日期2008-10