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

DOI10.1109/TIT.2008.921887zbMath1304.94110OpenAlexW2104513950MaRDI QIDQ3604416

Gregory M. Zaverucha, Douglas 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)

Related Items (7)

Improved bounds for separating hash families ⋮ Bounds for separating hash families ⋮ Some intriguing upper bounds for separating hash families ⋮ A tight bound for frameproof codes viewed in terms of separating hash families ⋮ Randomized Post-optimization for t-Restrictions ⋮ A bound on the size of separating hash families ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks

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