Skip to main content

Asymptotically False-Positive-Maximizing Attack on Non-binary Tardos Codes

  • Conference paper
Information Hiding (IH 2011)

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

Included in the following conference series:

Abstract

We use a method recently introduced by us to study accusation probabilities for non-binary Tardos fingerprinting codes. We generalize the pre-computation steps in this approach to include a broad class of collusion attack strategies. We analytically derive properties of a special attack that asymptotically maximizes false accusation probabilities. We present numerical results on sufficient code lengths for this attack, and explain the abrupt transitions that occur in these results.

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. Amiri, E., Tardos, G.: High rate fingerprinting codes and the fingerprinting capacity. In: SODA 2009, pp. 336–345 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory 44(5), 1897–1905 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Furon, T., Guyader, A., Cérou, F.: On the design and optimization of tardos probabilistic fingerprinting codes. In: Solanki, K., Sullivan, K., Madhow, U. (eds.) IH 2008. LNCS, vol. 5284, pp. 341–356. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. He, S., Wu, M.: Joint coding and embedding techniques for multimedia fingerprinting. TIFS 1, 231–248 (2006)

    Google Scholar 

  6. Huang, Y.W., Moulin, P.: Saddle-point solution of the fingerprinting capacity game under the marking assumption. In: ISIT 2009 (2009)

    Google Scholar 

  7. Moulin, P.: Universal fingerprinting: Capacity and random-coding exponents. Preprint arXiv:0801.3837v2 (2008)

    Google Scholar 

  8. Nuida, K., Hagiwara, M., Watanabe, H., Imai, H.: Optimal probabilistic fingerprinting codes using optimal finite random variables related to numerical quadrature. CoRR, abs/cs/0610036 (2006)

    Google Scholar 

  9. Schaathun, H.G.: On error-correcting fingerprinting codes for use with watermarking. Multimedia Systems 13(5-6), 331–344 (2008)

    Article  Google Scholar 

  10. Simone, A., Škorić, B.: Accusation probabilities in Tardos codes. In: Benelux Workshop on Information and System Security, WISSEC 2010 (2010), http://eprint.iacr.org/2010/472

  11. Somekh-Baruch, A., Merhav, N.: On the capacity game of private fingerprinting systems under collusion attacks. IEEE Trans. Inform. Theory 51, 884–899 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Tardos, G.: Optimal probabilistic fingerprint codes. In: STOC 2003, pp. 116–125 (2003)

    Google Scholar 

  13. Š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 

  14. Škorić, B., Katzenbeisser, S., Schaathun, H.G., Celik, M.U.: Tardos fingerprinting codes in the combined digit model. In: IEEE Workshop on Information Forensics and Security (WIFS) 2009, pp. 41–45 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Xie, F., Furon, T., Fontaine, C.: On-off keying modulation and Tardos fingerprinting. In: MM&Sec 2008, pp. 101–106 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simone, A., Škorić, B. (2011). Asymptotically False-Positive-Maximizing Attack on Non-binary Tardos Codes. In: Filler, T., Pevný, T., Craver, S., Ker, A. (eds) Information Hiding. IH 2011. Lecture Notes in Computer Science, vol 6958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24178-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24178-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24177-2

  • Online ISBN: 978-3-642-24178-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics