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

DOI10.1109/TIT.2008.921887MaRDI QIDQ3604416zbMATH OpenOpenAlexFDO

Authors Gregory M. Zaverucha, D. R. Stinson

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2008.921887

zbMATH Keywords

frameproof codeseparating hash familyDigital fingerprint

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Improved bounds for separating hash families
• A tight bound for frameproof codes viewed in terms of separating hash families
• A tight bound on the size of certain separating hash families
• A bound on the size of separating hash families
• On tight bounds for binary frameproof codes

Cited in

(17)

• Improved bounds on the size of separating hash families of short length
• Improved Constructions of Frameproof Codes
• Improved bounds for separating hash families
• On tight bounds for binary frameproof codes
• Some intriguing upper bounds for separating hash families
• A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• A tight bound for frameproof codes viewed in terms of separating hash families
• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
• Randomized Post-optimization for t-Restrictions
• A tight bound on the size of certain separating hash families
• Bounds for separating hash families
• Explicit constructions of separating hash families from algebraic curves over finite fields
• A bound on the size of separating hash families
• Recursive constructions of secure codes and hash families using difference function families.
• scientific article; zbMATH DE number 1857520 (Why is no real title available?)
• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets

This page was built for publication: Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604416)