Skip to main content

Protecting Intellectual Property by Guessing Secrets

  • Conference paper

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

Abstract

In the guessing secrets problem defined by Chung, Graham and Leighton 9, player B has to unveil a set of k > 1 secrets that player A has chosen from a pool of N secrets. To discover the secrets, player B is allowed to ask a series of boolean questions. For each question asked, A\ can adversarially choose one of the secrets but once he has made his choice he must answer truthfully. In this paper we first present a solution to the k = 2 guessing secrets problem consisting in an error correcting code equipped with a tracing algorithm that efficiently recovers the secrets. Next, we show how with a slight modification in the tracing algorithm our approach to the guessing secrets problem also provides a solution to the collusion secure fingerprinting problem.

This work has been supported in part by the Spanish Research Council (CICYT) Project TIC2002-00818 (DISQET).

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
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Guruswami, V., Kaufman, T., Sudan, M.: Guessing secrets efficiently via list-decoding. In: Proc. of the 13th Annual ACM-SIAM SODA, pp. 254–262 (2002)

    Google Scholar 

  2. 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 

  3. Chase, D.: A class of algorithms for decoding block codes with channel measurement information. IEEE Trans. Inform. Theory 18, 170–182 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chung, F., Graham, R., Leighton, T.: Guessing secrets. The Electronic Journal of Combinatorics, 8(1), R13 (2001)

    Google Scholar 

  5. Cohen, G., Encheva, S., Schaathun, H.G.: On separating codes. Technical report, ENST, Paris (2001)

    Google Scholar 

  6. Domingo-Ferrer, J., Herrera-Joancomartí, J.: Simple collusion-secure fingerprinting schemes for images. In: Proceedings of the Information Technology: Coding and Computing ITCC 2000, pp. 128–132 (2000)

    Google Scholar 

  7. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory 45(6), 1757–1767 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hollmann, H.D.L., van Lint, J.H., Linnartz, J.P., Tolhuizen, L.M.G.M.: On codes with the Identifiable Parent Property. J. Comb. Theory 82(2), 121–133 (1998)

    Article  MATH  Google Scholar 

  9. I’ve got a secret. A classic TV gameshow, http://www.timvp.com/ivegotse.html

  10. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)

    MATH  Google Scholar 

  11. Sagalovich, Y.L.: Separating systems. Probl. Inform. Trans. 30(2), 14–35 (1994)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernandez, M., Soriano, M. (2003). Protecting Intellectual Property by Guessing Secrets. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds) E-Commerce and Web Technologies. EC-Web 2003. Lecture Notes in Computer Science, vol 2738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45229-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45229-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40808-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics