Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
From MaRDI portal
Publication:3604416
DOI10.1109/TIT.2008.921887zbMATH Open1304.94110OpenAlexW2104513950MaRDI QIDQ3604416FDOQ3604416
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
Recommendations
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cited In (17)
- A tight bound on the size of certain separating hash families
- Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
- Title not available (Why is that?)
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Explicit constructions of separating hash families from algebraic curves over finite fields
- Improved bounds for separating hash families
- Improved bounds on the size of separating hash families of short length
- Improved Constructions of Frameproof Codes
- On tight bounds for binary frameproof codes
- Some intriguing upper bounds for separating hash families
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Bounds for separating hash families
- Randomized Post-optimization for t-Restrictions
- Recursive constructions of secure codes and hash families using difference function families.
- A tight bound for frameproof codes viewed in terms of separating hash families
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- 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)
