Abstract
This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as improved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information between the code sequence of a colluder and the pirated sequence. Second, an algorithm pertaining to the field of rare event analysis is presented in order to estimate the probabilities of error: the probability that an innocent user is framed, and the probabilities that all colluders are missed. Therefore, for a given collusion size, we are able to estimate the minimal length of the code satisfying some error probabilities constraints. This estimation is far lower than the known lower bounds.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Tardos, G.: Optimal probabilistic fingerprint codes. In: Proc. of the 35th annual ACM symposium on theory of computing, San Diego, CA, USA, pp. 116–125. ACM, New York (2003)
Skoric, B., Vladimirova, T., Celik, M., Talstra, J.: Tardos fingerprinting is better than we thought. IEEE Tran. on IT 54 (2008), arXiv:cs/0607131v1
Blayer, O., Tassa, T.: Improved versions of Tardos’ fingerprinting scheme. Des. Codes Cryptography 48, 79–103 (2008)
Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Imai, H.: An improvement of Tardos’s collusion-secure fingerprinting codes with very short lengths. In: Boztaş, S., Lu, H.-F(F.) (eds.) AAECC 2007. LNCS, vol. 4851, pp. 80–89. Springer, Heidelberg (2007)
Furon, T., Guyader, A., Cérou, F.: On the design and optimization of Tardos probabilistic fingerprinting codes. In: Solanki, K., Sullivan, K., Madhow, U. (eds.) IH 2008. LNCS, vol. 5284, pp. 341–356. Springer, Heidelberg (2008)
Moulin, P.: Universal fingerprinting: capacity and random-coding exponents. IEEE Transactions on Information Theory (2008) (submitted), http://arxiv.org/abs/0801.3837
Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory 44, 1897–1905 (1998)
Skoric, B., Katzenbeisser, S., Celik, M.: Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes. Designs, Codes and Cryptography 46, 137–166 (2008)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley series in Telecommunications (1991)
Lagnoux, A.: Rare event simulation. PEIS 20, 45–66 (2006)
Cérou, F., Furon, T., Guyader, A.: Experimental assessment of the reliability for watermarking and fingerprinting schemes. Accepted to EURASIP Jounal on Information Security (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furon, T., Pérez-Freire, L., Guyader, A., Cérou, F. (2009). Estimating the Minimal Length of Tardos Code. In: Katzenbeisser, S., Sadeghi, AR. (eds) Information Hiding. IH 2009. Lecture Notes in Computer Science, vol 5806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04431-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-04431-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04430-4
Online ISBN: 978-3-642-04431-1
eBook Packages: Computer ScienceComputer Science (R0)