A Bound on the Size of Separating Hash Families

Simon R.  Blackburn; Tuvi Etzion; Douglas R.  Stinson; Gregory M.  Zaverucha

Paper 2007/304 Original: eprint.iacr.org/2007/304 ↗

A Bound on the Size of Separating Hash Families

Simon R. Blackburn

Tuvi Etzion

Douglas R. Stinson

Gregory M. Zaverucha

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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2007-08-07: last updated; 2007-08-07: published
Short URL: https://ia.cr/2007/304
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2007/304,
      author = {Simon R.  Blackburn and Tuvi Etzion and Douglas R.  Stinson and Gregory M.  Zaverucha},
      title = {A Bound on the Size of Separating Hash Families},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/304},
      year = {2007},
      url = {https://eprint.iacr.org/2007/304}
}