Traitors Collaborating in Public: Pirates 2.0
- 2.6k Downloads
This work introduces a new concept of attack against traitor tracing schemes. We call attacks of this type Pirates 2.0 attacks as they result from traitors collaborating together in a public way. In other words, traitors do not secretly collude but display part of their secret keys in a public place; pirate decoders are then built from this public information. The distinguishing property of Pirates 2.0 attacks is that traitors only contribute partial information about their secret key material which suffices to produce (possibly imperfect) pirate decoders while allowing them to remain anonymous. The side-effect is that traitors can publish their contributed information without the risk of being traced; giving such strong incentives to some of the legitimate users to become traitors allows coalitions to attain very large sizes that were deemed unrealistic in some previously considered models of coalitions.
This paper proposes a generic model for this new threat, that we use to assess the security of some of the most famous traitor tracing schemes. We exhibit several Pirates 2.0 attacks against these schemes, providing new theoretical insights with respect to their security. We also describe practical attacks against various instances of these schemes. Eventually, we discuss possible variations on the Pirates 2.0 theme.
KeywordsSteiner Tree Secret Data Legitimate User Digital Right Management Direct Label
- 1.AACS LA. AACS Specifications, http://www.aacsla.com/specifications
- 2.AACS LA. Introduction and Common Cryptographic Elements. Downloaded from, http://www.aacsla.com/specifications/specs091/AACS_Spec_Common_0.91.pdf
- 5.Boneh, D., Naor, M.: Traitor tracing with constant size ciphertexts (2008)Google Scholar
- 7.Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452–465. Springer, Heidelberg (1995)Google Scholar
- 9.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.DefectiveByDesign, http://www.defectivebydesign.org/
- 11.Electronic Frontier Foundation, http://www.eff.org/
- 13.Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: Symposium on Foundations of Computer Science—FOCS 1984, pp. 464–479. IEEE, Los Alamitos (1984)Google Scholar
- 23.Sirvent, T.: Traitor tracing scheme with constant ciphertext rate against powerful pirates. In: Augot, D., Sendrier, N., Tillich, J.-P. (eds.) Workshop on Coding and Cryptography—WCC 2007, April 2007, pp. 379–388 (2007)Google Scholar
- 24.Stop DRM Now!, http://stopdrmnow.org/
- 25.Tardos, G.: Optimal probabilistic fingerprint codes. In: ACM Symposium on Theory of Computing—STOC 2003, pp. 116–125. ACM, New York (2003)Google Scholar