If NP languages are hard on the worst-case then it is easy to find their hard instances

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 243-257

  Gutfreund, Dan ^a   Shaltiel, Ronen ^b   Ta Shma, Amnon ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FORMULAS; NP-COMPLETE LANGUAGE; POLYNOMIAL TIME ALGORITHMS; QUASI-POLYNOMIAL TIME;

ALGORITHMS; BOOLEAN FUNCTIONS; CRYPTOGRAPHY; POLYNOMIALS; PROBABILISTIC LOGICS;

FORMAL LANGUAGES;

EID: 27644467414     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2005.11     Document Type: Conference Paper

References (39)

1. L. Adelman. Two theorems on random polynomial time. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, pages 75-83, 1978.
2. D. Aharonov and O. Regev. Lattice problems in NP intersect coNP. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
3. M. Ajtai. Generating hard instances of lattice problems. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 99-108, 1996.
4. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 284-293, 1997.
5. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential simulation unless Exprime has publishable proofs. Computational Complexity, 3:307-318, 1993.
6. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 379-386, 1990.
7. A. Bogdanov and L. Trevisan. On worst-case to average-case reductions for NP problems. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 308-317, 2003.
8. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22:644-654, 1976.
9. J. Feigenbaum and L. Fortnow. Random-self-reducibility of complete sets. SIAM Journal on Computing, 22:994-1005, 1993.
10. O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. Journal of Computer and System Sciences, 60 (3):540-563, 2000.
11. O. Goldreich, S. Goldwasser, and S. Micali. How to construct pseudorandom functions. Journal of the ACM, 33(2):792-807, 1986.
12. Y. Gurevich. Matrix block decomposition is complete for the average case. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 802-811, 1990.
13. Y. Gurevich. Average case completeness. Journal of Computer and System Sciences, 42(3):346-398, 1991.
14. D. Gutfreund, R. Shaltiel, and A. Ta-Shma. Uniform hardness vs. randoness tradeoffs for Arthur-Merlin games. Computational Complexity, 12:85-130, 2003.
15. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28(4):1364-1396, 1999.
16. A. Healy, S. Vadhan, and E. Viola. Using nondeterminism to amplify hardness. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 192-201, 2004.
17. R. Impagliazzo. A personal view of average-case complexity. In Proceedings of the 10th Annual Conference on Structure in Complexity Theory, pages 134-147, 1995.
18. R. Impagliazzo and L. Levin. No better ways of finding hard NP-problems than picking uniformly at random. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 812-821, 1990.
19. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 230-235, 1989.
20. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
21. R. Impagliazzo and A. Wigderson. Randomness vs. time: de-randomization under a uniform assumption. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 734-743, 1998.
22. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. Journal of Computer and System Sciences, 63 (2):236-252, 2001.
23. V. Kabanets. Derandomization: A brief overview. Bulletin of the European Association for Theoretical Computer Science, 76:88-103, 2002.
24. L. Levin. Average case complete problems. SIAM Journal on Computing, 15 (1]):285-286, 1986.
25. C.-J. Lu. Derandomizing Arthur-Merlin games under uniform assumptions. Computational Complexity, pages 247-259, 2001.
26. M. Naor. Bit commitment using pseudorandom generators. J. of Cryptology, 4:151-158, 1991.
27. R. O'Donnell. Hardness amplification within NP. Journal of Computer and System Sciences, 69(1):68-94, 2004.
28. M. O. Rabin. Digitalized signatures and public key functions as intractable as factoring. MIT/LCS/TR-212, 1979.
29. O. Regev. New lattice based cryptographic constructions. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 407-416, 2003.
30. O. Regev and D. Micciancio. Stronger average case to worst case connections. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
31. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21:120-126, 1978.
32. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 387-394, 1990.
33. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR Lemma. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 537-546, 1999.
34. L. Trevisan. List decoding using the XOR lemma. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 126-135, 2003.
35. L. Trevisan. On uniform amplification of hardness in NP. Manuscript, 2004.
36. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, pages 129-138, 2002.
37. R. Venkatesan and L. Levin. Random instances of a graph coloring problem are hard. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 217-222, 1988.
38. E. Viola. Hardness vs. randomness within alternating time. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity, pages 53-62, 2003.
39. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.