Skip to main content

Best Security Index for Digital Fingerprinting

  • Conference paper
Information Hiding (IH 2005)

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

Included in the following conference series:

Abstract

Digital watermarking used for fingerprinting may receive a collusion attack; two or more users collude, compare their data, find a part of embedded watermarks, and make an unauthorized copy by masking their identities. In this paper, assuming that at most c users collude, we give a characterization of the fingerprinting codes that have the best security index in a sense of “(c,p/q)-secureness” proposed by Orihara et al. The characterization is expressed in terms of intersecting families of sets. Using a block design, we also show that a distributor of data can only find asymptotically a set of c users including at least one culprit, no matter how good fingerprinting code is used.

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. Beth, T., Jungnickel, D., Lenz, H.: Design Theory, 2nd edn. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  2. Blakley, G.R., Meadows, C., Purdy, G.B.: Fingerprinting long forgiving messages. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 180–189. Springer, Heidelberg (1986)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Cohen, G.D., Schaathun, H.G.: Upper bounds on separating codes. IEEE Trans. on Information Theory 50(6), 1291–1294 (2004)

    Article  MathSciNet  Google Scholar 

  5. Orihara, S., Mizuki, T., Nishizeki, T.: New security index for digital fingerprinting and its bounds. IEICE Trans. Fundamentals E86-A(5), 1156–1163 (2003)

    Google Scholar 

  6. Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference 86(2), 595–617 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Yoshioka, K., Shikata, J., Matsumoto, T.: Collusion secure codes: Systematic security definitions and their relations. IEICE Trans. Fundamentals E87-A(5), 1162–1171 (2004)

    Google Scholar 

  8. Yoshioka, K., Shikata, J., Matsumoto, T.: On collusion security of random codes. IEICE Trans. Fundamentals E88-A(1), 296–304 (2005)

    Article  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

Banno, K., Orihara, S., Mizuki, T., Nishizeki, T. (2005). Best Security Index for Digital Fingerprinting. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds) Information Hiding. IH 2005. Lecture Notes in Computer Science, vol 3727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558859_29

Download citation

  • DOI: https://doi.org/10.1007/11558859_29

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31481-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics