Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
From MaRDI portal
Publication:3604416
Recommendations
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)