Abstract
G. Tardos [1] was the first to give a construction of a fingerprinting code whose length meets the lowest known bound in \(O(c^{2}\log\frac{n}{\epsilon_{1}})\). This was a real breakthrough because the construction is very simple. Its efficiency comes from its probabilistic nature. However, although G. Tardos almost gave no argument of his rationale, many parameters of his code are precisely fine-tuned. This paper proposes this missing rationale supporting the code construction. The key idea is to render the statistics of the scores as independent as possible from the collusion process. Tardos optimal parameters are rediscovered. This interpretation allows small improvements when some assumptions hold on the collusion process.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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., Katzenbeisser, S., Celik, M.: Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes. Designs, Codes and Cryptography 46, 137–166 (2008)
Skoric, B., Vladimirova, T., Celik, M., Talstra, J.: Tardos fingerprinting is better than we thought (2006) arXiv:cs/0607131v1
Nuida, K., Hagiwara, M., Watanabe, H., Imai, H.: Optimal probabilistic fingerprinting codes using optimal finite random variables related to numerical quadrature (2006) arXiv:cs/0610036v2
Katzenbeisser, S., Skoric, B., Celik, M., Sadeghi, A.R.: Combining Tardos fingerprinting codes and fingercasting. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 294–310. Springer, Heidelberg (2008)
Barg, A., Blakley, G.R., Kabatiansky, G.A.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inform Theory 49, 852–865 (2003)
Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory 44, 1897–1905 (1998)
Safavi-Naini, R., Wang, Y.: Collusion-secure q-ary fingerprinting for perceptual content. In: Sander, T. (ed.) DRM 2001. LNCS, vol. 2320, pp. 57–75. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Furon, T., Guyader, A., Cérou, F. (2008). On the Design and Optimization of Tardos Probabilistic Fingerprinting Codes. In: Solanki, K., Sullivan, K., Madhow, U. (eds) Information Hiding. IH 2008. Lecture Notes in Computer Science, vol 5284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88961-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-88961-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88960-1
Online ISBN: 978-3-540-88961-8
eBook Packages: Computer ScienceComputer Science (R0)