Public-key cryptography in the fine-grained setting
From MaRDI portal
Publication:2304935
DOI10.1007/978-3-030-26954-8_20OpenAlexW2967083823MaRDI QIDQ2304935
Rio LaVigne, Andrea Lincoln, Virginia Vassilevska Williams
Publication date: 9 March 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_20
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
On building fine-grained one-way functions from strong average-case hardness ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ Improved Merlin-Arthur protocols for central problems in fine-grained complexity ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
This page was built for publication: Public-key cryptography in the fine-grained setting