Almost separating and almost secure frameproof codes over \(q\)-ary alphabets

DOI10.1007/S10623-015-0060-ZzbMath1348.94107OpenAlexW2051699169MaRDI QIDQ300380

F. Blanchet-Sadri, M. Dambrine

Publication date: 27 June 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0060-z

zbMATH Keywords

traitor tracingfingerprintingsecure frameproof codeseparating code

Mathematics Subject Classification ID

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

Related Items (2)

Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance

Cites Work

• Unnamed Item
• Completely separating systems
• Separating systems
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Separating Partition Systems and Locally Different Sequences
• Upper Bounds on Separating Codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Collusion-secure fingerprinting for digital data
• Probability Inequalities for Sums of Bounded Random Variables
• Information Theory

This page was built for publication: Almost separating and almost secure frameproof codes over \(q\)-ary alphabets