On building fine-grained one-way functions from strong average-case hardness
From MaRDI portal
Publication:2170063
DOI10.1007/978-3-031-07085-3_20zbMath1497.68209OpenAlexW4285155293MaRDI QIDQ2170063
Geoffroy Couteau, Chris Brzuska
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07085-3_20
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Fine-grained secure attribute-based encryption
Cites Work
- Unnamed Item
- Unnamed Item
- NP is as easy as detecting unique solutions
- One way functions and pseudorandom generators
- Decoding of Reed Solomon codes beyond the error-correction bound
- Random oracles and non-uniformity
- Proofs of Work from worst-case assumptions
- Public-key cryptography in the fine-grained setting
- Secure communications over insecure channels
- Fine-Grained Cryptography
- Notions of Black-Box Reductions, Revisited
- On basing one-way functions on NP-hardness
- Random-Self-Reducibility of Complete Sets
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Random Oracles and Auxiliary Input
- Average Case Complete Problems
- A cryptanalytic time-memory trade-off
- Average-case fine-grained hardness
- Merkle Puzzles in a Quantum World
- On Basing Size-Verifiable One-Way Functions on NP-Hardness
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Advances in Cryptology – CRYPTO 2004
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Theory of Cryptography
- Theory of Cryptography
- Pseudorandom generators without the XOR lemma
This page was built for publication: On building fine-grained one-way functions from strong average-case hardness
