On One-way Functions and Kolmogorov Complexity

09/24/2020
by   Yanyi Liu, et al.
0

We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial t(n)≥ (1+ε)n, ε>0, the following are equivalent: - One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more); - t-time bounded Kolmogorov Complexity, K^t, is mildly hard-on-average (i.e., there exists a polynomial p(n)>0 such that no PPT algorithm can compute K^t, for more than a 1-1/p(n) fraction of n-bit strings). In doing so, we present the first natural, and well-studied, computational problem characterizing the feasibility of the central private-key primitives and protocols in Cryptography.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/14/2018

Block encryption of quantum messages

In modern cryptography, block encryption is a fundamental cryptographic ...
12/13/2021

Quantum commitments and signatures without one-way functions

All known constructions of classical or quantum commitments require at l...
12/18/2021

Cryptography from Pseudorandom Quantum States

Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are eff...
10/21/2018

PQC: Triple Decomposition Problem Applied To GL(d, Fp) - A Secure Framework For Canonical Non-Commutative Cryptography

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols...
12/02/2020

Average-case algorithms for testing isomorphism of polynomials, algebras, and multilinear forms

We study the problems of testing isomorphism of polynomials, algebras, a...
06/26/2019

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland

Consider the following two fundamental open problems in complexity theor...
10/12/2020

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions

We put forth a new computational notion of entropy, measuring the (in)fe...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.