research
∙
02/15/2022
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes
We give a simple proof that the (approximate, decisional) Shortest Vecto...
share
research
∙
09/11/2021
F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version)
Fully Homomorphic Encryption (FHE) allows computing on encrypted data, e...
research
∙
09/09/2021
Improved Hardness of BDD and SVP Under Gap-(S)ETH
We show improved fine-grained hardness of two key lattice problems in th...
research
∙
10/09/2020
Lattice (List) Decoding Near Minkowski's Inequality
Minkowski proved that any n-dimensional lattice of unit determinant has ...
research
∙
03/17/2020
Hardness of Bounded Distance Decoding on Lattices in ℓ_p Norms
Bounded Distance Decoding _p,α is the problem of decoding a lattice when...
research
∙
10/31/2019
