Yanyi Liu
Abstract
Let Kt(x) denote the Levin-Kolmogorov Complexity of the string x, and let MKtP denote the language of pairs (x, k) having the property that Kt(x) ≤ k. We demonstrate that:
• MKtP ∉ HeurnegBPP (i.e., MKtP is two-sided error mildly average-case hard) iff infinitely-often OWFs exist.
• MKtP ∉ AvgnegBPP (i.e., MKtP is errorless mildly average-case hard) iff EXP ≠ BPP.
Taken together, these results show that the only "gap" toward getting (infinitely-often) OWFs from the assumption that EXP ≠ BPP is the seemingly "minor" technical gap between two-sided error and errorless average-case hardness of the MKtP problem.
- Allender, E., Buhrman, H., Koucký, M., Van Melkebeek, D., Ronneburger, D. Power from random strings. SIAM J. Comput 35, 6 (2006), 1467--1493.Google Scholar
Digital Library
- Blum, M., Micali, S. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput 13, 4 (1984), 850--864.Google ScholarDigital Library
- Bogdanov, A., Trevisan, L. Average-case complexity. Manuscript, 2008. http://arxiv.org/abs/cs.CC/0606037.Google Scholar
- Buhrman, H., Fortnow, L., Pavan, A. Some results on derandomization. In Annual Symposium on Theoretical Aspects of Computer Science. Springer, 2003, 212--222.Google ScholarCross Ref
- Chaitin, G.J. On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM 16, 3 (1969), 407--422.Google ScholarDigital Library
- Diffie, W., Hellman, M. New directions in cryptography. IEEE Trans. Inf. Theory 22, 6 (1976), 644--654.Google ScholarDigital Library
- Goldreich, O., Goldwasser, S., Micali, S. On the cryptographic applications of random functions. In CRYPTO. 1984, 276--288.Google Scholar
- Goldwasser, S., Micali, S. Probabilistic encryption. J. Comput. Syst. Sci 28, 2 (1984), 270--299.Google ScholarCross Ref
- Hartmanis, J. Generalized kolmogorov complexity and the structure of feasible computations. In 24th Annual Symposium on Foundations of Computer Science (sfcs 1983). Nov 1983, 439--445.Google ScholarDigital Library
- Hartmanis, J., Stearns, R.E. On the computational complexity of algorithms. Trans. Amer. Math. Soc 117, 1965, 285--306.Google ScholarCross Ref
- Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M. A pseudorandom generator from any one-way function. SIAM J. Comput. 28, 4 (1999), 364--1396.Google ScholarDigital Library
- Impagliazzo, R., Luby, M. 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. 1989, 230--235.Google ScholarDigital Library
- Impagliazzo, R., Wigderson, A. P = BPP if e requires exponential circuits: Derandomizing the xor lemma. In STOC '97. 1997, 220--229.Google ScholarDigital Library
- Impagliazzo, R., Wigderson, A. Randomness vs. time: de-randomization under a uniform assumption. In Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280). IEEE, 1998, 734--743.Google Scholar
- Ko, K. On the notion of infinite pseudorandom sequences. Theor. Comput. Sci 48, 3 (1986), 9--33.Google ScholarCross Ref
- Kolmogorov, A.N. Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2 1--4 (1968), 157--168.Google ScholarCross Ref
- Lautemann, C. BPP and the polynomial hierarchy. Inf. Process. Lett 17, 4 (1983), 215--217.Google ScholarCross Ref
- Levin, L.A. Universal search problems (russian), translated into English by BA Trakhtenbrot in [27]. Prob. Inf. Transm 9, 3 (1973), 265--266.Google Scholar
- Levin, L.A. The tale of one-way functions. Prob. Inf. Transm 39, 1 (2003), 92--103.Google ScholarCross Ref
- Liu, Y., Pass, R. On one-way functions and Kolmogorov complexity. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16--19, 2020. IEEE, 2020, 1243--1254.Google ScholarCross Ref
- Nisan, N., Wigderson, A. Hardness vs randomness. J. Comput. Syst. Sci 49, 2 (1994), 149--167.Google ScholarDigital Library
- Ostrovsky, R., Wigderson, A. One-way fuctions are essential for non-trivial zero-knowledge. In ISTCS, 1993, 3--17.Google Scholar
- Ren, H., Santhanam, R. Hardness of KT characterizes parallel cryptography. Electron. Colloquium Comput. Complex 28, 57 (2021).Google Scholar
- Sipser, M. A complexity theoretic approach to randomness. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25--27 April, 1983, Boston, Massachusetts, USA. ACM, 1983, 330--335.Google ScholarDigital Library
- Sipser, M. Introduction to the theory of computation. ACM Sigact News 27, 1 (1996), 27--29.Google ScholarDigital Library
- Solomonoff, R. A formal theory of inductive inference. Part i. Inf. Control 7, 1 (1964), 1--22.Google ScholarCross Ref
- Trakhtenbrot, B.A. A survey of Russian approaches to perebor (brute-force searches) algorithms. Ann. Hist. Comput. 6, 4 (1984), 384--400.Google ScholarDigital Library
- Trevisan, L., Vadhan, S. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings 17th IEEE Annual Conference on Computational Complexity. IEEE Computer Society, 2002, 0129--0129.Google Scholar
- Yao, A.C. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3--5 November 1982. 1982, 80--91.Google ScholarDigital Library
Index Terms
- Toward Basing Cryptography on the Hardness of EXP
Recommendations
On the Possibility of Basing Cryptography on
Advances in Cryptology – CRYPTO 2021AbstractLiu and Pass (FOCS’20) recently demonstrated an equivalence between the existence of one-way functions (OWFs) and mild average-case hardness of the time-bounded Kolmogorov complexity problem. In this work, we establish a similar equivalence but ...
On basing one-way functions on NP-hardness
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingWe consider the possibility of basing one-way functions on NP-Hardness; that is, we study possible reductions from a worst-case decision problem to the task of average-case inverting a polynomial-time computable function f. Our main findings are the ...
On Basing Search SIVP on NP-Hardness
Theory of CryptographyAbstractThe possibility of basing cryptography on the minimal assumption is at the very heart of complexity-theoretic cryptography. The closest we have gotten so far is lattice-based cryptography whose average-case security is based on the worst-...
Comments