Skip to main content

On Crafty Pirates and Foxy Tracers

  • Conference paper
  • First Online:
Security and Privacy in Digital Rights Management (DRM 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2320))

Included in the following conference series:

Abstract

Piracy in digital content distribution systems is usually identified as the illegal reception of the material by an unauthorized (pirate) device. A well known method for discouraging piracy in this setting is the usage of a traitor tracing scheme that enables the recovery of the identities of the subscribers who collaborated in the construction of the pirate decoder (the traitors). An important type of tracing which we deal with here is “black-box traitor tracing” which reveals the traitors’ identity using only black-box access to the pirate decoder. The only existing general scheme which is successful in general black-box traitor tracing was introduced by Chor Fiat and Naor. Still, this scheme employs a pirate decoder model that despite its generality it is not intended to apply to all settings. In particular it is assumed that (1) the pirate decoder is “resettable”, i.e. the tracer is allowed to reset the pirate decoder to its initial state after each trial (but in many settings this is not possible: the pirate decoder is “history-recording”), and that (2) the pirate decoder is “available”, i.e. it does not employ an internal reactive mechanism that, say, disables the tracing process (such as shutting down) — we will call such reactive decoders “abrupt”.

In this work we discuss pirate-decoders of various types which we categorize according to their capabilities: resettable vs. history recording, and available vs. abrupt. These (crafty) pirate decoders of “enhanced capabilities” (compared to the model of Chor et al.) appear in many plausible piracy scenarios. We then present new (foxy) black-box traitor tracing schemes which cope with such pirate decoders. We present a generic black box traitor tracing technique against any abrupt/resettable decoder. This generic tracing method can be implemented readily in a linear ciphertext size traitor tracing scheme. By employing a new relaxation technique, which we call list-tracing, we describe a traitor tracing scheme with sublinear ciphertext size that is successful against abrupt/resettable pirate decoders. Finally, we present the first black-box traitor-tracing scheme and techniques that are successful against abrupt/history-recording pirate decoders (in the multimedia transmission setting).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ross Anderson and Markus Kuhn, Low Cost Attacks on Tamper Resistant Devices, Security Protocols, Springer LNCS 1361, 1997.

    Google Scholar 

  2. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan and Ke Yang, On the (Im)Possibility of Obfuscating Programs, CRYPTO 2001.

    Google Scholar 

  3. Omer Berkman, Michael Parnas, and Jiri Sgall Efficient Dynamic Traitor Tracing, 11th SODA, 2000.

    Google Scholar 

  4. Dan Boneh and Matthew Franklin, An Efficient Public Key Traitor Tracing Scheme, CRYPTO 1999.

    Google Scholar 

  5. Dan Boneh and Matthew Franklin, An Efficient Public Key Traitor Tracing Scheme, manuscript, 2001.

    Google Scholar 

  6. Dan Boneh and James Shaw, Collusion-Secure Fingerprinting for Digital Data, CRYPTO 1995.

    Google Scholar 

  7. Benny Chor, Amos Fiat, and Moni Naor, Tracing Traitors, CRYPTO 1994.

    Google Scholar 

  8. Benny Chor, Amos Fiat, Moni Naor, and Benny Pinkas, Tracing Traitors, IEEE Transactions on Information Theory, Vol. 46, no. 3, pp. 893–910, 2000. (originally appeared as [7,15]).

    Article  MATH  Google Scholar 

  9. Amos Fiat and T. Tassa, Dynamic Traitor Tracing, CRYPTO 1999.

    Google Scholar 

  10. Eli Gafni, Jessica Staddon and Yiqun Lisa Yin, Efficient Methods for Integrating Traceability and Broadcast Encryption, CRYPTO 1999.

    Google Scholar 

  11. Aggelos Kiayias and Moti Yung, Self Protecting Pirates and Black-Box Traitor Tracing, to appear in the Proceedings of CRYPTO 2001.

    Google Scholar 

  12. J. Kilian, F. T. Leighton, L. R. Matheson, T. G. Shamoon, R. E. Tarjan, and F. Zane Resistance of Digital Watermarks to Collusive Attacks, Proceedings of the 1998 IEEE International Symposium on Information Theory pp. 271, 1998.

    Google Scholar 

  13. K. Kurosawa and Y. Desmedt, Optimum Traitor Tracing and Asymmetric Schemes, Eurocrypt 1998.

    Google Scholar 

  14. Dalit Naor, Moni Naor, and Jeffrey B. Lotspiech Revocation and Tracing Schemes for Stateless Receivers, CRYPTO 2001.

    Google Scholar 

  15. Moni Naor and Benny Pinkas, Threshold Traitor Tracing, CRYPTO 1998.

    Google Scholar 

  16. Moni Naor and Benny Pinkas, Efficient Trace and Revoke Schemes, In the Proceedings of Financial Crypto’ 2000, Anguilla, February 2000.

    Google Scholar 

  17. Birgit Pfitzmann, Trials of Traced Traitors, Information Hiding Workshop, Spring LNCS 1174, pp. 49–63, 1996.

    Google Scholar 

  18. Birgit Pfitzmann and Matthias Schunter, Asymmetric Fingerprinting, Eurocrypt 1996.

    Google Scholar 

  19. Brigitt Pfitzmann and M. Waidner, Asymmetric fingerprinting for larger collusions, in proc. ACM Conference on Computer and Communication Security, pp. 151–160, 1997.

    Google Scholar 

  20. Reihaneh Safavi-Naini and Yejing Wang, Sequential Traitor Tracing, CRYPTO 2000.

    Google Scholar 

  21. Douglas R. Stinson and R. Wei, Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes, SIAM J. on Discrete Math, Vol. 11, no. 1, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiayias, A., Yung, M. (2002). On Crafty Pirates and Foxy Tracers. In: Sander, T. (eds) Security and Privacy in Digital Rights Management. DRM 2001. Lecture Notes in Computer Science, vol 2320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47870-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-47870-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43677-5

  • Online ISBN: 978-3-540-47870-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics