Improved versions of Tardos’ fingerprinting scheme |
| |
Authors: | Oded Blayer Tamir Tassa |
| |
Institution: | (1) Department of Mathematics and Computer Science, The Open University of Israel, 108 Ravutzki St., Ra’anana, Israel |
| |
Abstract: | We study the Tardos’ probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of
approximately 4. We achieve this by retracing Tardos’ analysis of the scheme and extracting from it all constants that were
arbitrarily selected. We replace those constants with parameters and derive a set of inequalities that those parameters must
satisfy so that the desired security properties of the scheme still hold. Then we look for a solution of those inequalities
in which the parameter that governs the codeword length is minimal. A further reduction in the codeword length is achieved
by decoupling the error probability of falsely accusing innocent users from the error probability of missing all colluding
pirates. Finally, we simulate the Tardos scheme and show that, in practice, one may use codewords that are shorter than those
in the original Tardos scheme by a factor of at least 16.
|
| |
Keywords: | Fingerprinting Watermarking Traitor tracing schemes |
本文献已被 SpringerLink 等数据库收录! |
|