Skip to main content
SpringerLink
Log in

Collusion Secure q-ary Fingerprinting for Perceptual Content

  • Conference paper
  • First Online:
Security and Privacy in Digital Rights Management (DRM 2001)

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

Included in the following conference series:

Abstract

We propose a q-ary fingerprinting system for stored digital objects such as images, videos and audio clips. A fingerprint is a q-ary sequence. The object is divided into blocks and each symbol of the fingerprint is embedded into one block. Colluders construct a pirate object by assembling parts from their copies. They can also erase some of the marks or cut out part of the object resulting in a shortened fingerprint with some unreadable marks. We give constructions of codes that can identify one of the colluders once a pirate object is found.

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. D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. In Advances in Cryptology — CRYPTO’95, Lecture Notes in Computer Science, volume 963, pages 453–465. Springer-Verlag, Berlin, Heidelberg, New York, 1995.

    Google Scholar 

  2. D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory, Vol. 44, No. 5:1897–1905, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Chor, A. Fiat, and M. Naor. Tracing traitors. In Advances in Cryptology-CRYPTO’94, Lecture Notes in Computer Science, volume 839, pages 257–270. Springer-Verlag, Berlin, Heidelberg, New York, 1994.

    Google Scholar 

  4. I. Cox, J. Killian, T. Leighton, and T. Shamoon. Secure spread spectrum watermarking for multimedia. IEEE Transaction on Image Processing, Vol. 6, No. 12:1673–1687, 1997.

    Article  Google Scholar 

  5. J. Dittmann, A. Behr, M. Stabenau, P. Schmitt, J. Schwenk, and J. Ueberberg. Combining digital watermarks and collusion secure fingerprinting for digital images. In Proceedings of SPIE, volume 3657, pages 171–182, 1999.

    Article  Google Scholar 

  6. F. Ergun, J. Kilian, and R. Kumar. A note on the limits of collusion-resistant watermarks. In Advances in Cryptology — EUROCRYPT’99, Lecture Notes in Computer Science, volume 1592, pages 140–149. Springer-Verlag, Berlin, Heidelberg, New York, 1999.

    Google Scholar 

  7. A. Fiat and M. Naor. Broadcast encryption. In Advances in Cryptology — CRYPTO’93, Lecture Notes in Computer Science, volume 773, pages 480–491. Springer-Verlag, Berlin, Heidelberg, New York, 1994.

    Google Scholar 

  8. A. Fiat and T. Tassa. Dynamic traitor tracing. In Advances in Cryptology — CRYPTO’99, Lecture Notes in Computer Science, volume 1666, pages 354–371. Springer-Verlag, Berlin, Heidelberg, New York, 1999.

    Chapter  Google Scholar 

  9. E. Gafni, J. Staddon, and Y. L. Yin. Efficient methods for integrating traceability and broadcast encryption. In Advances in Cryptology — CRYPTO’99, Lecture Notes in Computer Science, volume 1666, pages 372–387. Springer-Verlag, Berlin, Heidelberg, New York, 1999.

    Chapter  Google Scholar 

  10. H. Guth and B. Pfitzmann. Error-and collusion-secure fingerprinting for digital data. In Information Hiding’99, Lecture Notes in Computer Science, volume 1768, pages 134–145. Springer-Verlag, Berlin, Heidelberg, New York, 2000.

    Chapter  Google Scholar 

  11. H. D. L. Hollmann. A relation between Levenshtein-type distances and insertionand-deletion correcting capabilities of codes. IEEE Transactions on Information Theory, Vol. 39, No. 4:1424–1427, 1993.

    Article  MATH  Google Scholar 

  12. K. Kurosawa and Y. Desmedt. Optimum traitor tracing and asymmetric schemes. In Advances in Cryptology — EUROCRYPT’98, Lecture Notes in Computer Science, volume 1462, pages 502–517. Springer-Verlag, Berlin, Heidelberg, New York, 1998.

    Google Scholar 

  13. G. Langelaar, I. Setyawan, and R. Lagendijk. Watermarking digital and video data. IEEE Signal Processing Magazine, Sept.:20–46, 2000.

    Google Scholar 

  14. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet physics — doklady, Vol. 10, No. 8:707–710, 1966.

    MathSciNet  Google Scholar 

  15. L. R. Matheson, S. G. Mitchell, T. G. Shamoon, R. E. Tarjan, and F. Zane. Robustness and security of digital watermarks. In Financial Cryptography — FC’98, Lecture Notes in Computer Science, volume 1465, pages 227–240. Springer-Verlag, Berlin, Heidelberg, New York, 1998.

    Chapter  Google Scholar 

  16. B. Pfitzmann and M. Waidner. Asymmetric fingerprinting for large collusions. In Proceedingsof 4 th ACM conference on computer and communications security, pages 151–160, 1997.

    Google Scholar 

  17. R. Safavi-Naini and Y. Wang. Sequential traitor tracing. In Advances in Cryptology — CRYPTO 2000, Lecture Notes in Computer Science, volume 1880, pages 316–332. Springer-Verlag, Berlin, Heidelberg, New York, 2000.

    Chapter  Google Scholar 

  18. R. Safavi-Naini and Y. Wang. New results on frameproof codes and traceability schemes. IEEE Transactions on Information Theory, Vol. 47, No. 7:3029–3033, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  19. L. J. Schulman and D. Zuckerman. Asymptotically good codes correcting insertions, deletions, and transpositions. IEEE transactions on information theory, Vol. 45, No. 7:2552–2557, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. N. Staddon, D. R. Stinson, and R. Wei. Combinatorial properties of frameproof and traceability codes. IEEE transactions on information theory Vol. 47, No. 3:1042–1049, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  21. D. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal on Discrete Mathematics, 11:41–53, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  22. D. R. Stinson and R. Wei. Key preassigned traceability schemes for broadcast encryption. In Proceedings of SAC’98, Lecture Notes in Computer Science, volume 1556, pages 144–156. Springer-Verlag, Berlin, Heidelberg, New York, 1999.

    Google Scholar 

  23. M. Swanson, M. Kobayashi, and A. Tewfik. Multimedia data-embedding and watermarking technologies. Proceedings of IEEE, Vol. 86, No. 6:1064–1087, 1998.

    Article  Google Scholar 

  24. G. Tenengolts. Nonbinary codes, correcting single deletion or insertion. IEEE Transactions on Information Theory, IT-30, No. 5:766–769, 1984.

    Article  MathSciNet  Google Scholar 

  25. M. A. Tsfasman and S. G. Vladut. Algebraic-geometric codes. Kluwer Academic Publishers, 1991.

    Google Scholar 

  26. Y. Wang. Contributions to traceability schemes. Ph.D Thesis, School of Information Technology and Computer Science, University of Wollongong, Australia, 2001.

    Google Scholar 

  27. J. Yin. A combinatorial construction for perfect deletion-correcting codes. Designs, Codes and Cryptography, 23:99–110, 2001.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology and Computer Science, University of Wollongong, Wollongong, 2522, Australia

    Reihaneh Safavi-Naini & Yejing Wang

Authors
  1. Reihaneh Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yejing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. InterTrust STAR Lab. - New Jersey, 821 Alexander Rd., Princeton, NJ, 08540-6303, USA

    Tomas Sander

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Safavi-Naini, R., Wang, Y. (2002). Collusion Secure q-ary Fingerprinting for Perceptual Content. In: Sander, T. (eds) Security and Privacy in Digital Rights Management. DRM 2001. Lecture Notes in Computer Science, vol 2320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47870-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-47870-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43677-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation