Skip to main content

Capacity of Collusion Secure Fingerprinting — A Tradeoff between Rate and Efficiency

(Extended Abstract of Invited Talk)

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6387))

Abstract

The talk presented a short history of collusion resistant fingerprinting concentrating on recent results that represent joint work with Ehsan Amiri.

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

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amiri, E., Tardos, G.: High rate fingerprinting codes and the fingerprinting capacity. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 336–345 (2009)

    Google Scholar 

  2. Anthapadmanabhan, N.P., Barg, A., Dumer, I.: Fingerprinting capacity under the marking assumption. IEEE Transactions on Information Theory 54(6), 2678–2689 (2008); Preliminary version appeared in the Proceedings of the 2007 IEEE International Symposium on Information Theory, ISIT 2007 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blayer, O., Tassa, T.: Improved versions of Tardos’ fingerprinting scheme. Designs, Codes and Cryptography 48, 79–103 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions of Information Theory 44, 480–491 (1988)

    MathSciNet  MATH  Google Scholar 

  5. Huang, Y., Moulin, P.: Saddle-point solution of the fingerprinting capacity game under the marking assumption. In: Proceedings of the IEEE International Symposium on Information Theory, ISIT 2009 (2009)

    Google Scholar 

  6. Moulin, P.: Universal fingerprinting: capacity and random-coding exponents. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT 2008), pp. 220–224 (2008)

    Google Scholar 

  7. Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Imai, H.: An improvement of the discrete Tardos fingerprinting codes. Cryptology ePrint Archive, Report 2008/338

    Google Scholar 

  8. Nuida, K., Hagiwara, M., Watanabe, H., Imai, H.: Optimization of Tardos’s fingerprinting codes in a viewpoint of memory amount. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 279–293. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Škorić, B., Katzenbeisser, S., Celik, M.U.: Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes. Designs, Codes and Cryptography 46(2), 137–166 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Škorić, B., Vladimirova, T.U., Celik, M., Talstra, J.C.: Tardos fingerprinting is better than we thought. IEEE Transactions on Information Theory 54(8), 3663–3676 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Tardos, G.: Optimal probabilistic fingerprint codes. Journal of the ACM (to appear); Preliminary version appeared in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, (STOC 2003), pp. 116–125

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tardos, G. (2010). Capacity of Collusion Secure Fingerprinting — A Tradeoff between Rate and Efficiency. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds) Information Hiding. IH 2010. Lecture Notes in Computer Science, vol 6387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16435-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16435-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16434-7

  • Online ISBN: 978-3-642-16435-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics