Constructions of almost secure frameproof codes with applications to fingerprinting schemes
From MaRDI portal
Publication:1741920
DOI10.1007/S10623-017-0359-ZzbMATH Open1414.94954OpenAlexW2605555906MaRDI QIDQ1741920FDOQ1741920
Authors: Xianqiang Yang 
Publication date: 10 April 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/122239
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
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Upper Bounds on Separating Codes
- Simple Constructions of Almost k-wise Independent Random Variables
- More on (2,2)-separating systems
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Collusion-secure fingerprinting for digital data
- Completely separating systems
- Separating systems
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
- Separating Partition Systems and Locally Different Sequences
- Title not available (Why is that?)
- Combinatorial properties of frameproof and traceability codes
- Tracing traitors
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal probabilistic fingerprint codes
Cited In (9)
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Improved Constructions of Frameproof Codes
- Secure Frameproof Code Through Biclique Cover
- Comments on "New results on frame-proof codes and traceability schemes
- Several new frameproof codes and secure frameproof codes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
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)
