Skip to main content
SpringerLink
Log in

Optimization and Evaluation of Randomized c-Secure CRT Code Defined on Polynomial Ring

  • Conference paper
Information Hiding (IH 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3200))

Included in the following conference series:

Abstract

An improved construction of a binary fingerprinting code is evaluated. The c-secure CRT code, a variant of the c-secure code, has shorter code length than the original construction by Boneh and Shaw. Recently, two improvements to this code have been proposed. We provide conditions determining the code length of the construction combined with these two improvements and provide the optimal setting of parameters. We compare the code length of the improved construction with that of the original construction. For any size of collusion, the code length is improved. In particular, for the collusion size c≥ 32, the code length of the improved code becomes about a tenth of the original c-secure CRT code.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boneh, D., Shaw, J.: Collusion-Secure Fingerprinting for Digital Data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452–465. Springer, Heidelberg (1995)

    Google Scholar 

  2. Lindkvist, T.: Fingerprinting digital document. PhD thesis, Linköping University (1999)

    Google Scholar 

  3. Löfvenberg, J.: Codes for Digital Fingerprinting. PhD thesis, Department of Electrical Engineering, Linköpnig University (2001)

    Google Scholar 

  4. Suzuoki, M., Watanabe, H., Kasami, T.: A scheme of marking collusion-secure watermark. In: SCIS 1997, vol. 31B (1997)

    Google Scholar 

  5. Watanabe, H., Kasami, T.: A Secure Code for Recipient Watermarking against Conspiracy Attacks by All Users. In: Information and Communication Security, pp. 414–423 (1997)

    Google Scholar 

  6. Yoshida, J., Iwamura, K., Imai, H.: A coding method for collusion-secure watermark and less decline. In: SCIS 1998. vol. (10.2A) (1998)

    Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Yacobi, Y.: Improved Boneh-Shaw content fingerprinting. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 378–391. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Muratani, H.: A Collusion-Secure Fingerprinting Code Reduced by Chinese Remaindering and Its Random-Error Resilience. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol. 2137, pp. 303–315. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Yoshioka, K., Matsumoto, T.: Random-error-resilient tracing algorithm for collusion-secure fingerprinting code. Technical Report of IEICE ISEC2001-52, 247–254 (2001)

    Google Scholar 

  11. Yoshioka, K., Matsumoto, T.: Random-Error-Resilient Tracing Algorithm for Collusion-Secure Fingerprinting Code (part 2). In: SCIS 2002, vol. II, pp. 1021–1026 (2002)

    Google Scholar 

  12. Yoshioka, K., Matsumoto, T.: Random-Error-Resilience of a Short Collusion- Secure Code. IEICE Trans. on Fundamentals E86-A, 1147–1155 (2003)

    Google Scholar 

  13. Kim, M., Shikata, J., Muratani, H., Imai, H.: Constructing c-secure codes using polynomials over finite fields. In: SITA2001 – The 24th Symposium on Information Theory and Its Applications. Number W-B-1-3, pp. 27–30 (2001)

    Google Scholar 

  14. Kim, M., Shikata, J., Muratani, H., Imai, H.: On the c-Secure CRT Codes. In: SCIS 2002, vol. II, pp. 1015–1019 (2002)

    Google Scholar 

  15. Kim, M., Shikata, J., Muratani, H., Imai, H.: Constructing c-Secure CRT Codes Using Polynomials over Finite Fields. IEICE Trans. on Fundamentals E86-A, 3256–3266 (2003)

    Google Scholar 

  16. Watanabe, H., Kitagawa, T.: An attack for a fingerprinting code and its success probability. In: ISITA 2002, pp. 555–558 (2002)

    Google Scholar 

  17. Watanabe, H., Kitagawa, T.: An ID coding scheme for fingerprinting, randomized c-secure CRT code. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 173–183. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Peikert, C., Shelat, A., Smith, A.: Lower Bounds for Collusion-Secure Fingerprinting. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003, pp. 472–479 (2003)

    Google Scholar 

  19. Tardos, G.: Optimal Probabilistic Fingerprinting Codes. In: STOC 2003, pp. 116–125. ACM, New York (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Corporate Research & Development Center, Toshiba Corporation, 1, Komukai-Toshiba-cho, Saiwai-ku, Kawasaki, Japan

    Hirofumi Muratani

Authors
  1. Hirofumi Muratani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Binghamton University, 13902-6000, BINGHAMTON, (NY)

    Jessica Fridrich

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Muratani, H. (2004). Optimization and Evaluation of Randomized c-Secure CRT Code Defined on Polynomial Ring. In: Fridrich, J. (eds) Information Hiding. IH 2004. Lecture Notes in Computer Science, vol 3200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30114-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30114-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24207-9

  • Online ISBN: 978-3-540-30114-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation