Sciweavers

Share
JCT
2011
106views more  JCT 2011»
7 years 11 months ago
Bounds for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...
Marjan Bazrafshan, Tran van Trung
TIT
2008
52views more  TIT 2008»
8 years 4 months ago
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
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 frameproof cod...
Douglas R. Stinson, Gregory M. Zaverucha
DCC
2007
IEEE
9 years 4 months ago
A sequence approach to linear perfect hash families
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
Susan G. Barwick, Wen-Ai Jackson
books