skip to main content
10.1145/1982185.1982513acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Efficient traitor tracing for clone attack in content protection

Published:21 March 2011Publication History

ABSTRACT

In this paper we design efficient traitor tracing scheme for a pirate clone attack against a broadcast-encryption-based content protection system. In this content protection system, each user(device) is assigned a set of secret keys. In a clone attack, pirates (legitimate users) compromise their devices, extract their secret keys and use those keys to build a clone device. The clone device allows decryption of content that is originally only accessible by legitimate devices. The pirates can sell the clone device for profits. When a clone device is recovered, a traitor tracing scheme could identify which compromised devices' (called traitors) keys are in the clone. Once the compromised keys are detected, they can be disabled for future content access. In the process of tracing traitors, a series of carefully constructed cipher text is fed into the clone device and the reaction of the clone device is observed and used to deduce which keys are contained inside the clone. The traceability of a tracing scheme is measured by the number of testing cipher texts needed to identify the traitors. The state-of-art traitor tracing schemes in the symmetric key setting achieve O(t3 log t) traceabilities for t traitors. Unfortunately the theoretically efficient polynomial traceability could convert to years' tracing time in reality. In this paper, we present a practical approach that combines traditional traitor tracing scheme design with system security engineering consideration by introducing a "software key conversion data" virtual program. This combination enables our approach to drastically improve traceability over the state-of-art traitor tracing scheme existed in applied cryptography community. The traceabilities for clone attack is improved from O(t3 log t) to O(t) which converts the tracing time from the original 15 years to 4 hours for a clone attack of 100 traitors. Our much improved traceabilities makes them ultimately adopted to use in AACS [1], the new industry content protection standard for next generation high definition DVDs.

References

  1. http://www.aacsla.com/specifications, Pre-recorded Video Book.Google ScholarGoogle Scholar
  2. A. Fiat and M. Naor, "Broadcast Encryption," Crypto'93, Lecture Notes in computer science, Vol. 773, pp 480--491. Springer-Verlag, Berlin, Heidelberg, New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Naor, M. Naor and J. Lotspiech, "Revocation and Tracing Schemes for Stateless Receivers", Crypto 2001, Lecture Notes in computer science, Vol. 2139, pp 41--62, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Naor and B. Pinkas, "Efficient Trace and Revoke Schemes", Financial Cryptography'2000, Lecture Notes in Computer Science, Vol. 1962, pp. 1--20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Boneh, A. Sahai and B. Waters, "Fully Collusion Resistant Traitor Tracing With Short Ciphertexts and Private Keys", EuroCrypt'06, pp. 573--592. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Boneh and M. Naor, "Traitor Tracing with Constant Size Ciphertext", ACM Communication and Computer Security, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H. Chabanne, DH. Phan and D. Pointcheval, "Public traceability in traitor tracing schemes", Eurocrypt, 2005, pp. 542--558. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Safani-Naini and Y. Wang, "Sequential Traitor tracing," IEEE Transactions on Information Theory, 49, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. N. Staddon, D. R. Stinson and R. Wei, "Combinatorial properties of frameproof and traceability codes," IEEE Transactions on Information Theory, 47 (2001), 1042--1049. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Jin, J. Lotspiech and S. Nusser, "Traitor tracing for prerecorded and recordable media", ACM DRM workshop, Oct. 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Jin and J. Lotspich, "Renewable Traitor Tracing: A Trace-Revoke-Trace System For Anonymous Attack", ESORICS 2007, LNCS 4734, pp. 563--577 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Jin and J. Lotspich, "Unifying broadcast encryption and traitor tracing for content protection", ACSAC 2009, pp. 139--148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. http://forum.slysoft.comGoogle ScholarGoogle Scholar
  14. http://cryptography.com/technology/spdc/index.htmlGoogle ScholarGoogle Scholar

Index Terms

  1. Efficient traitor tracing for clone attack in content protection

          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
            SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing
            March 2011
            1868 pages
            ISBN:9781450301138
            DOI:10.1145/1982185

            Copyright © 2011 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: 21 March 2011

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

            Acceptance Rates

            Overall Acceptance Rate1,650of6,669submissions,25%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader