Protecting Intellectual Property by Guessing Secrets
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.
KeywordsTest Pattern Decode Algorithm Protect Intellectual Property Collusion Attack Outter Code
Unable to display preview. Download preview PDF.
- 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
- 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
- 9.I’ve got a secret. A classic TV gameshow, http://www.timvp.com/ivegotse.html