loading...
Efficient Recovery of Secrets
Las Vegas, Nevada April 05-April 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2004.1286749International Conference on Informati ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Marcel Fernandez, Universitat Polit?cnica de Catalunya, Spain
Miguel Soriano, Universitat Polit?cnica de Catalunya, Spain
In the guessing secrets game defined by Chung, Graham and Leighton [The Electronic Journal of Combinatorics], 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. In this paper 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.
Citation:
Marcel Fernandez, Miguel Soriano, "Efficient Recovery of Secrets," itcc, vol. 2, pp.763, International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.