Adaptive traitor tracing for large anonymous attack

ABSTRACT

In this paper we focus on traitor tracing technologies for the anonymous re-broadcasting attack where the attackers re-distribute the per-content encrypting key or the decrypted plain content. To defend against an anonymous attack, content is usually built with different variations. For example, content is divided into multiple segments, each segment comes with multiple variations, and each variation is differently encrypted. Each user/player can only play back one variation per segment through the content.

A typical traitor tracing scheme for re-broadcasting attack involves two basic steps, assigning the key/variation to devices (the assignment step) and detecting at least one traitor in the coalition when a series of pirated key/content are recovered (the coalition detection step). The traceability of a traitor tracing scheme is defined to be the number of recovered pirate copies of the content/keys needed in order to detect traitors. In [1] we presented a traitor detection scheme that tries to detect the entire coalition all together. This significantly improved the traditional one-by-one detection approaches in the literature. However, the traceability of the traitor detection scheme has a up limit that is constrained by the number of variations q one can build into the content. We are motivated to improve the traceability on a larger collusion attack and lift the up-limit on traceability with a given q. In this paper we will show a new traitor tracing approach that will assign the variations with skewed probabilities. Our approach not only lifts the tracing up-limit but also enables the tracing agency to assign the variations so as to maximize the traceability for a given coalition size. Our traceability results show that it is possible to achieve good traceability when traitor size exceeds q, and continue doing well even after the coalition size reaches q log q.

REFERENCES

• 1: H. Jin, J. Lotspich and N. Meggido, Efficient Coalition Detection in Traitor Tracing In proceeding of IFIP International conference on Information Security 2008, Sept 8--10, 2008, Milan, Italy
• 2: http://www.aacsla.com/specifications
• 3: D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information theory 44, No 5:1897--1905,1 998.
• 4: Benny Chor , Amos Fiat , Moni Naor, Tracing Traitors, Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology, p.257-270, August 21-25, 1994
• 5: B. Chor, F. A, M. Naor, and B. Pinkas. Tracing traitors. IEEE Transactions on Information Theory 46, 2000.
• 6: Amos Fiat , Tamir Tassa, Dynamic Traitor Training, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.354-371, August 15-19, 1999
• 7: D. S. J. N. Staddon and R. Wei. Combinatorial properties of frameproof and traceability codes.IEEE Transactions on Information Theory 47, 2001.
• 8: Reihaneh Safavi-Naini , Yejing Wang, Sequential Traitor Tracing, Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology, p.316-332, August 20-24, 2000
• 9: Hongxia Jin , Jeffery Lotspiech , Stefan Nusser, Traitor tracing for prerecorded and recordable media, Proceedings of the 4th ACM workshop on Digital rights management, October 25-25, 2004, Washington DC, USA [doi>10.1145/1029146.1029160]
• 10: Gábor Tardos, Optimal probabilistic fingerprint codes, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA [doi>10.1145/780542.780561]

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.6 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS
      K.6.5 Security and Protection (D.4.6, K.4.2)

Additional Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS

General Terms:
Design, Management, Security

Keywords:
content protection, security, traitor tracing