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

Digital fingerprintframeproof codeseparating hash family

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

(18)

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

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)