fw; w 0 1g. In particular, these bounds apply to secure frame- proof codes, which are equivalent to separating hash families of type fw; wg.
Abstract: We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}.
May 5, 2012 · Stinson D.R., Zaverucha G.M.: Some improved bounds for secure frameproof codes and related separating hash families. IEEE Trans. Inf. Theory ...
This paper aims to present new upper bounds on the size of separating hash families. These bounds improve previously known bounds for separating hash ...
In this paper we present new upper bounds on n which improve many previously known bounds. Further we include constructions showing that some of these bounds ...
[22] D. R. Stinson, G. M. Zaverucha, Some improved bounds for secure frameproof codes and related separating hash families, IEEE Transaction on Information ...
Abstract: We present some improved bounds on necessary conditions for separating hash families of type w , w and type w , w − 1 .
A bound on the size of separating hash families - ScienceDirect
www.sciencedirect.com › article › pii
The upper bound generalizes and unifies several previously known bounds which apply in special cases, namely bounds on perfect hash families, frameproof codes, ...
Sep 19, 2018 · Some improved bounds for secure frameproof codes and related separating hash families. IEEE Trans Inform Theory, 2008, 54: 2508–2514. Article ...
Aug 20, 2018 · Some improved bounds for secure frame- proof codes and related separating Hash families. IEEE Trans. Inform. The- ory, 54(6):2508–2514, 2008 ...