Skip to main content
Springer Nature Link
Log in

Bounds on the Number of Users for Random 2-Secure Codes

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5527))

Abstract

An illegal re-distribution problem is a problem that a regular user who received content re-distributes without legal permutation. This becomes a social problem all over the world. As it is indicated in [2], this problem has been known since a few or more handred years ago. Boneh and Shaw formalize this problem as collusion-secure fingerprinting (c-secure code) for digital data [2]. After their work, study of c-secure code has become one of popular research stream for information security [1]. One of remarkable results is called Tardos’s code [5]. Tardos’s code achieved to construct approximately optimal length c-secure codes with random coding method.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Amiri, E., Trados, G.: High rate fingerprinting codes and the fingerprinting capacity. In: Proc. of the Twentieth Annual ACM-SIAM Symp. on Discrete Algorithms

    Google Scholar 

  2. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions of Information Theory 44, 480–491 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Schaathun, H.G.: Fighting three pirates with scattering codes. In: Proc. Inter. Symp. on Information Theory, 2004. ISIT 2004, June-2 July, vol. 27, p. 202 (2004)

    Google Scholar 

  4. Hagiwara, M., et al.: 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)

    Chapter  Google Scholar 

  5. Tardos, G.: Optimal Probabilistic Fingerprint Codes. In: Proceedings of the 35th Annual ACM Symp. on Theory of Computing, pp. 116–125 (2003); J. of the ACM (to appear)

    Google Scholar 

  6. Website of Motion Picture Producers Association of Japan, Inc., http://www.eiren.org/history_e/index.html

Download references

Author information

Authors and Affiliations

  1. Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, 1-18-13 Sotokanda, Chiyoda-ku, Tokyo, 101-0021, Japan

    Manabu Hagiwara, Takahiro Yoshida & Hideki Imai

  2. Center for Research and Development Initiative, Chuo University, 1-13-27 Kasuga, Bunkyo-ku, Tokyo, Japan

    Manabu Hagiwara & Takahiro Yoshida

  3. Faculty of Science and Engineering, Chuo University, Kasuga, Bunkyo-ku, Tokyo, 112-8551, Japan

    Hideki Imai

Authors
  1. Manabu Hagiwara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takahiro Yoshida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hideki Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Avinguda Països Catalans, 26, 43007, Tarragona, Spain

    Maria Bras-Amorós

  2. Department of Mathematics, The Technical University of Denmark, Building 303, 2800, Lyngby, Denmark

    Tom Høholdt

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hagiwara, M., Yoshida, T., Imai, H. (2009). Bounds on the Number of Users for Random 2-Secure Codes. In: Bras-Amorós, M., Høholdt, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2009. Lecture Notes in Computer Science, vol 5527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02181-7_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02181-7_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02180-0

  • Online ISBN: 978-3-642-02181-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics