Welcome to the resource topic for 2007/304
Title:
A Bound on the Size of Separating Hash Families
Authors: 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.
ePrint: https://eprint.iacr.org/2007/304
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .