Recently, Fiat and Tassa proposed a dynamic traitor tracing scenario, in which the algorithm adapts dynamically according to the responses of the pirate. Our main result is an algorithm which locates all traitors using an optimal number of rounds.
Recently, Fiat and Tassa proposed a dynamic traitor tracing scenario, in which the algorithm adapts dynamically according to the responses of the pirate. Our main result is an algorithm which locates all traitors using an optimal number of rounds. (en)