Short 3-Secure Fingerprinting Codes for Copyright Protection

  • Francesc Sebé
  • Josep Domingo-Ferrer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2384)


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.


Electronic copyright protection Fingerprinting Watermarking Buyer collusion 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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.CrossRefMathSciNetGoogle Scholar
  3. 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.CrossRefGoogle Scholar
  4. 4.
    F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Francesc Sebé
    • 1
  • Josep Domingo-Ferrer
    • 1
  1. 1.Dept. of Computer Engineering and MathematicsUniversitat Rovira i VirgiliTarragona, CataloniaSpain

Personalised recommendations