Abstract
In recent research on collusion-secure fingerprint codes, some relaxation of the conventional security assumption (Marking Assumption) have been introduced from a viewpoint of reality in practical situations, and several fingerprint codes have been proposed under those assumptions. In this article, we consider such a relaxed assumption and give an extension of short 2-secure codes (under Marking Assumption) recently proposed by Nuida et al. (IEICE Trans. A, 2009) to our assumption. We perform theoretical and numerical evaluation of security and required code lengths. For example, to bound the error probability by 0.01% for 10,000 users, 162-bit, 220-bit and 329-bit lengths are sufficient even if each bit of the fingerprint codeword is either flipped (in addition to other collusion attacks) with probabilities 1%, 2.5% and 5%, respectively, or erased with probabilities 2%, 5% and 10%, respectively.
This work was supported by 2007 Research Grants of the Science and Technology Foundation of Japan (JSTF).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amiri, E., Tardos, G.: High Rate Fingerprinting Codes and the Fingerprinting Capacity. In: Proc. SODA 2009, pp. 336–345. ACM, New York (2009)
Blakley, G.R., Kabatiansky, G.: Random Coding Technique for Digital Fingerprinting Codes. In: Proc. IEEE ISIT 2004, p. 202. IEEE, Los Alamitos (2004)
Boneh, D., Naor, M.: Traitor Tracing with Constant Size Ciphertext. In: Proc. ACM CCS 2008, pp. 501–510. ACM, New York (2008)
Boneh, D., Shaw, J.: Collusion-Secure Fingerprinting for Digital Data. IEEE Trans. Inform. Th. 44, 1897–1905 (1998)
Cotrina-Navau, J., Fernandez, M., Soriano, B.M.: A Family of Collusion 2-Secure Codes. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 387–397. Springer, Heidelberg (2005)
Furon, T., Pérez-Freire, L.: Worst Case Attacks against Binary Probabilistic Traitor Tracing Codes. Preprint, arXiv:0903.3480v1 (2009)
Fernandez, M., Soriano, M.: Fingerprinting Concatenated Codes with Efficient Identification. In: Chan, A.H., Gligor, V. (Eds.), ISC 2002. LNCS, vol. 2433, pp. 459–470. Springer (2002)
Guth, H.-J., Pfitzmann, B.: Error- and Collusion-Secure Fingerprinting for Digital Data. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 134–145. Springer, Heidelberg (2000)
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)
Moulin, P.: Universal Fingerprinting: Capacity and Random-Coding Exponents. Preprint, arXiv:0801.3837v2 (2008)
Nuida, K., Fujitsu, S., Hagiwara, M., Imai, H., Kitagawa, T., Ogawa, K., Watanabe, H.: An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation. IEICE Trans. Fundamentals E92-A(1), 197–206 (2009)
Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Imai, H.: An Improvement of Discrete Tardos Fingerprinting Codes. Des. Codes Cryptogr. 52, 339–362 (2009)
Nuida, K., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Fujitsu, S., Imai, H.: A Tracing Algorithm for Short 2-Secure Probabilistic Fingerprinting Codes Strongly Protecting Innocent Users. In: Proc. IEEE CCNC 2007, pp. 1068–1072. IEEE, Los Alamitos (2007)
Nuida, K., Hagiwara, M., Watanabe, H., Imai, H.: Optimization of Tardos’s Fingerprinting Codes in a Viewpoint of Memory Amount. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 279–293. Springer, Heidelberg (2008)
Tardos, G.: Optimal Probabilistic Fingerprint Codes. J. ACM 55(2), 1–24 (2008)
Tô, V.D., Safavi-Naini, R., Wang, Y.: A 2-secure code with efficient tracing algorithm. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 149–162. Springer, Heidelberg (2002)
Sirvent, T.: Traitor Tracing Scheme with Constant Ciphertext Rate against Powerful Pirates. In: Proc. WCC 2007, pp. 379–388. INRIA (2007)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)
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
Nuida, K. (2009). An Error-Tolerant Variant of a Short 2-Secure Fingerprint Code and Its Security Evaluation . In: Takagi, T., Mambo, M. (eds) Advances in Information and Computer Security. IWSEC 2009. Lecture Notes in Computer Science, vol 5824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04846-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-04846-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04845-6
Online ISBN: 978-3-642-04846-3
eBook Packages: Computer ScienceComputer Science (R0)