Marshall Ball
ABSTRACT
We present functions that can be computed in some fixed polynomial time but are hard on average for any algorithm that runs in slightly smaller time, assuming widely-conjectured worst-case hardness for problems from the study of fine-grained complexity. Unconditional constructions of such functions are known from before (Goldmann et al., IPL '94), but these have been canonical functions that have not found further use, while our functions are closely related to well-studied problems and have considerable algebraic structure.
Based on the average-case hardness and structural properties of our functions, we outline the construction of a Proof of Work scheme and discuss possible approaches to constructing fine-grained One-Way Functions. We also show how our reductions make conjectures regarding the worst-case hardness of the problems we reduce from (and consequently the Strong Exponential Time Hypothesis) heuristically falsifiable in a sense similar to that of (Naor, CRYPTO '03).
We prove our hardness results in each case by showing fine-grained reductions from solving one of three problems - namely, Orthogonal Vectors (OV), 3SUM, and All-Pairs Shortest Paths (APSP) - in the worst case to computing our function correctly on a uniformly random input. The conjectured hardness of OV and 3SUM then gives us functions that require n2-o(1) time to compute on average, and that of APSP gives us a function that requires n3-o(1) time. Using the same techniques we also obtain a conditional average-case time hierarchy of functions.
Supplemental Material
- Amir Abboud. 2017. Personal communication. (2017).Google Scholar
- Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. 2015. If the current clique algorithms are optimal, so is Valiant’s parser. In Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on. IEEE, 98–117. Google ScholarDigital Library
- Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. 2015.Google Scholar
- Quadratic-Time Hardness of LCS and other Sequence Similarity Measures. CoRR abs/1501.07053 (2015). http://arxiv.org/abs/1501.07053Google Scholar
- Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, and Ryan Williams. 2015.Google Scholar
- Simulating branching programs with edit distance and friends or: A polylog shaved is a lower bound made. arXiv preprint arXiv:1511.06022 (2015).Google Scholar
- Amir Abboud and Kevin Lewi. 2013. Exact weight subgraphs and the k-sum conjecture. In International Colloquium on Automata, Languages, and Programming. Springer Berlin Heidelberg, 1–12. Google ScholarDigital Library
- Amir Abboud, Virginia Vassilevska Williams, and Oren Weimann. 2014. Consequences of faster alignment of sequences. In International Colloquium on Automata, Languages, and Programming. Springer, 39–51. STOC’17, June 2017, Montreal, Canada Ball et al.Google Scholar
- Amir Abboud, Virginia Vassilevska Williams, and Huacheng Yu. 2015. Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. Manuscript: https://dl.dropboxusercontent.com/u/14999836/publications/MatchTria. pdf. (2015).Google Scholar
- László Babai. 1985.Google Scholar
- Trading Group Theory for Randomness. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, Robert Sedgewick (Ed.). ACM, 421–429. DOI: https:// Google ScholarDigital Library
- Arturs Backurs, Nishanth Dikkala, and Christos Tzamos. 2016. Tight Hardness Results for Maximum Weight Rectangles. arXiv preprint arXiv:1602.05837 (2016).Google Scholar
- Arturs Backurs and Piotr Indyk. 2014. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). CoRR abs/1412.0348 (2014). http://arxiv.org/abs/1412.0348 Google ScholarDigital Library
- Arturs Backurs and Christos Tzamos. 2016. Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. arXiv preprint arXiv:1607.04229 (2016).Google Scholar
- Marshall Ball, Alon Rosen, Manuel Sabin, and Prashant Nalini Vasudevan. 2017.Google Scholar
- Proofs of Useful Work. In submission. (2017).Google Scholar
- Armin Biere, Marijn Heule, and Hans van Maaren. 2009.Google Scholar
- Handbook of satisfiability. Vol. 185. ios press. http://gauss.ececs.uc.edu/Courses/c626/notes/history.pdfGoogle Scholar
- Andreas Björklund and Petteri Kaski. 2016. How proofs are prepared at Camelot. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. ACM, 391–400. Google ScholarDigital Library
- Andrej Bogdanov and Luca Trevisan. 2006.Google Scholar
- Average-Case Complexity. Foundations and Trends in Theoretical Computer Science 2, 1 (2006). DOI:https: //Google Scholar
- Karl Bringmann, Allan Grønlund, and Kasper Green Larsen. 2016. A Dichotomy for Regular Expression Membership Testing. arXiv preprint arXiv:1611.00918 (2016).Google Scholar
- Karl Bringmann and Marvin Künnemann. 2015.Google Scholar
- Quadratic conditional lower bounds for string problems and dynamic time warping. In Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on. IEEE, 79–97. Google ScholarDigital Library
- Jin-yi Cai, Aduri Pavan, and D. Sivakumar. 1999. On the Hardness of Permanent. In STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings (Lecture Notes in Computer Science), Christoph Meinel and Sophie Tison (Eds.), Vol. 1563. Springer, 90–99. DOI: https:// Google ScholarDigital Library
- Chris Calabro, Russell Impagliazzo, Valentine Kabanets, and Ramamohan Paturi. 2003. The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. 135. DOI:https://Google ScholarCross Ref
- Marco L. Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, and Stefan Schneider. 2016.Google Scholar
- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016. 261–270. DOI:https: // Google ScholarDigital Library
- Timothy M Chan and Ryan Williams. 2016.Google Scholar
- Deterministic apsp, orthogonal vectors, and more: Quickly derandomizing razborov-smolensky. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 1246–1255. Google ScholarDigital Library
- M. Cygan, F.V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. 2015.Google Scholar
- Parameterized Algorithms. Springer International Publishing. 469–470 pages. https://books.google.co.il/books?id=Frg0CgAAQBAJGoogle Scholar
- Akshay Degwekar, Vinod Vaikuntanathan, and Prashant Nalini Vasudevan. 2016. Fine-Grained Cryptography. In Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part III. 533–562. DOI:https:// Google ScholarDigital Library
- Holger Dell, Thore Husfeldt, and Martin Wahlén. 2010. Exponential time complexity of the permanent and the Tutte polynomial. In International Colloquium on Automata, Languages, and Programming. Springer, 426–437. Google ScholarDigital Library
- Cynthia Dwork and Moni Naor. 1992. Pricing via Processing or Combatting Junk Mail. In Advances in Cryptology - CRYPTO ’92, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings. 139–147. DOI:https:// Google ScholarDigital Library
- J Feigenbaum and L Fortnow. 1990. On the Random-Self-Reducibility of Complete Sets. University of Chicago Technical Report (1990), 90–22. Google ScholarDigital Library
- Charles M. Fiduccia. 1972. Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited. In Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA, Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, and Arnold L. Rosenberg (Eds.). ACM, 88–93. DOI:https:// Google ScholarDigital Library
- Anka Gajentaan and Mark H Overmars. 1995. On a class of O (n 2 ) problems in computational geometry. Computational geometry 5, 3 (1995), 165–185. Google ScholarDigital Library
- Jiawei Gao and Russell Impagliazzo. 2016. Orthogonal Vectors is hard for firstorder properties on sparse graphs. Electronic Colloquium on Computational Complexity (ECCC) 23 (2016), 53. http://eccc.hpi-web.de/report/2016/053Google Scholar
- Peter Gemmell and Madhu Sudan. 1992. Highly resilient correctors for polynomials. Information processing letters 43, 4 (1992), 169–174. Google ScholarDigital Library
- Mikael Goldmann, Per Grape, and Johan Håstad. 1994.Google Scholar
- On Average Time Hierarchies. Inf. Process. Lett. 49, 1 (1994), 15–20. DOI:https:// Google ScholarDigital Library
- Oded Goldreich, Shafi Goldwasser, and Silvio Micali. 1984. How to Construct Random Functions (Extended Abstract). In 25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24-26 October 1984. Google ScholarDigital Library
- 464–479. DOI:https://Google Scholar
- Oded Goldreich and Guy Rothblum. February 2017. Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets. Electronic Colloquium on Computational Complexity Report TR17-018. (February 2017).Google Scholar
- Shafi Goldwasser and Dhiraj Holden. 2016.Google Scholar
- On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances. In Innovations in Theoretical Computer Science (ITCS).Google Scholar
- Shafi Goldwasser and Michael Sipser. 1986. Private coins versus public coins in interactive proof systems. In Proceedings of the eighteenth annual ACM symposium on Theory of computing. ACM, 59–68. Google ScholarDigital Library
- Johan Håstad. 1987. One-way permutations in N C 0. Inform. Process. Lett. 26, 3 (1987), 153–155. Google ScholarDigital Library
- Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. 1999. A Pseudorandom Generator from any One-way Function. SIAM J. Comput. 28, 4 (1999), 1364–1396. DOI:https:// Google ScholarDigital Library
- Ellis Horowitz. 1972.Google Scholar
- A fast method for interpolation using preconditioning. Inform. Process. Lett. 1, 4 (1972), 157–163.Google Scholar
- R. Impagliazzo. 1995. A Personal View of Average-case Complexity. In Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT’95) (SCT ’95). IEEE Computer Society, Washington, DC, USA, 134–. http://dl.acm.org/citation. cfm?id=829497.829786 Google ScholarDigital Library
- Russell Impagliazzo and Michael Luby. 1989. One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989. 230–235. DOI:https:// Google ScholarDigital Library
- 63483Google Scholar
- Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. 2008. Cryptography with constant computational overhead. In Proceedings of the fortieth annual ACM symposium on Theory of computing. ACM, 433–442. Google ScholarDigital Library
- Jeffrey C Lagarias and Andrew M. Odlyzko. 1987. Computing π (x): An analytic method. Journal of Algorithms 8, 2 (1987), 173–191. Google ScholarDigital Library
- Leonid A. Levin. 1986. Average Case Complete Problems. SIAM J. Comput. 15, 1 (1986), 285–286. DOI:https:// Google ScholarDigital Library
- Richard Lipton. 1991.Google Scholar
- New directions in testing. Distributed Computing and Cryptography 2 (1991), 191–202.Google Scholar
- Ueli M Maurer. 1992. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology 5, 1 (1992), 53–66. Google ScholarDigital Library
- Ralph C. Merkle. 1978. Secure Communications Over Insecure Channels. Commun. ACM 21, 4 (1978), 294–299. DOI:https:// Google ScholarDigital Library
- Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008).Google Scholar
- Moni Naor. 2003.Google Scholar
- On cryptographic assumptions and challenges. In Annual International Cryptology Conference. Springer, 96–109.Google Scholar
- Jaroslav Nešetřil and Svatopluk Poljak. 1985. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae 26, 2 (1985), 415–419.Google Scholar
- Mihai P ˇ atraşcu. 2010. Towards Polynomial Lower Bounds for Dynamic Problems. In Proceedings of the Forty-second ACM Symposium on Theory of Computing (STOC ’10). ACM, New York, NY, USA, 603–610. DOI:https:// Google ScholarDigital Library
- Liam Roditty and Uri Zwick. 2004.Google Scholar
- On dynamic shortest paths problems. In European Symposium on Algorithms. Springer, 580–591.Google Scholar
- Virginia Vassilevska and Ryan Williams. 2009. Finding, minimizing, and counting weighted subgraphs. In In Proceedings of the Fourty-First Annual ACM Symposium on the Theory of Computing. 455–464. Google ScholarDigital Library
- Ryan Williams. 2005.Google Scholar
- A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348, 2-3 (2005), 357–365. DOI:https: // Google ScholarDigital Library
- Ryan Williams. 2016. Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation. In 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan. 2:1–2:17. DOI: https:// Google ScholarDigital Library
- Virginia Vassilevska Williams. 2015. Hardness of easy problems: Basing hardness on popular conjectures such as the strong exponential time hypothesis. In Proc. International Symposium on Parameterized and Exact Computation. 16–28. http: //theory.stanford.edu/~virgi/ipecsurvey.pdfGoogle Scholar
Index Terms
- Average-case fine-grained hardness
Recommendations
On Worst-Case to Average-Case Reductions for NP Problems
We show that if an NP-complete problem has a nonadaptive self-corrector with respect to any samplable distribution, then coNP is contained in NP/poly and the polynomial hierarchy collapses to the third level. Feigenbaum and Fortnow [SIAM J. Comput., 22 (...
Average-case hardness of NP from exponential worst-case hardness assumptions
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingA long-standing and central open question in the theory of average-case complexity is to base average-case hardness of NP on worst-case hardness of NP. A frontier question along this line is to prove that PH is hard on average if UP requires (sub-)...
Relations between Average-Case and Worst-Case Complexity
The consequences of the worst-case assumption NP=P are very well understood. On the other hand, we only know a few consequences of the analogous average-case assumption “NP is easy on average.” In this paper we establish several new results on the worst-...
Comments