Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Security

ISC 2009: Information Security pp 234–241Cite as

Traitor Tracing without A Priori Bound on the Coalition Size

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5735))

Abstract

Traitor tracing is an essential mechanism for discouraging the piracy in digital content distribution. An adversarial model is identified as rebroadcasting the content encrypting keys or the content in the clear form. It is possible to fight against these piracy models by employing a fingerprinting code that gives a way to differentiate the encryption capability of each individual. We point three important characteristics of a fingerprinting code that affects its deployment in traitor tracing scheme against pirate rebroadcasting: (i) A robust fingerprinting code tolerates an adversary that chooses not to rebroadcast some messages. (ii) A tracing algorithm for fingerprinting code that does not require a priori upper-bound on coalition size to be successful in detecting a traitor. (iii) Extending the length of the fingerprinting code which refers to traitor-identification procedure of the code that doesn’t depend on the length of the code or the distribution of the markings over the code.

We presented the first traitor tracing scheme with formal analysis of its success in traitor-identification that doesn’t assume a priori bound on a traitor-coalition size while at the same time it is possible to extend the code without degrading the success of traitor identification due to non-extended part. This construction also supports the robustness without requiring a high pirate rebroadcasting threshold.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257–270. Springer, Heidelberg (1994)

    Google Scholar 

  2. Fiat, A., Tassa, T.: Dynamic traitor tracing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 354–371. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Safavi-Naini, R., Wang, Y.: Sequential traitor tracing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 316–332. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Safavi-Naini, R., Wang, Y.: Sequential traitor tracing. IEEE Transactions on Information Theory 49(5), 1319–1326 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data (extended abstract). In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452–465. Springer, Heidelberg (1995)

    Google Scholar 

  6. Le, T.V., Burmester, M., Hu, J.: Short c-secure fingerprinting codes. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 422–427. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Staddon, J., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Transactions on Information Theory 47(3), 1042–1049 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discrete Math. 11(1), 41–53 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Tardos, G.: Optimal probabilistic fingerprint codes. In: STOC, pp. 116–125. ACM, New York (2003)

    Google Scholar 

  10. Jin, H., Lotspiech, J.: Renewable traitor tracing: A trace-revoke-trace system for anonymous attack. In: Biskup, J., López, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 563–577. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Kiayias, A., Pehlivanoglu, S.: Tracing and revoking pirate rebroadcasts. In: ACNS, pp. 253–271 (2009)

    Google Scholar 

  12. Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: ACM Conference on Computer and Communications Security, pp. 501–510 (2008)

    Google Scholar 

  13. AACS Specifications (2006), http://www.aacsla.com/specifications/

  14. Jin, H., Lotspiech, J., Megiddo, N.: Efficient coalition detection in traitor tracing. In: SEC, pp. 365–380 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research Center, USA

    Hongxia Jin

  2. Computer Science and Engineering, University of Connecticut, Storrs, CT, USA

    Serdar Pehlivanoglu

Authors
  1. Hongxia Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serdar Pehlivanoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Tecnologie dell’ Informazione, Università degli Studi di Milano, Via Bramante 65, 26013, Crema, (CR), Italy

    Pierangela Samarati

  2. Computer Science Department, Google Inc. and Columbia University, Room 464, S.W. Mudd Building, 10027, New York, NY, USA

    Moti Yung

  3. Information Security Group, Pisa Research Area, Istituto di Informatica e Telematica - IIT Consiglio Nazionale delle Ricerche - C.N.R., Via. G. Moruzzi 1, 56125, Pisa, Italy

    Fabio Martinelli

  4. Dipartimento di Tecnologie dell’Informazione, Università degli Studi di Milano, Via Bramante, 65, 26013, Crema, (CR), Italy

    Claudio A. Ardagna

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, H., Pehlivanoglu, S. (2009). Traitor Tracing without A Priori Bound on the Coalition Size. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds) Information Security. ISC 2009. Lecture Notes in Computer Science, vol 5735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04474-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04474-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04473-1

  • Online ISBN: 978-3-642-04474-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation