CryptoDB
A Direct PRF Construction from Kolmogorov Complexity
Authors: |
|
---|---|
Download: |
|
Presentation: | Slides |
Conference: | EUROCRYPT 2024 |
Abstract: | While classic results in the 1980s establish that one-way functions (OWFs) imply the existence of pseudorandom generators (PRGs) which in turn imply pseudorandom functions (PRFs), the constructions (most notably the one from OWFs to PRGs) is complicated and inefficient.
Consequently, researchers have developed alternative \emph{direct} constructions of PRFs from various different concrete hardness assumptions. In this work, we continue this thread of work and demonstrate the first direct constructions of PRFs from average-case hardness of the time-bounded Kolmogorov complexity problem |
BibTeX
@inproceedings{eurocrypt-2024-34024, title={A Direct PRF Construction from Kolmogorov Complexity}, publisher={Springer-Verlag}, doi={10.1007/978-3-031-58737-5_14}, author={Yanyi Liu and Rafael Pass}, year=2024 }