Applications of list decoding to tracing traitors

IEEE Transactions on Information Theory

Volumn 49, Issue 5, 2003, Pages 1312-1318

  Silverberg, Alice ^a   Staddon, Jessica ^b   Walker, Judy L ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

^c UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Algebraic geometry (AG) code; Identifiable parent property (IPP); List decoding; Reed Solomon code; Traceability (TA) code; Traitor tracing

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; COMPUTER CRIME; CRYPTOGRAPHY; ERROR CORRECTION; SECURITY OF DATA; THEOREM PROVING;

ALGEBRAIC-GEOMETRY CODE; IDENTIFIABLE PARENT PROPERTY; LIST DECODING; REED-SOLOMON CODE; TRACEABILITY CODE; TRAITOR TRACING;

DECODING;

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

References (21)

1. A. Barg, G. R. Blakley, and G. Kabatiansky, "Digital fingerprinting codes: Problems statements, constructions, identification of traitors," presented at the IEEE International Symposium on Information Theory, June 2001, Washington, DC, and at the Workshop on Coding and Cryptography, Nat. Univ. Singapore, Singapore, Sept. 2001.
2. A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, and G. Zémor, "A hypergraph approach to the identifying parent property: The case of multiple parents," Coding and Cryptography (WCC 2001), Discr. Appl. Math., vol. 111, 2001.
3. D. Boneh and M. Franklin, "An efficient public key traitor tracing scheme," in Advances in Cryptology-Crypto '99 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1666, pp. 338-353.
4. D. Boneh and J. Shaw, "Collusion secure fingerprinting for digital data," in Advances in Cryptology-Crypto '95 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 963, pp. 452-465.
5. ____, "Collusion secure fingerprinting for digital data," IEEE Trans. Inform. Theory, vol. 44, pp. 1897-1905, Sept. 1998.
6. B. Chor, A. Fiat, and M. Naor, "Tracing traitors," in Advances in Cryptology-Crypto '94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 480-491.
7. B. Chor, A. Fiat, M. Naor, and B. Pinkas, "Tracing traitors," IEEE Trans. Inform. Theory, vol. 46, pp. 893-910, May 2000.
8. I. Cox, J. Kilian, T. Leighton, and T. Shamoon, "Secure spread spectrum watermarking for multimedia.," IEEE Trans. Image Processing, vol. 6, pp. 1673-1687, Dec. 1997.
9. G.-L. Feng, "Very fast algorithms in sudan decoding procedure for Reed-Solomon codes," preprint.
10. A. Fiat and T. Tassa, "Dynamic traitor tracing," in Advances in Cryptology-Crypto '99 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1666, pp. 354-371.
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. ____, "List decoding algorithms for certain concatenated codes," in Proc. 32nd ACM Symp. Theory of Computing (STOC 2000), pp. 181-190.
13. H. D. L. Hollmann, J. H. van Lint, J.-P. Linnartz, and L. M. G. M. Tolhuizen, "On codes with the identifiable parent property," J. Comb. Theory A, vol. 82, pp. 121-133, 1998.
14. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inform. Theory, submitted for publication.
15. J. H. van Lint, Introduction to Coding Theory (Graduate Texts in Mathematics), 3rd ed. Berlin: Springer-Verlag, 1999, vol. 86.
16. R. M. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEEE Trans. Inform. Theory, vol. 46, pp. 246-257, Jan. 2000.
17. B.-Z. Shen, "A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate," IEEE Trans. Inform. Theory, vol. 39, pp. 239-242, Jan. 1993.
18. 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.
19. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound," J. Complexity, vol. 13, no. 1, pp. 180-193, 1997.
20. X.-W. Wu and P. H. Siegel, "Efficient root-finding algorithm with application to list-decoding of algebraic-geometric codes," IEEE Trans. Inform. Theory, submitted for publication.
21. F. Zane, "Efficient watermark detection and collusion security," in Proc. Financial Cryptography 2000, Anguilla, Feb. 2000.