Skip to main content

Improved Boneh-Shaw Content Fingerprinting

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2001 (CT-RSA 2001)

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

Included in the following conference series:

Abstract

We improve on the Boneh-Shaw Fingerprinting scheme in two ways: (i) We merge a Direct Sequence Spread Spectrum (DSSS) em- bedding layer with the first Boneh-Shaw layer (the so called “Γ code”), effectively increasing the protected object size by about four orders of magnitude. As a result we have more than one order of magnitude impro- vement on the size of collusions that we can overcome. (ii) We replace the “marking assumption” with a more realistic assumption, allowing random jamming on the so called “unseen” bits.

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 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. N. Alon, J.H. Spencer, and P. Erdös The Probabilistic Method, Wiley Interscience, ISBN 0-471-53588-5

    Google Scholar 

  2. Josh Benaloh, Private Communication.

    Google Scholar 

  3. D. Boneh, Shaw: Collusion Secure Fingerprinting for Digital Data, by D. Boneh, and J. Shaw. IEEE Transactions on Information Theory, Vol 44, No. 5, pp. 1897–1905, 1998. Extended abstract in Proceedings of Crypto’ 95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, pp. 452–465, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. Chor, Fiat, Naor: Traitor Tracing, Crypto’94, Yvo Desmedt Ed., pp.257–270; Springer-Verlag LNCS 839.

    Google Scholar 

  5. A. Fiat and T. Tassa: Dynamic Traitor Tracing, Proc. Crypto’99, pp. 354–371, Michael Wiener Ed., Springer-Verlag LNCS 1666.

    Google Scholar 

  6. O. Goldreich: On the Foundations of Modern Cryptography, Proc. Crypto 97. pp. 46–74, Burton S. Kaliski Ed., Springer-Verlag LNCS 1294.

    Chapter  Google Scholar 

  7. Funda Ergun, Joe Kilian, and Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks, Proc. Eurocrypt’99, Springer Verlag LNCS 1592, 1999, J. Stern Ed.

    Google Scholar 

  8. Rajeev Motwani and Prabhakar Raghavan: Randomized Algorithms, Cambridge U. press, 1995, ISBN 0 521 47465 5

    Google Scholar 

  9. J. Van Leeuwen: Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yacobi, Y. (2001). Improved Boneh-Shaw Content Fingerprinting. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-45353-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41898-6

  • Online ISBN: 978-3-540-45353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics