DocumentCode :
1232738
Title :
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
Author :
Stinson, Douglas R. ; Zaverucha, Gregory M.
Author_Institution :
David R. Cheriton Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON
Volume :
54
Issue :
6
fYear :
2008
fDate :
6/1/2008 12:00:00 AM
Firstpage :
2508
Lastpage :
2514
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.
Keywords :
cryptography; probability; asymptotic behavior; hash family separation; probabilistic method; secure frameproof codes; Computer science; Cryptography; Fingerprint recognition; Information security; Digital fingerprint; frameproof code; separating hash family;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2008.921887
Filename :
4529292
Link To Document :
بازگشت