Message-Based Traitor Tracing with Optimal Ciphertext Rate

  • Duong Hieu Phan
  • David Pointcheval
  • Mario Strefler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7533)

Abstract

Traitor tracing is an important tool to discourage defrauders from illegally broadcasting multimedia content. However, the main techniques consist in tracing the traitors from the pirate decoders they built from the secret keys of dishonest registered users: with either a black-box or a white-box tracing procedure on the pirate decoder, one hopes to trace back one of the traitors who registered in the system. But new techniques for pirates consist either in sending the ephemeral decryption keys to the decoders for real-time decryption, or in making the full content available on the web for later viewing. This way, the pirate does not send any personal information. In order to be able to trace the traitors, one should embed some information, or watermarks, in the multimedia content itself to make it specific to the registered users.

This paper addresses this problem of tracing traitors from the decoded multimedia content or rebroadcasted keys, without increasing too much the bandwidth requirements. More precisely, we construct a message-traceable encryption scheme that has an optimal ciphertext rate, i.e. the ratio of global ciphertext length over message length is arbitrarily close to one.

Keywords

Encryption Scheme Message Block Broadcast Encryption Semantic Security Security Game 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABN10]
    Abdalla, M., Bellare, M., Neven, G.: Robust Encryption. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 480–497. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. [BBKS07]
    Bellare, M., Boldyreva, A., Kurosawa, K., Staddon, J.: Multirecipient encryption schemes: How to save on bandwidth and computation without sacrificing security. IEEE Trans. on Info. Theory 53(11), 3927–3943 (2007)MathSciNetCrossRefGoogle Scholar
  3. [BF99]
    Boneh, D., Franklin, M.K.: An Efficient Public Key Traitor Scheme (Extended Abstract). In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 338–353. Springer, Heidelberg (1999)Google Scholar
  4. [BN08]
    Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: ACM CCS, pp. 455–470 (2008)Google Scholar
  5. [BP08]
    Billet, O., Phan, D.H.: Efficient Traitor Tracing from Collusion Secure Codes. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 171–182. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. [BP09]
    Billet, O., Phan, D.H.: Traitors Collaborating in Public: Pirates 2.0. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 189–205. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. [BS98]
    Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. on Information Theory 44(5), 1897–1905 (1998)MathSciNetMATHCrossRefGoogle Scholar
  8. [BT08]
    Blayer, O., Tassa, T.: Improved versions of tardos’ fingerprinting scheme. Designs, Codes and Cryptography 48(1), 79–103 (2008)MathSciNetMATHCrossRefGoogle Scholar
  9. [CFN94]
    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
  10. [FNP07]
    Fazio, N., Nicolosi, A., Phan, D.H.: Traitor Tracing with Optimal Transmission Rate. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 71–88. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. [FT99]
    Fiat, A., Tassa, T.: Dynamic Traitor Tracing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 354–371. Springer, Heidelberg (1999)Google Scholar
  12. [JL07]
    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)CrossRefGoogle Scholar
  13. [KP09]
    Kiayias, A., Pehlivanoglu, S.: Tracing and Revoking Pirate Rebroadcasts. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 253–271. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  14. [KP10]
    Kiayias, A., Pehlivanoglu, S.: Encryption for Digital Content. In: Advances in Information Security, vol. 52. Springer (2010)Google Scholar
  15. [KY02]
    Kiayias, A., Yung, M.: Traitor Tracing with Constant Transmission Rate. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 450–465. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. [LPQ11]
    Libert, B., Paterson, K.G., Quaglia, E.A.: Anonymous broadcast encryption. Cryptology ePrint Archive, Report 2011/476 (2011)Google Scholar
  17. [NSS99]
    Naccache, D., Shamir, A., Stern, J.P.: How to Copyright a Function? In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 188–196. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  18. [PPS11]
    Phan, D.H., Pointcheval, D., Strefler, M.: Security Notions for Broadcast Encryption. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 377–394. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  19. [PPS12]
    Phan, D.H., Pointcheval, D., Strefler, M.: Message-Based Traitor Tracing with Optimal Ciphertext Rate. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol. 7533, pp. 56–77. Springer, Heidelberg (2012)Google Scholar
  20. [Sir07]
    Sirvent, T.: Traitor tracing scheme with constant ciphertext rate against powerful pirates. In: Tillich, J.-P., Augot, D., Sendrier, N. (eds.) Proc. of Workshop on Coding and Cryptography (WCC 2007), pp. 379–388 (April 2007)Google Scholar
  21. [SNW00]
    Safavi-Naini, R., Wang, Y.: Sequential Traitor Tracing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 316–332. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  22. [Tar08]
    Tardos, G.: Optimal probabilistic fingerprint codes. Journal of the ACM 55(2) (May 2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Duong Hieu Phan
    • 1
    • 2
  • David Pointcheval
    • 2
  • Mario Strefler
    • 2
  1. 1.LAGAUniversity of Paris 8France
  2. 2.ENS / CNRS / INRIAFrance

Personalised recommendations