Skip to main content
SpringerLink
Log in

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing (FTT) schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all the traitors. We show that decoder enables the FTT schemes to identify at most 1 traitors. Finally, assuming the decoder is embedded with several bytes of memory, we demonstrate how the decoder is able to frame innocent users at will.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kiayias A, Yung M. On crafty pirates and foxy tracers. In ACM Workshop in Digital Rights Management (DRM 2001), Philadelphia, USA, Nov. 5, 2002, Revised Papers, LNCS 2320, pp.22–39.

  2. Kiayias A, Yung M. Self protecting pirates and black-box traitor tracing. In Proc. CRYPTO 2001, Santa Barbara, USA, Aug. 19–23, 2001, pp.63–79.

  3. Pfitzmann B. Trails of traced traitors. In Information Hiding Workshop, Cambridge, UK, May 30-June 1, 1996, LNCS 1174, pp.49–64.

  4. Yan J J, Wu Y. An attack on a traitor tracing scheme. Technical Report No.518, Computer Lab., Univ. Cambridge, 2001.

  5. Boneh D, Franklin M. An efficient public key traitor tracing scheme. In Proc. Crypto 1999, Santa Barbara, USA, Aug. 15–19, 1999, LNCS 1666, pp.338–353.

  6. Kiayias A, Yung M. Traitor tracing with constant transmission rate. In Proc. Eurocrypt 2002, Amsterdam, The Netherlands, April 28-May2, 2002, LNCS 2332, pp.450–465.

  7. Chabanne H, Phan D H, Pointcheval D. Public traceability in traitor tracing schemes. In Proc. EUROCRYPT 2005, Aarhus, Denmark, May 22–26, 2005, LNCS 3494, pp.542–558.

  8. Dwork C, Lotspiech J, Naor M. Digital signets: Self-enforcing protection of digital content. In Proc. STOC 1996, Philadelphia, USA, May 22–24, 1996, pp.489–498.

  9. Naor M, Pinkas B. Efficient trace and revoke schemes. In Proc. Financial Crypto 2000, Anguilla, British West Indies, Feb. 20–24, 2000, LNCS 1962, pp.1–20.

  10. Fiat A, Tassa T. Dynamic traitor tracing. In Proc. CRYPTO 1999, Santa, Barbara, USA, Aug. 15–19, 1999, LNCS 1666, pp.354–371.

  11. Berkman O, Parnas M, Sgall J. Efficient dynamic traitor tracing. SIAM Journal of Computing, 2001, 30(6): 1802–1828.

    Article  MATH  MathSciNet  Google Scholar 

  12. Safavi-Naini R, Wang Y. Sequential traitor tracing. In Proc. Crypto 2003, Santa Barbara, Aug. 17–21, 2000, LNCS 1880, pp.316–332, see also IEEE Transactions on Information Theory, May 2003, 49(5): 1319–1326.

  13. Zhao H V, Liu K J R. Fingerprint multicast in secure video streaming? IEEE Trans. Image Processing, Jan. 2006, 15(1): 12–29.

    Article  Google Scholar 

  14. Dodis Y, Fazio N, Kiayias A, Yung M. Scalable public-key tracing and revoking. In Proc. PODC 2003, Boston, USA, July 13–16, 2003, pp.190–199.

  15. Kiayias A, Yung M. Breaking and repairing asymmetric public-key traitor tracing. In Proc. ACM DRM 2002, Washington DC, USA, Nov. 18, 2002, LNCS 2696, pp.32–50.

  16. Tzeng W G, Tzeng Z J. A public-key traitor tracing scheme with revocation using dynamic shares. Designs, Codes and Cryptography, 2005, 35(1): 47–61.

    Article  MATH  MathSciNet  Google Scholar 

  17. Chor B, Fiat A, Naor M. Tracing traitors. In Proc. Crypto 1994, Santa Barbara, USA, Aug. 27–31, 1994, LNCS 839, pp.257–270.

  18. Naor M, Pinkas B. Threshold traitor tracing. In Proc. Crypto 1998, Santa Barbara, USA, Aug. 23–27, 1998, LNCS 1462, pp.502–517.

  19. Chor B, Fiat A, Naor M, Pinkas B. Tracing traitors Chor. IEEE Transactions on Information Theory, May 2000, 46(3): 893–910.

    Article  MATH  Google Scholar 

  20. Kurosawa K, Desmedt Y. Optimum traitor tracing and asymmetric schemes. In Proc. Eurocrypt 1998, Espoo, Finland, May 31-June 4, 1998, LNCS 1403, pp.145–157.

  21. Dodis Y, Fazio N. Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In Proc. the 6th Int. Workshop on Theory and Practice in Public Key Cryptology, Miami, USA, Jan. 6–8, 2003, pp.100–115.

  22. McGregor J P, Yin Y L, Lee R B. A traitor tracing scheme based on RSA for fast decryption. In Proc. ACNS 2005, New York, USA, June 7–10, 2005, LNCS 3531, pp.56–74.

  23. Boneh D, Sahai A, Waters B. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Proc. Eurocrypt 2006, St. Petersburg, Russia, May 28-June 1, 2006, LNCS 4004, pp.573–592.

  24. Boneh D, Waters B. A collusion resistant broadcast, trace and revoke system. In Proc. ACM CCS 2006, Alexandria, USA, Oct. 30-Nov. 3, 2006, http://eprint.iacr.org/2006/298.

  25. Qiao L, Nahrstedt K. Watermarking schemes and protocols for protecting rightful ownership and customer's rights. J. Vis. Commun. Image Representation, 1998, 9(3): 194–210.

    Article  Google Scholar 

  26. Tonien D, Safavi-Naini R. An efficient single-key pirates tracing scheme using cover-free families. In Proc. ACNS 2006, Singapore, June 6–9, 2006, LNCS 3989, pp.82–97.

  27. Alon N, Bruck J, Noar J, Noar M, Roth R. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Information Theory, 1992, 38(3): 509–516.

    Article  Google Scholar 

  28. Halderman J A, Schoen S D, Heninger N, Clarkson W, Paul W, Calandrino J A. Lest we remember: Cold boot attacks on encryption keys. In Proc. the 17th USENIX Security Symposium, San Jose, USA, July 28-Aug. 1, 2008, pp.91–98.

  29. Ergun F, Kilian J, Kumar R. A note on the limits of collusion-resistant watermarks. In Proc. EUROCRYPT 1999, Prague, Czech, May 2–6, 1999, LNCS 1592, pp.140–149.

  30. Craver S A, Wu M, Liu B, Stubblefield A, Swartzlander B, Wallach D S, Dean D, Felten E W. Reading between the lines: Lessons from the SDMI challenge. In Proc. the 10th USENIX Security Symposium, Boston, USA, June 25–30, 2001, pp.353–363.

  31. Cox I J, Kilian J, Leighton T, Shamoon T. Secure spread spectrum watermarking for multimedia. IEEE Trans. Image Processing, 1997, 6(12): 1673–1687.

    Article  Google Scholar 

  32. Das T K, Maitra S. Cryptanalysis of correlation-based watermarking schemes using single watermarked copy. IEEE Signal Processing Letters, 2004, 11(4): 446–449.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Infocomm Research, A*STAR, Connexis, 138632, Singapore

    Yong-Dong Wu (Member, IEEE,)

  2. School of Information Systems, Singapore Management University, Singapore, 178902, Singapore

    Robert H. Deng (Member, IEEE)

Authors
  1. Yong-Dong Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert H. Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yong-Dong Wu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, YD., Deng, R.H. A Multi-Key Pirate Decoder Against Traitor Tracing Schemes. J. Comput. Sci. Technol. 25, 362–374 (2010). https://doi.org/10.1007/s11390-010-9329-x

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-010-9329-x

Keywords

Search

Navigation