Skip to main content

Regular Simplex Fingerprints and Their Optimality Properties

  • Conference paper
Digital Watermarking (IWDW 2005)

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

Included in the following conference series:

Abstract

This paper addresses the design of additive fingerprints that are maximally resilient against Gaussian averaging collusion attacks. The detector performs a binary hypothesis test in order to decide whether a user of interest is among the colluders. The encoder (fingerprint designer) is to imbed additive fingerprints that minimize the probability of error of the test. Both the encoder and the attackers are subject to squared-error distortion constraints. We show that n-simplex fingerprints are optimal in sense of maximizing a geometric figure of merit for the detection test; these fingerprints outperform orthogonal fingerprints. They are also optimal in terms of maximizing the error exponent of the detection test, and maximizing the deflection criteria at the detector when the attacker’s noise is non-Gaussian. Reliable detection is guaranteed provided that the number of colluders \(K \ll \sqrt{N}\), where N is the length of the host vector.

This work was supported by NSF grant CCR03-25924.

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. Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452–465. Springer, Heidelberg (1995)

    Google Scholar 

  2. Kilian, J., Leighton, F.T., Matheson, L.R., Shamoon, T.G., Tarjan, R.E., Zane, F.: Resistance of digital watermarks to collusive attacks. In: IEEE International Symposium on Information Theory, p. 271 (1998)

    Google Scholar 

  3. Ergun, F., Kilian, J., Kumar, R.: A note on the bounds of collusion resistant watermarks. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 140–149. Springer, Heidelberg (1999)

    Google Scholar 

  4. Moulin, P., Briassouli, A.: The Gaussian fingerprinting game. In: Conference on Information Sciences and Systems, CISS 2002 (March 2002)

    Google Scholar 

  5. Wang, Z., Wu, M., Zhao, H., Trappe, W., Liu, K.J.R.: Collusion resistance of multimedia fingerprinting using orthogonal modulation. IEEE Trans. on Image Proc. 14(6), 804–821 (2005)

    Article  Google Scholar 

  6. Poor, H.V.: An Introduction to Signal Detection and Estimation, 2nd edn. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  7. Blahut, R.: An Introduction to Telecommunications. Cambridge University Press, Cambridge (Preprint)

    Google Scholar 

  8. Forney Jr., G.D., Wei, L.-F.: Multidimensional constellations. I. introduction, figures of merit, and generalized cross constellations. IEEE Journal on Selected Areas in Communications 7(6), 877–892 (1989)

    Article  Google Scholar 

  9. Munkres, J.R.: Elements of Algebraic Topology. Perseus Press (1993)

    Google Scholar 

  10. Barton, R.J., Poor, H.V.: On generalized signal-to-noise ratios in signal detection. Mathematics of Control, Signals and Systems 5(1), 81–91 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiyavash, N., Moulin, P. (2005). Regular Simplex Fingerprints and Their Optimality Properties. In: Barni, M., Cox, I., Kalker, T., Kim, HJ. (eds) Digital Watermarking. IWDW 2005. Lecture Notes in Computer Science, vol 3710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551492_8

Download citation

  • DOI: https://doi.org/10.1007/11551492_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28768-1

  • Online ISBN: 978-3-540-32052-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics