Constructions of almost secure frameproof codes with applications to fingerprinting schemes
From MaRDI portal
Publication:1741920
Recommendations
- scientific article; zbMATH DE number 2069521
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Several new frameproof codes and secure frameproof codes
- On tight bounds for binary frameproof codes
- Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Information Security Practice and Experience
- Some new \(p\)-ary two-secure frameproof codes
- Improved Constructions of Frameproof Codes
Cites work
- scientific article; zbMATH DE number 3928174 (Why is no real title available?)
- scientific article; zbMATH DE number 1030976 (Why is no real title available?)
- scientific article; zbMATH DE number 1759800 (Why is no real title available?)
- scientific article; zbMATH DE number 2119669 (Why is no real title available?)
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Collusion-secure fingerprinting for digital data
- Combinatorial properties of frameproof and traceability codes
- Completely separating systems
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- More on (2,2)-separating systems
- Optimal probabilistic fingerprint codes
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Separating Partition Systems and Locally Different Sequences
- Separating systems
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Tracing traitors
- Upper Bounds on Separating Codes
Cited in
(9)- Comments on "New results on frame-proof codes and traceability schemes
- Improved Constructions of Frameproof Codes
- Secure Frameproof Code Through Biclique Cover
- Several new frameproof codes and secure frameproof codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
This page was built for publication: Constructions of almost secure frameproof codes with applications to fingerprinting schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741920)
