Skip to main content

Short 3-Secure Fingerprinting Codes for Copyright Protection

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 2002)

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

Included in the following conference series:

Abstract

A construction is presented to obtain 3-secure fingerprinting codes for copyright protection. Resistance against collusions of up to three buyers is achieved with a codeword length dramatically shorter than the one required by the general Boneh-Shaw construction. Thus the proposed fingerprints require much less embedding capacity. Due to their very clandestine nature, collusions tend to involve a small number of buyers, so that there is plenty of use for codes providing cost-effective protection against collusions of size up to 3.

This work has been partly supported by the European Commission under project IST-2001-32012 “Co-Orthogonal Codes” and by the Spanish Ministry of Science and Technology and the European FEDER fund through project no. TIC2001-0633-C03-01 “STREAMOBILE”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. D. Boneh and J. Shaw, “Collusion-secure fingerprinting for digital data”, in Advances in Cryptology-CRYPTO’95, LNCS 963, pp. 452–465, 1995.

    Google Scholar 

  2. D. Boneh and J. Shaw, “Collusion-secure fingerprinting for digital data”, IEEE Trans. Inf. Theory, vol IT-44, no. (5), pp. 1897–1905, 1998.

    Article  MathSciNet  Google Scholar 

  3. J. Domingo-Ferrer and J. Herrera-Joancomartí, “Short collusion-secure fingerprints based on dual binary Hamming codes”, Electronics Letters, vol. 36, no. 20, pp. 1697–1699, 2000.

    Article  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sebé, F., Domingo-Ferrer, J. (2002). Short 3-Secure Fingerprinting Codes for Copyright Protection. In: Batten, L., Seberry, J. (eds) Information Security and Privacy. ACISP 2002. Lecture Notes in Computer Science, vol 2384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45450-0_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-45450-0_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43861-8

  • Online ISBN: 978-3-540-45450-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics