Message-Based Traitor Tracing with Optimal Ciphertext Rate

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.

[1]  David Naccache,et al.  How to Copyright a Function? , 1999, Public Key Cryptography.

[2]  Mihir Bellare,et al.  Robust Encryption , 2010, TCC.

[3]  Matthew K. Franklin,et al.  An Efficient Public Key Traitor Tracing Scheme , 1999, CRYPTO.

[4]  Olivier Billet,et al.  Efficient Traitor Tracing from Collusion Secure Codes , 2008, ICITS.

[5]  Olivier Billet,et al.  Traitors Collaborating in Public: Pirates 2.0 , 2009, EUROCRYPT.

[6]  Thomas Sirvent.  Traitor tracing scheme with constant ciphertext rate against powerful pirates , 2006, IACR Cryptol. ePrint Arch..

[7]  Mihir Bellare,et al.  Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security , 2007, IEEE Transactions on Information Theory.

[8]  Serdar Pehlivanoglu,et al.  Tracing and Revoking Pirate Rebroadcasts , 2009, ACNS.

[9]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[10]  Duong Hieu Phan,et al.  Traitor Tracing with Optimal Transmission Rate , 2007, ISC.

[11]  Kenneth G. Paterson,et al.  Anonymous Broadcast Encryption , 2011, IACR Cryptol. ePrint Arch..

[12]  Amos Fiat,et al.  Dynamic Traitor Tracing , 2001, Journal of Cryptology.

[13]  Mihir Bellare.  Advances in Cryptology — CRYPTO 2000 , 2000, Lecture Notes in Computer Science.

[14]  Reihaneh Safavi-Naini,et al.  Sequential Traitor Tracing , 2000, CRYPTO.

[15]  Hongxia Jin,et al.  Renewable Traitor Tracing: A Trace-Revoke-Trace System For Anonymous Attack , 2007, ESORICS.

[16]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[17]  Amos Fiat,et al.  Dynamic Traitor Training , 1999, CRYPTO.

[18]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[19]  David Pointcheval,et al.  Security Notions for Broadcast Encryption , 2011, ACNS.

[20]  Moni Naor,et al.  Traitor tracing with constant size ciphertext , 2008, CCS.

[21]  Serdar Pehlivanoglu,et al.  Encryption for Digital Content , 2010, Advances in Information Security.

[22]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

[23]  Moti Yung,et al.  A New Randomness Extraction Paradigm for Hybrid Encryption , 2009, EUROCRYPT.

[24]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

[25]  Tamir Tassa,et al.  Improved versions of Tardos’ fingerprinting scheme , 2008, Des. Codes Cryptogr..

[26]  Aggelos Kiayias,et al.  Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.

[27]  Amos Fiat,et al.  Tracing Traitors , 1994, CRYPTO.

[28]  Joachim Biskup,et al.  Computer Security - ESORICS 2007, 12th European Symposium On Research In Computer Security, Dresden, Germany, September 24-26, 2007, Proceedings , 2007, ESORICS.