Document Open Access Logo

On Nonadaptive Security Reductions of Hitting Set Generators

Authors Shuichi Hirahara, Osamu Watanabe

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2020.15.pdf
  • Filesize: 495 kB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Problems, reductions and completeness
  • Theory of computation → Pseudorandomness and derandomization
Keywords
  • hitting set generator
  • black-box reduction
  • average-case complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

One of the central open questions in the theory of average-case complexity is to establish the equivalence between the worst-case and average-case complexity of the Polynomial-time Hierarchy (PH). One general approach is to show that there exists a PH-computable hitting set generator whose security is based on some NP-hard problem. We present the limits of such an approach, by showing that there exists no exponential-time-computable hitting set generator whose security can be proved by using a nonadaptive randomized polynomial-time reduction from any problem outside AM ∩ coAM, which significantly improves the previous upper bound BPP^NP of Gutfreund and Vadhan (RANDOM/APPROX 2008 [Gutfreund and Vadhan, 2008]). In particular, any security proof of a hitting set generator based on some NP-hard problem must use either an adaptive or non-black-box reduction (unless the polynomial-time hierarchy collapses). To the best of our knowledge, this is the first result that shows limits of black-box reductions from an NP-hard problem to some form of a distributional problem in DistPH.
Based on our results, we argue that the recent worst-case to average-case reduction of Hirahara (FOCS 2018 [Hirahara, 2018]) is inherently non-black-box, without relying on any unproven assumptions. On the other hand, combining the non-black-box reduction with our simulation technique of black-box reductions, we exhibit the existence of a "non-black-box selector" for GapMCSP, i.e., an efficient algorithm that solves GapMCSP given as advice two circuits one of which is guaranteed to compute GapMCSP.

Cite As Get BibTex

Shuichi Hirahara and Osamu Watanabe. On Nonadaptive Security Reductions of Hitting Set Generators. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 15:1-15:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.15

Author Details

Shuichi Hirahara
  • National Institute of Informatics, Tokyo, Japan
Osamu Watanabe
  • Tokyo Institute of Technology, Japan

Funding

Shuichi Hirahara and Osamu Watanabe: JSPS KAKENHI Grant Number 18H04090 JP
  • Hirahara, Shuichi: Supported by ACT-I, JST.

References

  1. Miklós Ajtai. Generating Hard Instances of Lattice Problems (Extended Abstract). In Proceedings of the Symposium on the Theory of Computing (STOC), pages 99-108, 1996. URL: https://doi.org/10.1145/237814.237838.
  2. Adi Akavia, Oded Goldreich, Shafi Goldwasser, and Dana Moshkovitz. On basing one-way functions on NP-hardness. In Proceedings of the Symposium on Theory of Computing (STOC), pages 701-710, 2006. URL: https://doi.org/10.1145/1132516.1132614.
  3. Adi Akavia, Oded Goldreich, Shafi Goldwasser, and Dana Moshkovitz. Erratum for: on basing one-way functions on NP-hardness. In Proceedings of the Symposium on Theory of Computing (STOC), pages 795-796, 2010. URL: https://doi.org/10.1145/1806689.1806797.
  4. Eric Allender. Curiouser and Curiouser: The Link between Incompressibility and Complexity. In Proceedings of the 8th Conference on Computability in Europe (CiE), pages 11-16, 2012. URL: https://doi.org/10.1007/978-3-642-30870-3_2.
  5. Eric Allender and Shuichi Hirahara. New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 54:1-54:14, 2017. URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.54.
  6. Benny Applebaum, Boaz Barak, and David Xiao. On Basing Lower-Bounds for Learning on Worst-Case Assumptions. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 211-220, 2008. URL: https://doi.org/10.1109/FOCS.2008.35.
  7. Andrej Bogdanov and Christina Brzuska. On Basing Size-Verifiable One-Way Functions on NP-Hardness. In Proceedings of the Theory of Cryptography Conference (TCC), pages 1-6, 2015. URL: https://doi.org/10.1007/978-3-662-46494-6_1.
  8. Andrej Bogdanov and Luca Trevisan. Average-Case Complexity. Foundations and Trends in Theoretical Computer Science, 2(1), 2006. URL: https://doi.org/10.1561/0400000004.
  9. Andrej Bogdanov and Luca Trevisan. On Worst-Case to Average-Case Reductions for NP Problems. SIAM J. Comput., 36(4):1119-1159, 2006. URL: https://doi.org/10.1137/S0097539705446974.
  10. Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova. Learning Algorithms from Natural Proofs. In Proceedings of the Conference on Computational Complexity (CCC), pages 10:1-10:24, 2016. URL: https://doi.org/10.4230/LIPIcs.CCC.2016.10.
  11. Joan Feigenbaum and Lance Fortnow. Random-Self-Reducibility of Complete Sets. SIAM J. Comput., 22(5):994-1005, 1993. URL: https://doi.org/10.1137/0222061.
  12. Lance Fortnow. The Complexity of Perfect Zero-Knowledge. Advances in Computing Research, 5:327-343, 1989. Google Scholar
  13. Shafi Goldwasser and Michael Sipser. Private Coins versus Public Coins in Interactive Proof Systems. In Proceedings of the Symposium on Theory of Computing (STOC), pages 59-68, 1986. URL: https://doi.org/10.1145/12130.12137.
  14. Dan Gutfreund and Salil P. Vadhan. Limitations of Hardness vs. Randomness under Uniform Reductions. In Proceedings of the Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pages 469-482, 2008. URL: https://doi.org/10.1007/978-3-540-85363-3_37.
  15. Iftach Haitner, Omer Reingold, and Salil P. Vadhan. Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput., 42(3):1405-1430, 2013. URL: https://doi.org/10.1137/100814421.
  16. Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A Pseudorandom Generator from any One-way Function. SIAM J. Comput., 28(4):1364-1396, 1999. URL: https://doi.org/10.1137/S0097539793244708.
  17. Shuichi Hirahara. Identifying an Honest EXP^NP Oracle Among Many. In Proceedings of the Conference on Computational Complexity (CCC), pages 244-263, 2015. URL: https://doi.org/10.4230/LIPIcs.CCC.2015.244.
  18. Shuichi Hirahara. Non-black-box Worst-case to Average-case Reductions within NP. In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 247-258, 2018. Google Scholar
  19. Shuichi Hirahara. Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions. To appear in CCC'20, 2020. Google Scholar
  20. Shuichi Hirahara. Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions. To appear in STOC'20, 2020. Google Scholar
  21. Shuichi Hirahara. Unexpected Power of Random Strings. In Proceedings of the Innovations in Theoretical Computer Science Conference (ITCS), pages 41:1-41:13, 2020. URL: https://doi.org/10.4230/LIPIcs.ITCS.2020.41.
  22. Shuichi Hirahara and Rahul Santhanam. On the Average-Case Complexity of MCSP and Its Variants. In Proceedings of the Computational Complexity Conference (CCC), pages 7:1-7:20, 2017. URL: https://doi.org/10.4230/LIPIcs.CCC.2017.7.
  23. Shuichi Hirahara and Osamu Watanabe. Limits of Minimum Circuit Size Problem as Oracle. In Proceedings of the Conference on Computational Complexity (CCC), pages 18:1-18:20, 2016. URL: https://doi.org/10.4230/LIPIcs.CCC.2016.18.
  24. Thomas Holenstein. Key agreement from weak bit agreement. In Proceedings of the Symposium on Theory of Computing (STOC), pages 664-673, 2005. URL: https://doi.org/10.1145/1060590.1060689.
  25. Thomas Holenstein. Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness. In Proceedings of the Theory of Cryptography Conference (TCC), pages 443-461, 2006. URL: https://doi.org/10.1007/11681878_23.
  26. Russell Impagliazzo. Relativized Separations of Worst-Case and Average-Case Complexities for NP. In Proceedings of the Conference on Computational Complexity (CCC), pages 104-114, 2011. URL: https://doi.org/10.1109/CCC.2011.34.
  27. Russell Impagliazzo and Avi Wigderson. Randomness vs Time: Derandomization under a Uniform Assumption. J. Comput. Syst. Sci., 63(4):672-688, 2001. URL: https://doi.org/10.1006/jcss.2001.1780.
  28. Valentine Kabanets and Jin-yi Cai. Circuit minimization problem. In Proceedings of the Symposium on Theory of Computing (STOC), pages 73-79, 2000. URL: https://doi.org/10.1145/335305.335314.
  29. Leonid A. Levin. Average Case Complete Problems. SIAM J. Comput., 15(1):285-286, 1986. URL: https://doi.org/10.1137/0215020.
  30. Noam Nisan and Avi Wigderson. Hardness vs Randomness. J. Comput. Syst. Sci., 49(2):149-167, 1994. URL: https://doi.org/10.1016/S0022-0000(05)80043-1.
  31. Rafail Ostrovsky. One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. In Proceedings of the Structure in Complexity Theory Conference, pages 133-138, 1991. URL: https://doi.org/10.1109/SCT.1991.160253.
  32. Aduri Pavan, Rahul Santhanam, and N. V. Vinodchandran. Some Results on Average-Case Hardness Within the Polynomial Hierarchy. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 188-199, 2006. URL: https://doi.org/10.1007/11944836_19.
  33. Steven Rudich. Super-bits, Demi-bits, and NP/qpoly-natural Proofs. In Proceedings of the Randomization and Approximation Techniques in Computer Science (RANDOM/APPROX), pages 85-93, 1997. URL: https://doi.org/10.1007/3-540-63248-4_8.
  34. Rahul Santhanam. Circuit Lower Bounds for Merlin-Arthur Classes. SIAM J. Comput., 39(3):1038-1061, 2009. URL: https://doi.org/10.1137/070702680.
  35. Madhu Sudan, Luca Trevisan, and Salil P. Vadhan. Pseudorandom Generators without the XOR Lemma. J. Comput. Syst. Sci., 62(2):236-266, 2001. URL: https://doi.org/10.1006/jcss.2000.1730.
  36. Luca Trevisan and Salil P. Vadhan. Pseudorandomness and Average-Case Complexity Via Uniform Reductions. Computational Complexity, 16(4):331-364, 2007. URL: https://doi.org/10.1007/s00037-007-0233-x.
  37. Emanuele Viola. The complexity of constructing pseudorandom generators from hard functions. Computational Complexity, 13(3-4):147-188, 2005. URL: https://doi.org/10.1007/s00037-004-0187-1.
  38. Andrew Chi-Chih Yao. Theory and Applications of Trapdoor Functions (Extended Abstract). In Proceedings of the Symposium on Foundations of Computer Science (FOCS), pages 80-91, 1982. URL: https://doi.org/10.1109/SFCS.1982.45.
  39. Chee-Keng Yap. Some Consequences of Non-Uniform Conditions on Uniform Classes. Theor. Comput. Sci., 26:287-300, 1983. URL: https://doi.org/10.1016/0304-3975(83)90020-8.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact