loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2
Efficient Recovery of Secrets
Las Vegas, Nevada
April 05-April 07
ISBN: 0-7695-2108-8
ASCII Text
x 
 
Marcel Fernandez, Miguel Soriano, "Efficient Recovery of Secrets," Information Technology: Coding and Computing, International Conference on, vol. 2, pp. 763, International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2, 2004.
 
 
BibTex
x
 
@article{ 10.1109/ITCC.2004.1286749,
author = {Marcel Fernandez and Miguel Soriano},
title = {Efficient Recovery of Secrets},
journal ={Information Technology: Coding and Computing, International Conference on},
volume = {2},
year = {2004},
isbn = {0-7695-2108-8},
pages = {763},
doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2004.1286749},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Technology: Coding and Computing, International Conference on
TI - Efficient Recovery of Secrets
SN - 0-7695-2108-8
SP
EP
A1 - Marcel Fernandez,
A1 - Miguel Soriano,
PY - 2004
KW - null
VL - 2
JA - Information Technology: Coding and Computing, International Conference on
ER -
 
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.