Skip to main content
SpringerLink
Log in

Short c-Secure Fingerprinting Codes

  • Conference paper
Information Security (ISC 2003)

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

Included in the following conference series:

Abstract

In this paper we consider c-secure fingerprinting codes for copyright protection. We construct a probabilistic fingerprint code and show that at least one colluder in a coalition of up to c users can be traced with high probability. We prove that this code is shorter than the Boneh-Shaw code. In addition, we show that it is asymptotically optimal when c is constant.

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. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory IT-44(5), 1897–1905 (1998)

    Article  MathSciNet  Google Scholar 

  3. Sebe, F., Domingo-Ferrer, J.: Short 3-secure fingerprinting codes for copyright protection. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 316–327. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Domingo-Ferrer, J., Herrera-Joancomarti, J.: Short collusion-secure fingerprints based on dual binary Hamming codes. Electronics Letters 36(20), 1697–1699 (2000)

    Article  Google Scholar 

  5. Hoeffding, W.: Probability inequalities for some of bounded random variables. American Statistical Association Journal, 13–30 (1963)

    Google Scholar 

  6. Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics 23, 493–509 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  7. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Florida State University, Tallahassee, FL, 32306-4530, USA

    Tri Van Le, Mike Burmester & Jiangyi Hu

Authors
  1. Tri Van Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mike Burmester
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiangyi Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Institute, Queensland University of Technology, GPO Box 2434, Qld 4001, Brisbane, Australia

    Colin Boyd

  2. Hewlett-Packard Laboratories, Filton Road, Stoke Gifford, BS34 8QZ, Bristol, UK

    Wenbo Mao

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Le, T., Burmester, M., Hu, J. (2003). Short c-Secure Fingerprinting Codes. In: Boyd, C., Mao, W. (eds) Information Security. ISC 2003. Lecture Notes in Computer Science, vol 2851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10958513_32

Download citation

  • DOI: https://doi.org/10.1007/10958513_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20176-2

  • Online ISBN: 978-3-540-39981-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation