The Boneh-Shaw fingerprinting scheme is better than we thought

IEEE Transactions on Information Forensics and Security

Volumn 1, Issue 2, 2006, Pages 248-255

  Schaathun, Hans Georg ^a,b  

^a IEEE   (United Kingdom)

^b UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

Collusion secure codes; Copyright protection; Digital fingerprinting (FP); Traitor tracing

Indexed keywords

COLLUSION-SECURE CODES; COPYRIGHT PROTECTION; DIGITAL FINGERPRINTING (FP); TRAITOR TRACING;

CODES (SYMBOLS); COPYING; DIGITAL SIGNAL PROCESSING; PATTERN RECOGNITION; SECURITY OF DATA;

COPYRIGHTS;

EID: 33744751840     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2006.873596     Document Type: Article

References (15)

1. N. R. Wagner, "Fingerprinting," in Proc. Symp. Security Privacy, 1983, pp. 18-22.
2. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. Inf. Theory, vol. 44, no. 5, pp. 1897-1905, Sep. 1998.
3. B. Chor, A. Fiat, M. Naor, and B. Pinkas, "Tracing traitors," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 893-910, May 2000.
4. A. Somekh-Baruch and N. Merhav, "On the capacity game of private fingerprinting systems under collusion attacks," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 884-899, Mar. 2005.
5. T. Hagerup and C. Rüb, "A guided tour of Chernoff bounds," Inf. Process. Lett., vol. 33, pp. 305-308, 1990.
6. A. Barg, G. R. Blakley, and G. A. Kabatiansky, "Digital fingerprinting codes: Problem statements, constructions, identification of traitors," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 852-865, Apr. 2003.
7. K. Yoshioka, J. Shikata, and T. Matsumoto, "Collusion secure codes: Systematic security definitions and their relations," IEICE Trans. Fundamentals, vol. E87-A, no. 5, May 2004.
8. H. Muratani, "Optimization and evaluation of randomized c-secure CRT code defined on polynomial ring," in Information Hiding 2004, J. Fridrich, Ed., 2004, vol. 3200, Lecture Notes Comput. Sci., pp. 282-292.
9. H.-J. Guth and B. Pfitzmann, "Error- and collusion-secure finger-printing for digital data," in Proc. Information Hiding, New York, 2000, vol. 1768, Lecture Notes Comput. Sci., pp. 134-145, Springer-Verlag.
10. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometry codes," IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1757-1767, Sep. 1999.
11. M. A. Tsfasman, "Algebraic-geometric codes and asymptotic problems," Discrete Appl. Math., vol. 33, no. 1-3, pp. 241-256, 1991.
12. H. G. Schaathun, "Fighting two pirates," in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. New York: Springer-Verlag, May 2003, vol. 2643, Lecture Notes Comput. Sci., pp. 71-78.
13. G. Tardos, "Optimal probabilistic fingerprint codes," J. ACM, 2005, To appear. In part at STOC'03.
14. T. Van Le, M. Burmester, and J. Hu, "Short c-secure fingerprinting codes," in Proc. 6th Information Security Conf., Bristol, U.K., Oct. 2003.
15. M. Fernandez and M. Soriano, Protecting intellectual property by guessing secrets. Prague, Czech Republic, 2003, EC-Web, Sep. 2-5, 2003.