A direct PRF construction from Kolmogorov complexity
From MaRDI portal
(Redirected from Publication:6637531)
Cites work
- A Pseudorandom Generator from any One-way Function
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
- A theory of the learnable
- Beyond natural proofs: hardness magnification and locality
- Bootstrapping results for threshold circuits ``just beyond known lower bounds
- Characterizing derandomization through hardness of Levin-Kolmogorov complexity
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Circuit minimization problem
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
- Counting unpredictable bits: a simple PRG from one-way functions
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- Foundations of Cryptography
- Hardness vs randomness
- scientific article; zbMATH DE number 3145597 (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 861531 (Why is no real title available?)
- Learning algorithms from natural proofs
- Natural proofs
- Number-theoretic constructions of efficient pseudo-random functions
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the distribution of the number of roots of polynomials and explicit weak designs
- On the notion of infinite pseudorandom sequences
- On the Power of the Randomized Iterate
- Power from Random Strings
- Probabilistic encryption
- Pseudo-random functions and factoring (extended abstract)
- Pseudorandom functions and lattices
- Pseudorandom functions: three decades later
- Pseudorandom generators without the XOR lemma
- Relations and equivalences between circuit lower bounds and karp-lipton theorems
- Resettable zero-knowledge (extended abstract)
- Security Amplification for Interactive Cryptographic Primitives
- Software protection and simulation on oblivious RAMs
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Theory of Cryptography
- Three approaches to the quantitative definition of information*
- Weak lower bounds on resource-bounded compression imply strong separations of complexity classes
This page was built for publication: A direct PRF construction from Kolmogorov complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637531)
