Abstract
In this paper, we propose a variant of Tardos code which is practical for various applications against a small number of pirates. As an example of our results, for c=5, the code length becomes only 1500 log(1/ε) bits while the conventional Tardos code requires 2500 log(1/ε) bits, where ε is a security parameter.
Furthermore our codes do not need a continuous distribution which is needed to construct the original Tardos codes. Our codes are based on a simple random variable drawn from a small set. It implies that it makes to implement and to perform a simulation extremely easier than the original one.
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.
References
Search keywords “customer”, “data” and “loss” on internet search engines
Bark, A., Blakley, G.R., Kabatiansky, G.A.: Digital fingerprinting codes: Problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory 49(4), 852–865 (2003)
Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions of Information Theory 44, 480–491 (1998)
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)
Fernandez, M., Soriano, M.: Fingerprinting Concatenated Codes with Efficient Identification. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 459–470. Springer, Heidelberg (2002)
Schaathun, H.G.: Fighting three pirates with scattering codes. In: Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on Volume, June-2 July 2004, vol. (27), p. 202 (2004)
Schaathun, H.G., Fermandez, M.: Boneh-Shaw fingerprinting and soft decision decoding. IEEE ITSOC ITW 2005, Technical report no. 289 from Department of Informatics, UiB (January 2005)
Tardos, G.: Optimal Probabilistic Fingerprint Codes. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 116–125 (2003); Journal of the ACM (to appear)
Yoshida, J., Iwamura, K., Imai, H.: A Coding Method for Collusion-Secure Watermark and Less Decline. In: SCIS 1998,
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagiwara, M., Hanaoka, G., Imai, H. (2006). A Short Random Fingerprinting Code Against a Small Number of Pirates. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_19
Download citation
DOI: https://doi.org/10.1007/11617983_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31423-3
Online ISBN: 978-3-540-31424-0
eBook Packages: Computer ScienceComputer Science (R0)