International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Bound on the Size of Separating Hash Families

Authors:
Simon R. Blackburn
Tuvi Etzion
Douglas R. Stinson
Gregory M. Zaverucha
Download:
URL: http://eprint.iacr.org/2007/304
Search ePrint
Search Google
Abstract: The paper provides an upper bound on the size of a (generalised) separating hash family, a notion introduced by Stinson, Wei and Chen. The upper bound generalises 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.
BibTeX
@misc{eprint-2007-13584,
  title={A Bound on the Size of Separating Hash Families},
  booktitle={IACR Eprint archive},
  keywords={combinatorial cryptography},
  url={http://eprint.iacr.org/2007/304},
  note={ s.blackburn@rhul.ac.uk 13731 received 6 Aug 2007},
  author={Simon R. Blackburn and Tuvi Etzion and Douglas R. Stinson and Gregory M. Zaverucha},
  year=2007
}