One-way functions and pKt complexity

Cites work

BPP has subexponential time simulations unless EXPTIME has publishable proofs
A duality between one-way functions and average-case symmetry of information
A Pseudorandom Generator from any One-way Function
An introduction to Kolmogorov complexity and its applications
Bit commitment using pseudorandomness
Bounded relativization
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Hardness of KT characterizes parallel cryptography
scientific article; zbMATH DE number 5081744 (Why is no real title available?)
scientific article; zbMATH DE number 107775 (Why is no real title available?)
scientific article; zbMATH DE number 3489017 (Why is no real title available?)
scientific article; zbMATH DE number 2081089 (Why is no real title available?)
scientific article; zbMATH DE number 1559537 (Why is no real title available?)
scientific article; zbMATH DE number 7829316 (Why is no real title available?)
scientific article; zbMATH DE number 7701424 (Why is no real title available?)
Kolmogorov comes to cryptomania: on interactive Kolmogorov complexity and key-agreement
Kolmogorov Complexity and Algorithmic Randomness
Learning in Pessiland via inductive inference
Natural proofs
New directions in cryptography
NP-hardness of learning programs and partial MCSP
On basing one-way functions on NP-hardness
On basing size-verifiable one-way functions on NP-hardness
On one-way functions and Kolmogorov complexity
On one-way functions from NP-complete problems
On symmetry of information and polynomial time invertibility
On the possibility of basing cryptography on $\mathsf{EXP}\ne \mathsf{BPP} $
One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
Optimal coding theorems in time-bounded Kolmogorov complexity
Probabilistic encryption
Probabilistic Kolmogorov complexity with applications to average-case complexity
Pseudodeterministic constructions in subexponential time
Pseudorandom generators without the XOR lemma
Pseudorandomness and average-case complexity via uniform reductions
Randomness and intractability in Kolmogorov complexity
Randomness conservation inequalities; information and independence in mathematical theories
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Robustness of average-case meta-complexity via pseudorandomness
Symmetry of information and one-way functions
Symmetry of information from meta-complexity
The Complexity of Complexity
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

This page was built for publication: One-way functions and pKt complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955039)