Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

Authors:
D. Stinson;G. M. Zaverucha
Affiliations:
David R. Cheriton Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 4

A bound on the size of separating hash families

Journal of Combinatorial Theory Series A
Bounds for separating hash families

Journal of Combinatorial Theory Series A
Randomized post-optimization for t-restrictions

Information Theory, Combinatorics, and Search Theory
Improved bounds for separating hash families

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frame- proof codes, which are equivalent to separating hash families of type {w, w}. We also consider existence results for separating hash families of type {w, w2} that can be obtained from the probabilistic method. The asymptotic behavior of these bounds is analyzed.