skip to main content
10.1145/1866870.1866873acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Robust fingerprinting codes: a near optimal construction

Published:04 October 2010Publication History

ABSTRACT

Fingerprinting codes, originally designed for embedding traceable fingerprints in digital content, have many applications in cryptography; most notably, they are used to construct traitor tracing systems. Recently there has been some interest in constructing robust fingerprinting codes: codes capable of tracing words even when the pirate adversarially destroys a δ fraction of the marks in the fingerprint. An early construction due to Boneh and Naor produces codewords whose length is proportional to c4/(1-δ)2 where c is the number of words at the adversary's disposal. Recently Nuida developed a scheme with codewords of length proportional to (c log c)2/(1-δ) 2. In this paper we introduce a new technique for constructing codes whose length is proportional to (c log c)2/(1-δ), which is asymptotically optimal up to logarithmic factors. These new codes lead to traitor tracing systems with constant size ciphertext and asymptotically shorter secret keys than previously possible.

References

  1. }}E Amiri and G. Tardos. High rate fingerprinting codes and the fingerprinting capacity. In SODA, pages 336--345, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. }}O. Berkman, M. Parnas, and J. Sgall. Efficient dynamic traitor tracing. In Proceedings of SODA '00, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. }}O. Billet and D. Phan. Efficient traitor tracing from collusion secure codes. In proceedings of the 3rd international conference on Information Theoretic Security, pages 171--182, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. }}O. Blayer and T. Tassa. Improved versions of tardos' fingerprinting scheme. In Designs, Codes, and Cryptography, volume 48, pages 461--468, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. }}Dan Boneh and Matthew K. Franklin. An efficient public key traitor tracing scheme. In CRYPTO '99: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pages 338--353, London, UK, 1999. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. }}Dan Boneh and Moni Naor. Traitor tracing with constant size ciphertext. In Proceedings of the ACM Conference on Computer and Communications Security (CCS), pages 501--510, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. }}Dan Boneh, Amit Sahai, and Brent Waters. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Eurocrypt '06, 2006. Full version available at http://eprint.iacr.org/2006/045.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. }}Dan Boneh and James Shaw. Collusion secure fingerprinting for digital data. IEEE Transactions on Information Theory, 44(5):1897--1905, 1998. Extended abstract in Crypto '95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. }}Dan Boneh and Brent Waters. A fully collusion resistant broadcast trace and revoke system with public traceability. In ACM Conference on Computer and Communication Security (CCS), 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. }}Hervé Chabanne, Duong Hieu Phan, and David Pointcheval. Public traceability in traitor tracing schemes. In EUROCRYPT, pages 542--558, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. }}Benny Chor, Amos Fiat, and Moni Naor. Tracing traitors. In CRYPTO '94: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, pages 257--270, London, UK, 1994. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. }}Benny Chor, Amos Fiat, Moni Naor, and Benny Pinkas. Tracing traitors. IEEE Transactions on Information Theory, 46(3):893--910, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. }}Yevgeniy Dodis and Nelly Fazio. Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In Public Key Cryptography - PKC 2003, volume 2567 of LNCS, pages 100--115, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. }}N. Fazio, A. Nicolosi, and D. Phan. Traitor tracing with optimal transmission rate. In Proceedings of ISC'07, volume 4779 of LNCS, pages 71--88. springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. }}Amos Fiat and T. Tassa. Dynamic traitor tracing. In Proceedings of Crypto '99, volume 1666 of LNCS, pages 354--371, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. }}Eli Gafni, Jessica Staddon, and Yiqun Lisa Yin. Efficient methods for integrating traceability and broadcast encryption. In CRYPTO '99: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pages 372--387, London, UK, 1999. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. }}H. Guth and B. Pfitzmann. Error- and collusion-secure fingerprinting for digital data. In Information Hiding '99, volume 1768 of LNCS, pages 134--145, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. }}Jon Johansen. DeCSS, 1999. http://en.wikipedia.org/wiki/DeCSS.Google ScholarGoogle Scholar
  19. }}Aggelos Kiayias and Serdar Pehlivanoglu. Tracing and revoking pirate rebroadcasts. In ACNS 2009, pages 253--271, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. }}Aggelos Kiayias and Moti Yung. Traitor tracing with constant transmission rate. In EUROCRYPT '02: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, pages 450--465, London, UK, 2002. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. }}N. Kogan and T. Tassa. Improved efficiency for revocation schemes via newton interpolation. In ACM Transactions on Information and System Security, volume 9, pages 461--486, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. }}K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In Proceedings of Eurocrypt '98, pages 145--157, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  23. }}Shigeo Mitsunari, Ryuichi Sakai, and Masao Kasahara. A new traitor tracing. IEICE Trans. Fundamentals, E85-A(2):481--484, 2002.Google ScholarGoogle Scholar
  24. }}Dalit Naor, Moni Naor, and Jeffrey B. Lotspiech. Revocation and tracing schemes for stateless receivers. In CRYPTO '01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pages 41--62, London, UK, 2001. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. }}Moni Naor and Benny Pinkas. Threshold traitor tracing. In CRYPTO '98: Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, pages 502--517, London, UK, 1998. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. }}Moni Naor and Benny Pinkas. Efficient trace and revoke schemes. In FC '00: Proceedings of the 4th International Conference on Financial Cryptography, pages 1--20, London, UK, 2001. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. }}Koji Nuida. A general conversion method of fingerprint codes to (more) robust fingerprint codes against bit erasure. In ICITS 2009, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. }}Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, and Hideki Imai. An improvement of tardos's collusion-secure fingerprinting codes with very short lengths. In AAECS 2007, volume 4851 of LNCS. springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. }}Chris Peikert, Abhi Shelat, and Adam Smith. Lower bounds for collusion-secure fingerprinting. In SODA 2003, pages 472--479, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. }}Reihaneh Safavi-Naini and Yejing Wang. Sequential traitor tracing. In Proceedings of Crypto '00, volume 1880 of LNCS, pages 316--332, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. }}Alice Silverberg, Jessica Staddon, and Judy L. Walker. Efficient traitor tracing algorithms using list decoding. In Proceedings of ASIACRYPT '01, volume 2248 of LNCS, pages 175--192, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. }}T. Sirvent. Traitor tracing scheme with constant ciphertext rate against powerful pirates. In Workshop on Coding and Cryptography, 2007.Google ScholarGoogle Scholar
  33. }}Boris Skoric, Stefan Katzenbeisser, and Mehmet Utku Celik. Symmetric tardos fingerprinting codes for arbitrary alphabet sizes. Des. Codes Cryptography, 46(2):137--166, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. }}Jessica N. Staddon, Douglas R. Stinson, and Ruizhong Wei. Combinatorial properties of frameproof and traceability codes. Cryptology ePrint 2000/004, 2000.Google ScholarGoogle Scholar
  35. }}D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal on Discrete Math, 11(1):41--53, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. }}D. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. In Proceedings of SAC '98, volume 1556 of LNCS, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. }}Gabor Tardos. Optimal probabilistic fingerprint codes. In Proceedings of STOC '03, pages 116--125, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. }}T. Tassa. Low bandwidth dynamic traitor tracing schemes. In Journal of Cryptology, volume 18, pages 167--183, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. }}V. To, R. Safavi-Naini, and F. Zhang. New traitor tracing schemes using bilinear map. In Proceedings of 2003 DRM Workshop, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Robust fingerprinting codes: a near optimal construction

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          DRM '10: Proceedings of the tenth annual ACM workshop on Digital rights management
          October 2010
          94 pages
          ISBN:9781450300919
          DOI:10.1145/1866870

          Copyright © 2010 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 4 October 2010

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Upcoming Conference

          CCS '24
          ACM SIGSAC Conference on Computer and Communications Security
          October 14 - 18, 2024
          Salt Lake City , UT , USA

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader