Bounds for separating hash families

This paper aims to present new upper bounds on the size of separating hash families. These bounds improve previously known bounds for separating hash families.

[1]  Douglas R Stinson,et al.  New constructions for perfect hash families and related structures using combinatorial designs and codes , 2000 .

[2]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

[3]  Douglas R. Stinson,et al.  New Bounds for Generalized Separating Hash Families , 2007 .

[4]  Charles J. Colbourn,et al.  Perfect hash families , 2006 .

[5]  Pak Ching Li,et al.  Constructions of 2‐cover‐free families and related separating hash families , 2006 .

[6]  Tran van Trung,et al.  New Constructions for IPP Codes , 2005, Des. Codes Cryptogr..

[7]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[8]  Douglas R. Stinson,et al.  A bound on the size of separating hash families , 2008, J. Comb. Theory, Ser. A.

[9]  Douglas R Stinson,et al.  Some recursive constructions for perfect hash families , 1996 .

[10]  Jessica Staddon,et al.  Combinatorial properties of frameproof and traceability codes , 2001, IEEE Trans. Inf. Theory.

[11]  Charles J. Colbourn,et al.  Perfect Hash Families: Constructions and Existence , 2007, J. Math. Cryptol..

[12]  Simon R. Blackburn,et al.  Optimal Linear Perfect Hash Families , 1998, J. Comb. Theory, Ser. A.

[13]  Tran van Trung,et al.  Explicit constructions for perfect hash families , 2008, Des. Codes Cryptogr..

[14]  Douglas R. Stinson,et al.  Secure frameproof codes, key distribution patterns, group testing algorithms and related structures , 2000 .

[15]  Douglas R. Stinson,et al.  Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families , 2008, IEEE Transactions on Information Theory.

[16]  Simon R. Blackburn,et al.  Perfect Hash Families: Probabilistic Methods and Explicit Constructions , 2000, J. Comb. Theory, Ser. A.

[17]  Douglas R. Stinson,et al.  On generalized separating hash families , 2008, J. Comb. Theory, Ser. A.

[18]  Jean-Paul M. G. Linnartz,et al.  On Codes with the Identifiable Parent Property , 1998, J. Comb. Theory, Ser. A.