ABSTRACT
Fingerprinting codes, originally designed for embedding traceable fingerprints in digital content, have many applications in cryptography; most notably, they are used to construct traitor tracing systems. Recently there has been some interest in constructing robust fingerprinting codes: codes capable of tracing words even when the pirate adversarially destroys a δ fraction of the marks in the fingerprint. An early construction due to Boneh and Naor produces codewords whose length is proportional to c4/(1-δ)2 where c is the number of words at the adversary's disposal. Recently Nuida developed a scheme with codewords of length proportional to (c log c)2/(1-δ) 2. In this paper we introduce a new technique for constructing codes whose length is proportional to (c log c)2/(1-δ), which is asymptotically optimal up to logarithmic factors. These new codes lead to traitor tracing systems with constant size ciphertext and asymptotically shorter secret keys than previously possible.
- }}E Amiri and G. Tardos. High rate fingerprinting codes and the fingerprinting capacity. In SODA, pages 336--345, 2009. Google ScholarDigital Library
- }}O. Berkman, M. Parnas, and J. Sgall. Efficient dynamic traitor tracing. In Proceedings of SODA '00, 2000. Google ScholarDigital Library
- }}O. Billet and D. Phan. Efficient traitor tracing from collusion secure codes. In proceedings of the 3rd international conference on Information Theoretic Security, pages 171--182, 2008. Google ScholarDigital Library
- }}O. Blayer and T. Tassa. Improved versions of tardos' fingerprinting scheme. In Designs, Codes, and Cryptography, volume 48, pages 461--468, 2008. Google ScholarDigital Library
- }}Dan Boneh and Matthew K. Franklin. An efficient public key traitor tracing scheme. In CRYPTO '99: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pages 338--353, London, UK, 1999. Springer-Verlag. Google ScholarDigital Library
- }}Dan Boneh and Moni Naor. Traitor tracing with constant size ciphertext. In Proceedings of the ACM Conference on Computer and Communications Security (CCS), pages 501--510, 2008. Google ScholarDigital Library
- }}Dan Boneh, Amit Sahai, and Brent Waters. Fully collusion resistant traitor tracing with short ciphertexts and private keys. In Eurocrypt '06, 2006. Full version available at http://eprint.iacr.org/2006/045.Google ScholarDigital Library
- }}Dan Boneh and James Shaw. Collusion secure fingerprinting for digital data. IEEE Transactions on Information Theory, 44(5):1897--1905, 1998. Extended abstract in Crypto '95. Google ScholarDigital Library
- }}Dan Boneh and Brent Waters. A fully collusion resistant broadcast trace and revoke system with public traceability. In ACM Conference on Computer and Communication Security (CCS), 2006. Google ScholarDigital Library
- }}Hervé Chabanne, Duong Hieu Phan, and David Pointcheval. Public traceability in traitor tracing schemes. In EUROCRYPT, pages 542--558, 2005. Google ScholarDigital Library
- }}Benny Chor, Amos Fiat, and Moni Naor. Tracing traitors. In CRYPTO '94: Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, pages 257--270, London, UK, 1994. Springer-Verlag. Google ScholarDigital Library
- }}Benny Chor, Amos Fiat, Moni Naor, and Benny Pinkas. Tracing traitors. IEEE Transactions on Information Theory, 46(3):893--910, 2000. Google ScholarDigital Library
- }}Yevgeniy Dodis and Nelly Fazio. Public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In Public Key Cryptography - PKC 2003, volume 2567 of LNCS, pages 100--115, 2003. Google ScholarDigital Library
- }}N. Fazio, A. Nicolosi, and D. Phan. Traitor tracing with optimal transmission rate. In Proceedings of ISC'07, volume 4779 of LNCS, pages 71--88. springer, 2007. Google ScholarDigital Library
- }}Amos Fiat and T. Tassa. Dynamic traitor tracing. In Proceedings of Crypto '99, volume 1666 of LNCS, pages 354--371, 1999. Google ScholarDigital Library
- }}Eli Gafni, Jessica Staddon, and Yiqun Lisa Yin. Efficient methods for integrating traceability and broadcast encryption. In CRYPTO '99: Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, pages 372--387, London, UK, 1999. Springer-Verlag. Google ScholarDigital Library
- }}H. Guth and B. Pfitzmann. Error- and collusion-secure fingerprinting for digital data. In Information Hiding '99, volume 1768 of LNCS, pages 134--145, 1999. Google ScholarDigital Library
- }}Jon Johansen. DeCSS, 1999. http://en.wikipedia.org/wiki/DeCSS.Google Scholar
- }}Aggelos Kiayias and Serdar Pehlivanoglu. Tracing and revoking pirate rebroadcasts. In ACNS 2009, pages 253--271, 2009. Google ScholarDigital Library
- }}Aggelos Kiayias and Moti Yung. Traitor tracing with constant transmission rate. In EUROCRYPT '02: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, pages 450--465, London, UK, 2002. Springer-Verlag. Google ScholarDigital Library
- }}N. Kogan and T. Tassa. Improved efficiency for revocation schemes via newton interpolation. In ACM Transactions on Information and System Security, volume 9, pages 461--486, 2006. Google ScholarDigital Library
- }}K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In Proceedings of Eurocrypt '98, pages 145--157, 1998.Google ScholarCross Ref
- }}Shigeo Mitsunari, Ryuichi Sakai, and Masao Kasahara. A new traitor tracing. IEICE Trans. Fundamentals, E85-A(2):481--484, 2002.Google Scholar
- }}Dalit Naor, Moni Naor, and Jeffrey B. Lotspiech. Revocation and tracing schemes for stateless receivers. In CRYPTO '01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pages 41--62, London, UK, 2001. Springer-Verlag. Google ScholarDigital Library
- }}Moni Naor and Benny Pinkas. Threshold traitor tracing. In CRYPTO '98: Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, pages 502--517, London, UK, 1998. Springer-Verlag. Google ScholarDigital Library
- }}Moni Naor and Benny Pinkas. Efficient trace and revoke schemes. In FC '00: Proceedings of the 4th International Conference on Financial Cryptography, pages 1--20, London, UK, 2001. Springer-Verlag. Google ScholarDigital Library
- }}Koji Nuida. A general conversion method of fingerprint codes to (more) robust fingerprint codes against bit erasure. In ICITS 2009, 2009. Google ScholarDigital Library
- }}Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, and Hideki Imai. An improvement of tardos's collusion-secure fingerprinting codes with very short lengths. In AAECS 2007, volume 4851 of LNCS. springer, 2007. Google ScholarDigital Library
- }}Chris Peikert, Abhi Shelat, and Adam Smith. Lower bounds for collusion-secure fingerprinting. In SODA 2003, pages 472--479, 2003. Google ScholarDigital Library
- }}Reihaneh Safavi-Naini and Yejing Wang. Sequential traitor tracing. In Proceedings of Crypto '00, volume 1880 of LNCS, pages 316--332, 2000. Google ScholarDigital Library
- }}Alice Silverberg, Jessica Staddon, and Judy L. Walker. Efficient traitor tracing algorithms using list decoding. In Proceedings of ASIACRYPT '01, volume 2248 of LNCS, pages 175--192, 2001. Google ScholarDigital Library
- }}T. Sirvent. Traitor tracing scheme with constant ciphertext rate against powerful pirates. In Workshop on Coding and Cryptography, 2007.Google Scholar
- }}Boris Skoric, Stefan Katzenbeisser, and Mehmet Utku Celik. Symmetric tardos fingerprinting codes for arbitrary alphabet sizes. Des. Codes Cryptography, 46(2):137--166, 2008. Google ScholarDigital Library
- }}Jessica N. Staddon, Douglas R. Stinson, and Ruizhong Wei. Combinatorial properties of frameproof and traceability codes. Cryptology ePrint 2000/004, 2000.Google Scholar
- }}D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal on Discrete Math, 11(1):41--53, 1998. Google ScholarDigital Library
- }}D. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. In Proceedings of SAC '98, volume 1556 of LNCS, 1998. Google ScholarDigital Library
- }}Gabor Tardos. Optimal probabilistic fingerprint codes. In Proceedings of STOC '03, pages 116--125, 2003. Google ScholarDigital Library
- }}T. Tassa. Low bandwidth dynamic traitor tracing schemes. In Journal of Cryptology, volume 18, pages 167--183, 2005. Google ScholarDigital Library
- }}V. To, R. Safavi-Naini, and F. Zhang. New traitor tracing schemes using bilinear map. In Proceedings of 2003 DRM Workshop, 2003. Google ScholarDigital Library
Index Terms
Robust fingerprinting codes: a near optimal construction
Recommendations
Constructions of almost secure frameproof codes with applications to fingerprinting schemes
This paper presents explicit constructions of fingerprinting codes. The proposed constructions use a class of codes called almost secure frameproof codes. An almost secure frameproof code is a relaxed version of a secure frameproof code, which in turn ...
Generic Codes Based Traitor Tracing and Revoking Scheme from Attribute-Based Encryption
CIT '14: Proceedings of the 2014 IEEE International Conference on Computer and Information TechnologyIn broadcast encryption system, traitor tracing is helpful to find out the traitors who give out their decryption keys to construct pirate decoders. Many codes based traitor tracing schemes were proposed. However, there is no work that shows the ...
Further analysis of pairing-based traitor tracing schemes for broadcast encryption
Pairing-based public key systems have recently received much attention because bilinear property contributes to the designs of many cryptographic schemes. In 2002, Mitsunari et al. proposed the first pairing-based traitor tracing scheme with constant-...
Comments