On worst-case to average-case reductions for NP problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 308-317

  Bogdanov, Andrej ^a   Trevisan, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; POLYNOMIAL APPROXIMATION; PROBABILITY;

AVERAGE CASE HARDNESS; POLYNOMIAL TIME ALGORITHM; WORST CASE HARDNESS;

COMPUTATIONAL COMPLEXITY;

EID: 0344550509     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. W. Aiello and J. Håstad. Statistical zero-knowledge languages can be recognized in two rounds. Journal of Computer and System Sciences, 42:327-345, 1991.
2. M. Ajtai, Generating hard instances of lattice problems. In Proceedings of the 28th ACM Symposium on Theory of Computing, pages 99-108, 1996.
3. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 284-293, 1997.
4. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average-case complexity. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 204-216, 1989.
5. M. Blum. Designing programs to check their work. Technical Report 88-09, ICSI, 1988.
6. M. Blum and S. Kannan. Designing programs that check their work. Journal of the ACM, 41(1):269-291, 1995. Also in STOC'89.
7. M. Blum, M. Luby, and R. Rubinfield. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
8. R. Boppana, J. Håstad, and S. Zachos. Does coNP have short interactive proofs? Inf. Process. Lett., 25:127-132, 1987.
9. G. Brassard. Relativized cryptography. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pages 383-391, 1979.
10. W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 122(6):644-654, 1976.
11. J. Feigenbaum and L. Fortnow. On the random-self-reducibility of complete sets. SIAM Journal on Computing, 22:994-1005, 1993.
12. O. Goldreich and S. Goldwasser. On the possibility of basing cryptography on the assumption that P ≠ NP. Unpublished manuscript, 1998.
13. O. Goldreich, H. Karloff, L. Schulman, and L. Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. In Proceedings of the 17th IEEE Conference on Computational Complexity, pages 175-183, 2002.
14. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In Proceedings of the 18th ACM Symposium on Theory of Computing, pages 59-68, 1986.
15. R. Impaglizzo. A personal view of average-case complexity. In Proceedings of the 10th IEEE Conference on Structure in Complexity Theory, pages 134-147, 1995.
16. R. Impagliazzo and L. Levin. No better ways to generate hard NP instances than picking uniformly at random. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 812-821, 1990.
17. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error correcting codes. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 80-86, 2000.
18. L. Levin. Average case complete problems. SIAM Journal on Computing, 15(1):285-286, 1986.
19. R. Lipton. New directions in testing. In Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, 1989.
20. R. O'Donnell. Hardness amplification within NP. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 751-760, 2002.
21. R. Regev. New lattice based cryptographic constructions. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 407-416, 2003.