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.

[1]  Josep Domingo-Ferrer,et al.  Simple collusion-secure fingerprinting schemes for images , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[2]  Noga Alon,et al.  Guessing secrets efficiently via list decoding , 2002, SODA '02.

[3]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[4]  Jean-Paul M. G. Linnartz,et al.  On Codes with the Identifiable Parent Property , 1998, J. Comb. Theory, Ser. A.

[5]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[6]  Frank Thomson Leighton,et al.  Guessing secrets , 2001, SODA '01.

[7]  Dan Boneh,et al.  Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.

[8]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[9]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  E Friedman,et al.  I've got a secret. , 1995, The Healthcare Forum journal.