Abstract
Recently, the authors proposed an evaluation technique for pseudorandom generator-based randomness reduction of cryptographic schemes against computationally unbounded attack algorithms. In this article, we apply the technique to the case of fingerprint codes and verify the effectiveness. Then we propose a technique that improves the randomness reduction by dividing the target randomness into suitable parts and using a separate pseudorandom generator for each part. Considering fingerprint codes as a typical example, we give a theoretical evaluation of the proposed technique, and also a numerical evaluation showing that our technique improves the effect of randomness reduction to about 29 times as good as the plain randomness reduction in a reasonable setting.
A part of 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.
References
Billet, O., Phan, D.H.: Efficient traitor tracing from collusion secure codes. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 171–182. Springer, Heidelberg (2008)
Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory 44, 1897–1905 (1998)
Caldwell, C.: The Top Twenty: Sophie Germain (p), http://primes.utm.edu/top20/page.php?id=2
Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257–270. Springer, Heidelberg (1994)
Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Proceedings of STOC 2006, pp. 711–720. ACM, New York (2006)
Farashahi, R.R., Schoenmakers, B., Sidorenko, A.: Efficient pseudorandom generators based on the DDH assumption. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 426–441. Springer, Heidelberg (2007)
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)
Kuribayashi, M., Akashi, N., Morii, M.: On the systematic generation of Tardos’s fingerprinting codes. In: Proceedings of MMSP 2008, pp. 748–753. IEEE, Los Alamitos (2008)
Lenstra, A.K., Verheul, E.R.: Selecting cryptographic key sizes. Journal of Cryptology 14, 255–293 (2001)
Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Imai, H.: An improvement of discrete Tardos fingerprinting codes. Designs, Codes and Cryptography 52, 339–362 (2009)
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)
Nuida, K., Hanaoka, G.: On the security of pseudorandomized information-theoretically secure schemes. In: The 4th International Conference on Information Theoretic Security (ICITS 2009), Shizuoka, Japan, December 4 (2009)
Tardos, G.: Optimal probabilistic fingerprint codes. In: Proceedings of STOC 2003, pp. 116–125. ACM Press, New York (2003)
Tardos, G.: Optimal probabilistic fingerprint codes. Journal of the ACM 55(2), 1–24 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nuida, K., Hanaoka, G. (2010). An Improvement of Pseudorandomization against Unbounded Attack Algorithms – The Case of Fingerprint Codes. In: Kurosawa, K. (eds) Information Theoretic Security. ICITS 2009. Lecture Notes in Computer Science, vol 5973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14496-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-14496-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14495-0
Online ISBN: 978-3-642-14496-7
eBook Packages: Computer ScienceComputer Science (R0)