Guessing secrets efficiently via list decoding

ACM Transactions on Algorithms

Volumn 3, Issue 4, 2007, Pages

  Alon, Noga ^a   Guruswami, Venkatesan ^b   Kaufman, Tali ^c   Sudan, Madhu ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF WASHINGTON   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

20 questions; Biased spaces; Decoding algorithms; Error correcting codes; K universal sets

Indexed keywords

BIASED SPACES; DECODING ALGORITHMS; ERROR-CORRECTING CODES; K-UNIVERSAL SETS;

ALGORITHMS; ERROR CORRECTION; FORMAL LOGIC; PROBLEM SOLVING;

DECODING;

EID: 36448962041     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1290672.1290679     Document Type: Conference Paper

References (27)

1. ALON, N., BRUCK, J., NAOR, J., NAOR, M., AND ROTH, R. 1992. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory 38, 509-516.
2. ALON, N., FISCHER, E., AND SZEGEDY, M. 2001. Parent-Identifying codes. J. Combinatorial Theory, Series A 95, 349-359.
3. ALON, N., GOLDREICH, O., HÅSTAD, J., AND PERALTA, R. 1992. Simple constructions of almost k-wise independent random variables. Random Struct. Alg. 3, 289-304.
4. ALON, N., GURUSWAMI, V., KAUFMAN, T., AND SUDAN, M. 2002. Guessing secrets efficiently via list decoding. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 254-262.
5. BARG, A., COHEN, G., ENCHEVA, S., KABATIANSKY, G., AND ZÉMOR, G. 2001. A hypergraph approach to the identifying parent property: The case of multiple parents. SIAM J. Discrete Math. 14, 3, 423-432.
6. CHOR, B., FIAT, A., AND NAOR, M. 1994. Tracing traitors. In Proceedings of the Conference of Advances in Cryptology (CRYPTO), Y. Desmedt, ed. Lecture Notes in Computer Science, vol. 839. Springer, Berlin, 257-270.
7. CHUNG, F., GRAHAM, R., AND LEIGHTON, T. 2001. Guessing secrets. Electron. J. Combinatorics 8, 1, R13.
8. CHUNG, F., GRAHAM, R., AND LU, L. 2002. Guessing secrets with inner product questions. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 247-253.
9. COHEN, G. D., ENCHEVA, S. B., AND SCHAATHUN, H. G. 2001. On separating codes. Tech. Rep., Ecole Nationale Supérieure des T élécommunications, Paris.
10. ERDOS, P. AND LOVÁSZ, L. 1975. In Infinite and Finite Sets, Proceedings of the Colloqmium of the Math Society Janos Bolyai, 10, Problems and results on 3-chromatic hypergraphs and some related questions. North-Holland, Amsterdam, 609-627.
11. GÁL, A. 1998. A characterization of span program size and improved lower bounds for monotone span programs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York, 429-437.
12. GURUSWAMI, V. AND SUDAN, M. 1999. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Trans. Inf. Theory 45, 1757-1767.
13. GURUSWAMI, V. AND SUDAN, M. 2000. List decoding algorithms for certain concatenated codes. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC). ACM Press, New York, 181-190.
14. GURUSWAMI, V. AND SUDAN, M. 2001. Extensions to the Johnson bound. manuscript. http ://people.csail.mit.edu/madhu/papers/ johnson.ps.
15. HOLLMANN, H. D. L., VAN LINT, J. H., LINNARTZ, J.-P., AND TOLHUIZEN, L. M. G. M. 1998. On codes with the identifiable parent property. J. Combinatorial Theory, Series A 82, 2, 121-133.
16. I'VE GOT A SECRET. 1952. I've got a secret. http://www.timvp.com/ivegotse.html.
17. KLEITMAN, D. J. AND SPENCER, J. 1973. Families of k-independent sets. Discrete Math. 6, 255-262.
18. KÖRNER, J. AND SIMONYI, G. 1988. Separating partition systems and locally different sequences. SIAM J. Discrete Math. 1, 3, 355-359.
19. MICCIANCIO, D. AND SEGERLIND, N. 2001. Guessing two secrets with small queries. Tech. Rep. CS2001-0687, Computer Science and Engineering Department, University of California at San Diego. November.
20. MICCIANCIO, D. AND SEGERLIND, N. 2004. Using hypergraph homomorphisms to guess three secrets. manuscript.
21. NAOR, J. AND NAOR, M. 1993. Small-Bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22, 4, 838-856.
22. NAOR, M., SCHULMAN, L. J., AND SRINIVASAN, A. 1995. Splitters and near-optimal derandomization. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society, Washington, DC, 182.
23. NIELSEN, R. R. AND HØHOLDT, T. 2000. Decoding Reed-Solomon codes beyond half the minimum distance. In Coding Theory, Cryptography and Related Areas, Buchmann et al., eds. Springer. Berlin, 221-236.
24. RAZBOROV, A. 2005. Guessing more secrets via list decoding. Internet Math. 2, 1, 21-30.
25. ROTH, R. AND RUCKENSTEIN, G. 2000. Efficient decoding of Reed-Solomon codes beyond half the minimum. distance. IEEE Trans. Inf. Theory 46, 1 (Jan.), 246-257.
26. SEGALOVICH, Y. L. 1994. Separating systems. Problems Inf. Transm. 30, 2, 105-123.
27. VAN LINT, J. H. 1999. Introduction to Coding Theory, 3rd ed. Graduate Texts in Mathematics, vol. 86. Springer, Berlin.