Efficient recovery of secrets

In the guessing secrets game defined by Chung, Graham and Leighton [(2001)], player B has to unveil a set of c > 1 secrets that player A has chosen from a pool of N values. 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. Here we present a solution to the c = 2 guessing secrets game consisting in an error correcting code equipped with a tracing algorithm that, using the Viterbi algorithm as its underlying routine, efficiently recovers the secrets.

[1]  Jr. G. Forney,et al.  The viterbi algorithm , 1973 .

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

[3]  Carl-Erik W. Sundberg,et al.  List Viterbi decoding algorithms with applications , 1994, IEEE Trans. Commun..

[4]  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).

[5]  Jack K. Wolf,et al.  Efficient maximum likelihood decoding of linear block codes using a trellis , 1978, IEEE Trans. Inf. Theory.

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