Advertisement

Protecting Intellectual Property by Guessing Secrets

  • Marcel Fernandez
  • Miguel Soriano
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Test Pattern Decode Algorithm Protect Intellectual Property Collusion Attack Outter Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 3.
    Chase, D.: A class of algorithms for decoding block codes with channel measurement information. IEEE Trans. Inform. Theory 18, 170–182 (1972)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Chung, F., Graham, R., Leighton, T.: Guessing secrets. The Electronic Journal of Combinatorics, 8(1), R13 (2001)Google Scholar
  5. 5.
    Cohen, G., Encheva, S., Schaathun, H.G.: On separating codes. Technical report, ENST, Paris (2001)Google Scholar
  6. 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. 7.
    Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory 45(6), 1757–1767 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 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)zbMATHCrossRefGoogle Scholar
  9. 9.
    I’ve got a secret. A classic TV gameshow, http://www.timvp.com/ivegotse.html
  10. 10.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)zbMATHGoogle Scholar
  11. 11.
    Sagalovich, Y.L.: Separating systems. Probl. Inform. Trans. 30(2), 14–35 (1994)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Marcel Fernandez
    • 1
  • Miguel Soriano
    • 1
  1. 1.Department of Telematics EngineeringUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations