Digital fingerprinting codes: Problem statements, constructions, identification of traitors

IEEE Transactions on Information Theory

Volumn 49, Issue 4, 2003, Pages 852-865

  Barg, Alexander ^a,b,c   Blakley, G R ^d   Kabatiansky, Grigory A ^e,f  

^a LUCENT TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c HARVARD UNIVERSITY   (United States)

^d TEXAS A AND M UNIVERSITY   (United States)

^e INRIA ROCQUENCOURT   (France)

^f INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Concatenated codes; Fingerprinting problem; Identification error; List decoding; Polynomial time decoding; Separating codes

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; ERROR ANALYSIS; POLYNOMIALS; PROBABILITY;

IDENTIFICATION ERRORS;

CODES (SYMBOLS);

EID: 0037399342     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.809570     Document Type: Article

References (27)

1. A. Barg, G. Cohen, S, Encheva, O. Kabatiansky, and G. Zémor, "A hypergraph approach to the identifying parent property: The case of multiple parents," SIAM J. Discr. Math., vol. 14, pp. 423-431, 2001.
2. A. Barg and G. Kabatiansky, "A class of IPP codes with efficient identification," in Proc. 39th Annual Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2001, pp. 885-890.
3. _, "A class of IPP codes with efficient identification," DIMACS Tech. Rep. 2002-36, submitted for publication.
4. G. R. Blakley, C. Meadows, and G. Purdy, "Fingerprinting long forgiving messages," in Proc. CRYPTO, 1985, pp. 180-189.
5. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inform. Theory, vol. 44, pp. 1987-1905, Sept. 1998.
6. B. Chor, A. Fiat, and M. Naor, "Tracing traitors," in Crypto '94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 257-270.
7. B. Chor, A. Fiat, M. Naor, and B. Pinkas, "Tracing traitors," IEEE Trans. Inform. Theory, vol. 46, pp. 893-910, May 2000.
8. G. Cohen, S. Encheva, and S. Litsyn, "Intersecting codes and partially identifying codes," in Proc. Int. Workshop on Coding and Cryptography, Ecoles de Coëtquidan, Paris, France, 2001, pp. 139-147.
9. I. Dumer, "Concatenated codes and their multilevel generalizations," in Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier Science, 1998, vol. 2, pp. 1911-1988.
10. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
11. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometry codes," IEEE Trans. Inform. Theory, vol. 45, pp. 1757-1767, Sept. 1999.
12. V. Guruswami, "List decoding of error-correcting codes," Ph.D. dissertation, MIT, Cambridge, MA, 2001.
13. H. D. Hollmann, J. H. van Lint, J.-P. Linnartz, and L. M. G. M. Tolhuizen, "On codes with the identifiable parent property," J. Combin. Theory, ser. A, vol. 82, pp. 121-133, 1998.
14. A. D. Friedman, R. L. Graham, and J. D. Ullman, "Universal single transition time asynchronous state assignments," IEEE Trans. Comput., vol. C-18, pp. 541-547, 1969.
15. J. Körner and G. Simonyi, "Separating partition systems and locally different sequences," SIAM J. Discr. Math., pp. 355-359, 1988.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
17. R. R. Nielsen, "Decoding AG-codes beyond half the minimum distance," Master thesis, Dept. Math., Tech. Univ. Denmark, Lyngby, 1998.
18. M. S. Pinsker and Y. L. Sagalovich, "Lower bound on the cardinality of code of automata's states," Probl. Inform. Transm., vol. 8, no. 3, pp. 59-66, 1972.
19. Y. L. Sagalovich, "Concatenated codes of the states of an automaton," Probl. Inform. Transm., vol. 14, no. 2, pp. 77-85, 1978.
20. _, "Fully separated systems," Probl. Inform. Transm., vol. 18, no. 2, pp. 74-82, 1982.
21. _, "Separating systems," Probl. Inform. Transm., vol. 30, no. 2, pp. 14-35, 1994.
22. K. W. Shum, I. Aleshnikov, P. V. Kumar, H. Stiohtenoth, and V. Deolalikar, "A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound," IEEE Trans. Inform. Theory, vol. 47, pp. 2225-2241, Sept. 2001.
23. A. Silverberg, J. Staddon, and J. L. Walker, "Efficient traitor tracing algorithm using list decoding," in ASIACRYPT 2001 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2001, vol. 2248, pp. 175-192.
24. J. N. Staddon, D. R. Stinson, and R. Wei, "Combinatorial properties of frameproof and traceability codes," IEEE Trans. Inform. Theory, vol. 47, pp. 1042-1049, Mar. 2001.
25. D. R. Stinson, V. T. Tran, and R. Wei, "Secure frameproof codes, key distribution patterns, group testing algorithms and related structures," J. Stat. Plan. Inference, vol. 86, pp. 595-617, 1998.
26. T. V. Tran and S. Martirosian, "Constructions for efficient IPP codes," preprint, 2002.
27. M. Tsfasman and S. Vlǎduţ, Algebraic-Geometric Codes. Dordrecht, The Netherlands: Kluwer, 1991.