Traitor tracing for shortened and corrupted fingerprints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2696, Issue , 2003, Pages 81-100

  Safavi Naini, Reihaneh ^a   Wang, Yejing ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COPYRIGHTS; REED-SOLOMON CODES;

COLLUDERS; CUT-AND-PASTE; GENERALIZED REED-SOLOMON CODES; SOFT DECISION DECODING; TRACING ALGORITHM; TRAITOR TRACING; VIDEO DATA;

C (PROGRAMMING LANGUAGE);

EID: 35248837412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44993-5_6     Document Type: Article

References (29)

1. D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. In Advances in Cryptology - CRYPTO'95, Lecture Notes in Computer Science, volume 963, pages 453-465. Springer-Verlag, Berlin, Heidelberg, New York, 1995.
2. D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory, Vol. 44, No. 5:1897-1905, 1998.
3. B. Chor, A. Fiat, and M. Naor. Tracing traitors. In Advances in Cryptology - CRYPTO'94, Lecture Notes in Computer Science, volume 839, pages 257-270. Springer-Verlag, Berlin, Heidelberg, New York, 1994.
4. I. Cox, M. Miller, and J. Bloom. Digital Watermarking. Mulimedia Information and Systems. Morgan Kaufman Publishers, 2002.
5. J. Dittmann, A. Behr, M. Stabenau, P. Schmitt, J. Schwenk, and J. Ueberberg. Combining digital watermarks and collusion secure fingerprinting for digital images. In Proceedings of SPIE, volume 3657, pages 171-182, 1999.
6. F. Ergun, J. Kilian, and R. Kumar. A note on the limits of collusion-resistant watermarks. In Advances in Cryptology - EUROCRYPT'99, Lecture Notes in Computer Science, volume 1592, pages 140-149. Springer-Verlag, Berlin, Heidelberg, New York, 1999.
7. A. Fiat and T. Tassa. Dynamic traitor tracing. In Advances in Cryptology CRYPTO'99, Lecture Notes in Computer Science, volume 1666, pages 354-371. Springer-Verlag, Berlin, Heidelberg, New York, 1999.
8. Jr. G. D. Forney. Generalized minimum distance decoding. IEEE Transactions on Information Theory, Vol. IT-12, No. 2:125-131, 1966.
9. E. Gafni, J. Staddon, and Y. L. Yin. Efficient methods for integrating traceability and broadcast encryption. In Advances in Cryptology - CRYPTO'99, Lecture Notes in Computer Science, volume 1666, pages 372-387. Springer-Verlag, Berlin, Heidelberg, New York, 1999.
10. V. Guruswami. List decoding of error-correcting codes. Ph.D Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, USA, 2001.
11. V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraicgeometry codes. IEEE Transactions on Information Theory, Vol. 45, No. 6:1757-1767, 1999.
12. H. Guth and B. Pfitzmann. Error- and collusion-secure fingerprinting for digital data. In Information Hiding'99, Lecture Notes in Computer Science, volume 1768, pages 134-145. Springer-Verlag, Berlin, Heidelberg, New York, 2000.
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. Journal of Combinatorial Theory, Series A, 82:121-133, 1998.
14. A. Kiayias and M. Yung. Self protecting pirates and black-box traitor tracing. In Advances in Cryptology - CRYPTO'01, Lecture Notes in Computer Science, volume 2139, pages 63-79. Springer-Verlag, Berlin, Heidelberg, New York, 2001.
15. A. Kiayias and M. Yung. On crafty pirate and foxy tracers. In Security and Privacy in Digital Rights Management (SPDRM 2001), Lecture Notes in Computer Science, volume 2320, pages 22-39. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
16. R. Koetter and A. Vardy. Algebraic soft-decision decoding of Reed-Solomon codes, preprint, 2000.
17. R. Koetter and A. Vardy. Algebraic soft-decision decoding of Reed-Solomon codes. In International Symposium on Information Theory (ISIT 2000), page 61, 2000.
18. K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In Advances in Cryptology - EUROCRYPT'98, Lecture Notes in Computer Science, volume 1462, pages 502-517. Springer-Verlag, Berlin, Heidelberg, New York, 1998.
19. B. Pfitzmann. Trials of traced traitors. In Information Hiding, Lecture Notes in Computer Science, volume 1174, pages 49-64. Springer-Verlag, Berlin, Heidelberg, New York, 1996.
20. R. Safavi-Naini and Y. Wang. Sequential traitor tracing. In Advances in Cryptology - CRYPTO 2000, Lecture Notes in Computer Science, volume 1880, pages 316-332. Springer-Verlag, Berlin, Heidelberg, New York, 2000.
21. R. Safavi-Naini and Y. Wang. New results on frameproof codes and traceability schemes. IEEE Transactions on Information Theory, Vol. 47, No. 7:3029-3033, 2001.
22. R. Safavi-Naini and Y. Wang. Collusion secure q-ary fingerprinting for perceptual content. In Security and Privacy in Digital Rights Management (SPDRM 2001), Lecture Notes in Computer Science, volume 2320, pages 57-75. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
23. P. Sarkar and D. R. Stinson. Frameproof and IPP codes. In Progress in Cryptology - INDOCRYPT 2001, Lecture Notes in Computer Science, volume 2247, pages 117-126. Springer-Verlag, Berlin, Heidelberg, New York, 2001.
24. A. Silverberg, J. Staddon, and J. Walker. Efficient traitor tracing algorithms using list decoding. In Advances in Cryptology - ASIACRYPT'01, Lecture Notes in Computer Science, volume 2248, pages 175-192. Springer-Verlag, Berlin, Heidelberg, New York, 2001.
25. J. N. Staddon, D. R. Stinson, and R. Wei. Combinatorial properties of flameproof and traceability codes. IEEE transactions on information theory, Vol. 47, No. 3:1042-1049, 2001.
26. D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal on Discrete Mathematics, 11:41-53, 1998.
27. D. R. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. In Proceedings of SAC'98, Lecture Notes in Computer Science, volume 1556, pages 144-156. Springer-Verlag, Berlin, Heidelberg, New York, 1999.
28. M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity, 13:180-193, 1997.
29. J. H. van Lint. Introduction to Coding Theory. Graduate texts in mathematics. Springer-Verlag, New York, 1999.