Cryptology ePrint Archive: Report 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.

Category / Keywords: combinatorial cryptography

Date: received 6 Aug 2007

Contact author: s blackburn at rhul ac uk

Available format(s): PDF | BibTeX Citation

Version: 20070807:155320 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]