Constructions of almost secure frameproof codes with applications to fingerprinting schemes

DOI10.1007/s10623-017-0359-zzbMath1414.94954OpenAlexW2605555906MaRDI QIDQ1741920

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

zbMATH Keywords

traitor tracingfingerprintingsecure frameproof codeseparating code

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
• Completely separating systems
• Separating systems
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Constructions of Almost Secure Frameproof Codes Based on Small-Bias Probability Spaces
• Separating Partition Systems and Locally Different Sequences
• Upper Bounds on Separating Codes
• Simple Constructions of Almost k-wise Independent Random Variables
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• More on (2,2)-separating systems
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Collusion-secure fingerprinting for digital data
• Optimal probabilistic fingerprint codes

This page was built for publication: Constructions of almost secure frameproof codes with applications to fingerprinting schemes