Average-case fine-grained hardness

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.

[1]  Russell Impagliazzo,et al.  A personal view of average-case complexity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[2]  Ryan Williams,et al.  Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made , 2015, STOC.

[3]  Christos Tzamos,et al.  Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms , 2016, ICML.

[4]  Jin-Yi Cai,et al.  On the Hardness of Permanent , 1999, STACS.

[5]  Vinod Vaikuntanathan,et al.  Fine-Grained Cryptography , 2016, CRYPTO.

[6]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[7]  Johan Håstad.  One-Way Permutations in NC0 , 1987, Inf. Process. Lett..

[8]  Ellis Horowitz,et al.  A Fast Method for Interpolation Using Preconditioning , 1972, Information Processing Letters.

[9]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

[10]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[11]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[12]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[13]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[14]  Moni Naor,et al.  On Cryptographic Assumptions and Challenges , 2003, CRYPTO.

[15]  Russell Impagliazzo,et al.  One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..

[17]  Ueli Maurer.  Conditionally-perfect secrecy and a provably-secure randomized cipher , 2004, Journal of Cryptology.

[18]  Madhu Sudan,et al.  Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

[19]  Marvin Künnemann,et al.  Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[20]  Oren Weimann,et al.  Consequences of Faster Alignment of Sequences , 2014, ICALP.

[21]  Moni Naor,et al.  Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.

[22]  Huacheng Yu,et al.  Matching Triangles and Basing Hardness on an Extremely Popular Conjecture , 2018, SIAM J. Comput..

[23]  Amir Abboud,et al.  Quadratic-Time Hardness of LCS and other Sequence Similarity Measures , 2015, ArXiv.

[24]  Dániel Marx,et al.  Exponential Time Complexity of the Permanent and the Tutte Polynomial , 2010, TALG.

[25]  Luca Trevisan,et al.  Average-Case Complexity , 2006, Found. Trends Theor. Comput. Sci..

[26]  Timothy M. Chan,et al.  Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky , 2016, SODA.

[27]  Virginia Vassilevska Williams,et al.  Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) , 2015, IPEC.

[28]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[29]  Silvio Micali,et al.  How to Construct Random Functions (Extended Abstract) , 1984, FOCS.

[30]  Russell Impagliazzo,et al.  Orthogonal Vectors is hard for first-order properties on sparse graphs , 2016, Electron. Colloquium Comput. Complex..

[31]  Allan Grønlund Jørgensen,et al.  A Dichotomy for Regular Expression Membership Testing , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[32]  Guy N. Rothblum,et al.  Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets , 2017, ITCS.

[33]  Johan Håstad,et al.  On Average Time Hierarchies , 1994, Inf. Process. Lett..

[34]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[35]  Amir Abboud,et al.  Exact Weight Subgraphs and the k-Sum Conjecture , 2013, ICALP.

[36]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[37]  Christos Tzamos,et al.  Tight Hardness Results for Maximum Weight Rectangles , 2016, ICALP.

[38]  S. Micali,et al.  How To Construct Randolli Functions , 1984, FOCS 1984.

[39]  Richard Ryan Williams,et al.  Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation , 2016, CCC.

[40]  Mihai Patrascu,et al.  Towards polynomial lower bounds for dynamic problems , 2010, STOC '10.

[41]  Russell Impagliazzo,et al.  Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility , 2016, Electron. Colloquium Comput. Complex..

[42]  Rafail Ostrovsky,et al.  Cryptography with constant computational overhead , 2008, STOC.

[43]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[44]  Andreas Björklund,et al.  How Proofs are Prepared at Camelot: Extended Abstract , 2016, PODC.

[45]  Andreas Björklund,et al.  How proofs are prepared at Camelot , 2016, ArXiv.

[46]  Joan Feigenbaum,et al.  On the random-self-reducibility of complete sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[47]  Piotr Indyk,et al.  Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.

[48]  Prashant Nalini Vasudevan,et al.  Proofs of Useful Work , 2017, IACR Cryptol. ePrint Arch..

[49]  Amir Abboud,et al.  If the Current Clique Algorithms are Optimal, So is Valiant's Parser , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[50]  Charles M. Fiduccia,et al.  Polynomial evaluation via the division algorithm the fast Fourier transform revisited , 1972, STOC.

[51]  Russell Impagliazzo,et al.  The complexity of unique k-SAT: an isolation lemma for k-CNFs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[52]  Neeshad Shafi.  Growing together in a changing climate , 2016 .

[53]  Ralph C. Merkle,et al.  Secure communications over insecure channels , 1978, CACM.

[54]  Shafi Goldwasser,et al.  On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances , 2016, Electron. Colloquium Comput. Complex..