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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory 44(5), 1897–1905 (1998). See also Proceedings of the Crypto 95. Springer LNCS, vol. 963, pp. 452–465 (1995).
Chor B., Fiat A., Naor M.: Tracing traitors. In: Proceedings of the Crypto 94. Springer LNCS, vol. 839, pp. 257–270 (1994). For a full version see [3].
Chor, B., Fiat, A., Naor, M., Pinkas, B.: Tracing traitors. IEEE Trans. Inform. Theory 46(3), 893–910 (2000)
Cox I.J., Kilian J., Leighton T., Shamoon T.: A secure, robust watermark for multimedia. In: Information Hiding. Springer LNCS, vol. 174, pp. 185–226 (1996).
Fiat A., Tassa T.: Dynamic traitor tracing. J Cryptol. 14(3), 211–223 (2001). See also Proceedings of the Crypto 99. Springer LNCS, vol. 1666, pp. 537–554 (1999).
Tardos G.: Optimal probabilistic fingerprint codes. In: Proceedings of the 35th ACM Symposium on Theory of Computing, STOC’03. ACM, pp. 116–125.
Tardos G.: Optimal probabilistic fingerprint codes. J. ACM (to appear). Available also in http://www.renyi.hu/tardos/fingerprint.ps.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by H. Wang.
Rights and permissions
About this article
Cite this article
Blayer, O., Tassa, T. Improved versions of Tardos’ fingerprinting scheme. Des. Codes Cryptogr. 48, 79–103 (2008). https://doi.org/10.1007/s10623-008-9200-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9200-z