all InfoSec news
A Direct PRF Construction from Kolmogorov Complexity
March 5, 2024, 9:42 a.m. |
IACR News www.iacr.org
ePrint Report: A Direct PRF Construction from Kolmogorov Complexity
Yanyi Liu, Rafael Pass
While classic result 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 …
complexity construction eprint report functions imply pass report result turn
More from www.iacr.org / IACR News
Regev Factoring Beyond Fibonacci: Optimizing Prefactors
2 days, 11 hours ago |
www.iacr.org
NTRU-based FHE for Larger Key and Message Space
2 days, 11 hours ago |
www.iacr.org
Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields
2 days, 11 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Network Security Engineer
@ Meta | Menlo Park, CA | Remote, US
Security Engineer, Investigations - i3
@ Meta | Washington, DC
Threat Investigator- Security Analyst
@ Meta | Menlo Park, CA | Seattle, WA | Washington, DC
Security Operations Engineer II
@ Microsoft | Redmond, Washington, United States
Engineering -- Tech Risk -- Global Cyber Defense & Intelligence -- Bug Bounty -- Associate -- Dallas
@ Goldman Sachs | Dallas, Texas, United States