Recently, Fiat and Tassa proposed a dynamic traitor tracing scenario, in which the algorithm adapts dynamically according to the responses of the pirate. We prove optimal bounds on the number of ruunds needed to catch the pirates.
Recently, Fiat and Tassa proposed a dynamic traitor tracing scenario, in which the algorithm adapts dynamically according to the responses of the pirate. We prove optimal bounds on the number of ruunds needed to catch the pirates. (en)