Efficient Traitor Tracing Algorithms using List Decoding

Authors

Alice Silverberg, The Ohio State UniversityFollow
Jessica Staddon, Palo Alto Research Center Inc.Follow
Judy L. Walker, University of Nebraska - LincolnFollow

Date of this Version

2001

Citation

Silverberg A., Staddon J., Walker J.L. (2001) Efficient Traitor Tracing Algorithms Using List Decoding. In: Boyd C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg

doi 10.1007/3-540-45682-1_11

Comments

© Springer-Verlag Berlin Heidelberg 2001. Used by permission

Abstract

We use powerful new techniques for list decoding error-correcting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes, the complexity of the tracing algorithm has received little attention. Because the TA tracing algorithm has a runtime of O(N) in general, where N is the number of users, it is inefficient for large populations.We produce schemes for which the TA algorithm is very fast. The IPP tracing algorithm, though less efficient, can list all coalitions capable of constructing a given pirate. We give evidence that when using an algebraic structure, the ability to trace with the IPP algorithm implies the ability to trace with the TA algorithm. We also construct schemes with an algorithm that finds all possible traitor coalitions faster than the IPP algorithm. Finally, we suggest uses for other decoding techniques in the presence of additional information about traitor behavior.