Improved Boneh-Shaw Content Fingerprinting

  • Authors:
  • Yacov Yacobi

  • Affiliations:
  • -

  • Venue:
  • CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

We improve on the Boneh-Shaw Fingerprinting scheme in two ways: (i) We merge a Direct Sequence Spread Spectrum (DSSS) embedding layer with the first Boneh-Shaw layer (the so called "驴 code"), effiectively increasing the protected object size by about four orders of magnitude. As a result we have more than one order of magnitude improvement 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.