Optimal error correction against computationally bounded noise

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 1-16

  Micali, Silvio ^a   Peikert, Chris ^a   Sudan, Madhu ^a   Wilson, David A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; DECODING; ENCODING (SYMBOLS);

BINARY ALPHABETS; NATURAL RELAXATION; PUBLIC-KEY MODEL; SHANNON LIMIT;

ERROR CORRECTION;

EID: 24144474940     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_1     Document Type: Conference Paper

References (10)

1. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33(4)-.792-807, 1986.
2. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, 1988.
3. P. Gopalan, R. J. Lipton, and Y. Z. Ding. Error correction against computationally bounded adversaries. Manuscript, October 2004.
4. V. Guruswami. List decoding with side information. In 18th IEEE Annual Conference on Computational Complexity, pages 300-312, 2003.
5. V. Guruswami, J. Håstad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. In Proceedings of the 38th Annual Allerton Conference on Communication, Control and Computing, 2000.
6. V. Guruswami and M. Sudan. Improved decoding of reed-solomon and algebraic-geometric codes. In IEEE Symposium on Foundations of Computer Science, pages 28-39, 1998.
7. V. Guruswami and M. Sudan. List decoding algorithms for certain concatenated codes. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 181-190. ACM Press, 2000.
8. M. Langberg. Private codes or succinct random codes that are (almost) perfect. In Proceedings of the forty-fifth annual IEEE Symposium on Foundations of Computer Science, 2004.
9. R. J. Lipton. A new approach to information theory. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, pages 699-708. Springer-Ver lag, 1994.
10. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pages 387-394. ACM Press, 1990.