A Bound on the Size of Separating Hash Families

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

eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

Paper 2007/304

A Bound on the Size of Separating Hash Families

Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, and 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: Published elsewhere. Unknown where it was published
Keywords: combinatorial cryptography
Contact author(s): s blackburn @ rhul ac uk
History: 2007-08-07: received
Short URL: https://ia.cr/2007/304
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2007/304}},
      url = {https://eprint.iacr.org/2007/304}
}