Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract

Abstract

Public-key traitor-tracing schemes is a supporting technology for content distribution that discourages abuse and resale of cryptographic keys used for the distribution. These schemes enable a system manager to maintain a set of subscribers so that any external content provider can use the public key nature of the method and transmit data to the subscribers, while assuring that if a coalition of users generate a pirate deciphering device, they can be identified via a procedure called "traitor tracing." The usefulness of efficient decoding in this context was exemplified in the work of Boneh and Franklin that showed how a specific family of codes can be combined with ElGamal encryption to produce a public-key traitor tracing scheme that supports non-black-box traitor tracing and recovers all traitors that contributed to the pirate key. In this work we are motivated by the notion of "Traitor Tracing with unbounded enrollment" that we define here, and we look for proper implementation thereof. To this end, we first generalize the Boneh Franklin approach to arbitrary code families by introducing Extended ElGamal encryption and showing an explicit condition under which the encryption can be transformed to traitor tracing, while also identifying cases where such transformation would not work; the properties are presented in terms of efficient decoding algorithms. The approach sheds light on the superlogarithmic (non-black-box) traceability of the Kurosawa-Desmedt public-key traitor tracing scheme that was only shown to support efficient tracing for a logarithmic number of traitors (in the black-box sense, where it was shown that logarithmic is optimal). Recall that the original non-black-box tracing algorithm of this scheme was found to be insufficient. We also show how to take advantage of list decoding techniques for non-black-box traitor tracing to extend the number of traitors that can be successfully traced. Finally, the Kurosawa Desmedt scheme accompanied with our tracing method is shown to be the first construction to implement traitor tracing with unbounded enrollment for an optimal number of traitors (for such a scheme) in both the non-black-box tracing case and the black-box tracing case.