Abstract
It is known that Tardos’s collusion-secure probabilistic fingerprinting code (Tardos code) has length of theoretically minimal order. However, Tardos code uses certain continuous probability distribution, which causes that huge amount of extra memory is required in a practical use. An essential solution is to replace the continuous distributions with finite discrete ones, preserving the security. In this paper, we determine the optimal finite distribution for the purpose of reducing memory amount; the required extra memory is reduced to less than 1/32 of the original in some practical setting. Moreover, the code length is also reduced (to, asymptotically, about 20.6% of Tardos code), and some further practical problems such as approximation errors are also considered.
This study has been sponsored by the Ministry of Economy, Trade and Industry, Japan (METI) under contract, New-generation Information Security R&D Program, and by JSPS Grants-in-Aid for Scientific Research.
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
Boneh, D., Shaw, J.: Collusion-secure Fingerprinting for Digital Data. IEEE Trans. Inform. Th. 44, 1897–1905 (1998)
Engels, H.: Numerical Quadrature and Cubature. Academic Press, London (1980)
Hagiwara, M., Hanaoka, G., Imai, H.: A Short Random Fingerprinting Code against a Small Number of Pirates. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 2006. LNCS, vol. 3857, pp. 193–202. Springer, Heidelberg (2006)
Isogai, T., Muratani, H.: Reevaluation of Tardos’s Code. IEICE Technical Report, ISEC2006-96, pp. 7–12 (2006)
Isogai, T., Muratani, H.: An Evaluation of Tardos’s Asymptotic Code Length. In: Proc. of the 2007 Symposium on Cryptography and Information Security (SCIS 2007). The Institute of Electronics, Information and Communication Engineers (2007)
S̆korić, B., Vladimirova, T.U., Celik, M., Talstra, J.C.: Tardos Fingerprinting is Better than We Thought. e-print arXiv:cs.CR/0607131 (2006)
Szegö, G.: Orthogonal Polynomials. American Mathematical Society (1939)
Tardos, G.: Optimal Probabilistic Fingerprint Codes. J. ACM. Preliminary version appeared. In: Proc. of ACM Symposium on Theory of Computing 2003, Association for Computing Machinery, pp. 116–125 (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nuida, K., Hagiwara, M., Watanabe, H., Imai, H. (2007). Optimization of Tardos’s Fingerprinting Codes in a Viewpoint of Memory Amount. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds) Information Hiding. IH 2007. Lecture Notes in Computer Science, vol 4567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77370-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-77370-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77369-6
Online ISBN: 978-3-540-77370-2
eBook Packages: Computer ScienceComputer Science (R0)