Projects per year
Abstract
Constructing one-way functions from average-case hardness is a long-standing open problem. A positive result would exclude Pessiland (Impagliazzo ’95) and establish a highly desirable win–win situation: either (symmetric) cryptography exists unconditionally, or all problems can be solved efficiently on the average. Motivated by the lack of progress on this seemingly very hard question, we initiate the investigation of weaker yet meaningful candidate win–win results of the following type: either there are fine-grained one-way functions (FGOWF), or non-trivial speedups can be obtained for all problems on the average. FGOWFs only require a fixed polynomial gap (as opposed to superpolynomial) between the running time of the function and the running time of an inverter. We obtain three main results: Construction. We show that if there is an language having a very strong form of average-case hardness, which we call block finding hardness, then FGOWF exist. We provide heuristic support for this very strong average-case hardness notion by showing that it holds for a random language. Then, we study whether weaker (and more natural) forms of average-case hardness could already suffice to obtain FGOWF and obtain two negative results: Separation I. We provide a strong oracle separation for the implication ( exponentially average-case hard language FGOWF). Separation II. We provide a second strong negative result for an even weaker candidate win–win result. Namely, we rule out a relativizing proof for the implication ( exponentially average-case hard language whose hardness amplifies optimally through parallel repetitions FGOWF). This separation forms the core technical contribution of our work.
Original language | English |
---|---|
Article number | 8 |
Journal | Journal of Cryptology |
Volume | 38 |
Issue number | 1 |
Early online date | 4 Dec 2024 |
DOIs | |
Publication status | Published - Jan 2025 |
MoE publication type | A1 Journal article-refereed |
Keywords
- Pessiland
- Fine-grained one-way function
- Oracle separation
- Average-case hardness
- Exponential hardness
Fingerprint
Dive into the research topics of 'On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness'. Together they form a unique fingerprint.-
Brzuska ICT: Limits of Lattice-based Cryptography: A New Era of Hinted and Structured Assumptions
Brzuska, C. (Principal investigator), Woo, I. K. Y. (Project Member), Karanko, P. (Project Member) & Puniamurthy, K. (Project Member)
01/01/2024 → 31/12/2026
Project: Academy of Finland: Other research funding
-
CryptoProSAT: Cryptographic Protocol Efficiency via SAT solving
Brzuska, C. (Principal investigator), Alpirez Bock, E. (Project Member), Abuzaid, O. (Project Member), Karanko, P. (Project Member), Kohbrok, K. (Project Member), Cornelissen, E. (Project Member) & Puniamurthy, K. (Project Member)
01/01/2020 → 31/12/2023
Project: Academy of Finland: Other research funding