Separating partition systems and locally different sequences
SIAM Journal on Discrete Mathematics
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Journal of Combinatorial Theory Series A
Introduction to Coding Theory
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
Antirandomizing the Wrong Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Theoretical Computer Science
Theoretical Computer Science - Algorithmic combinatorial game theory
The Guessing Secrets problem: a probabilistic approach
Journal of Algorithms
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms (TALG)
Separating codes and a new combinatorial search model
Problems of Information Transmission
Quantum guessing via Deutsch-Jozsa
Quantum Information & Computation
Practical scenarios for the van trung-martirosyan codes
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Tracing traitors by guessing secrets. the q-ary case
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Worst-case optimal fingerprinting codes for non-threshold collusion
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
General Theory of Information Transfer and Combinatorics
Threshold and majority group testing
Information Theory, Combinatorics, and Search Theory
Hi-index | 0.00 |
We consider the guessing secrets problem defined by Chung, Graham, and Leighton [CGL01]. This is a variant of the standard 20 questions game where the player has a set of k 1 secrets from a universe of N possible secrets. The player is asked Boolean questions about the secret for each question, the player picks one of the k secrets adversarially, and answers according to this secret.We present an explicit set of O(log N) questions together with an efficient (i.e., poly(log N) time) algorithm to solve the guessing secrets problem for the case of 2 secrets. This answers the main algorithmic question left unanswered by [CGL01]. The main techniques we use are small ε-biased spaces and the notion of list decoding.We also establish bounds on the number of questions needed to solve the k-secrets game for k 2, and discuss how list decoding can be used to get partial information about the secrets.