On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Simple Collusion-Secure Fingerprinting Schemes for Images
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
New Considerations about the Correct Design of Turbo Fingerprinting Codes
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Secure transaction protocol analysis: models and applications
Secure transaction protocol analysis: models and applications
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
A short random fingerprinting code against a small number of pirates
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A family of collusion 2-secure codes
IH'05 Proceedings of the 7th international conference on Information Hiding
Multimedia copyright protection platform demonstrator
iTrust'05 Proceedings of the Third international conference on Trust Management
Worst-case optimal fingerprinting codes for non-threshold collusion
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
| Hi-index | 0.02 |
A fingerprinting code is a set of codewords that are embedded in each copy of a digital object, with the purpose of making each copy unique. If the fingerprinting code is c-secure, then the decoding of a pirate word created by a coalition of at most c dishonest users, will expose at least one of the guilty parties. In this paper we construct a 2-secure fingerprinting code by concatenating an inner (2,2)-separating code with an outter IPP code. The particular choice of the codes is such that allows the use of efficient decoding algorithms that correct errors beyond the error correction bound of the code, namely a simplified version of the Chase algorithms for the inner code and the Koetter-Vardy soft-decision list decoding algorithm for the outter code.