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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
Chase, D.: A class of algorithms for decoding block codes with channel measurement information. IEEE Trans. Inform. Theory 18, 170–182 (1972)
Chung, F., Graham, R., Leighton, T.: Guessing secrets. The Electronic Journal of Combinatorics, 8(1), R13 (2001)
Cohen, G., Encheva, S., Schaathun, H.G.: On separating codes. Technical report, ENST, Paris (2001)
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)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inform. Theory 45(6), 1757–1767 (1999)
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)
I’ve got a secret. A classic TV gameshow, http://www.timvp.com/ivegotse.html
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977)
Sagalovich, Y.L.: Separating systems. Probl. Inform. Trans. 30(2), 14–35 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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