Dynamic Traitor Tracing with Near Optimal Codes

No Thumbnail Available
File version
Author(s)
Wu, Xin-Wen
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2015
Size
File type(s)
Location

Groningen, Netherlands

License
Abstract

For static traitor tracing, the codes proposed by Tardos are the best known codes with regard to code length. Tardos codes are asymptotic optimal according to the low bound on code length proved by Peikert et al. The computational complexity of the tracing algorithm for Tardos codes is O(N), where N is the number of authorized users. Recently, Tardos codes have been adapted to dynamic traitor tracing. The adapted codes have the same tracing complexity as Tardos codes, that is, O(N). In this extended abstract, we report our research of attempting to develop dynamic traitor-tracing schemes, using the nearoptimal codes obtained from the concatenation of Tardos codes and algebraic-geometric codes, which allow an efficient tracing procedure with complexity O(log(N)).

Journal Title
Conference Title

Proceedings of the 21st International Symposium on Mathematical Theory of Networks and Systems

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Coding and Information Theory

Persistent link to this record
Citation