Improved Hardness of BDD and SVP Under Gap-(S)ETH

Huck Bennett, Chris Peikert, Yi Tang

Hardness of the Binary Covering Radius Problem in Large ${\ell }_p$ Norms

Huck Bennett, Peter Ly

Hardness of Bounded Distance Decoding on Lattices in ${\ell }_p$ Norms

Huck Bennett, Chris Peikert

On the Quantitative Hardness of CVP

Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz

Fine-grained hardness of CVP(P) -- Everything that we can prove (and nothing else)

Divesh Aggarwal, Huck Bennett, Alexander Golovnev +1

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes

Huck Bennett, Chris Peikert

The Code Distortion Problem

Huck Bennett, Matthew Fox, Bryant Morrell

The paper defines a code distortion measure between linear error‑correcting codes and studies the computational problem of finding a minimum‑distortion mapping, proving NP‑hardness…

Matrix Multiplication Verification Using Coding Theory

Huck Bennett, Karthik Gajulapalli, Alexander Golovnev +1

Reconstructing weighted voting schemes from partial information about their power indices

Huck Bennett, Anindya De, Rocco A. Servedio +1

On (Non-)Isomorphism of Self-Dual Lattices and Codes

Huck Bennett, Kyle Fridberg

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ${\ell }_p$ Norms

Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami +1

Difficulties Constructing Lattices with Exponential Kissing Number from Codes

Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz

Topological $k$-metrics

Willow Barkan-Vered, Huck Bennett, Amir Nayyeri

Graph Inference with Effective Resistance Queries

Huck Bennett, Mitchell Black, Amir Nayyeri +1

Lattice Problems Beyond Polynomial Time

Divesh Aggarwal, Huck Bennett, Zvika Brakerski +6

On the Lattice Distortion Problem

Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz

Output-Sparse Matrix Multiplication Using Compressed Sensing

Huck Bennett, Karthik Gajulapalli, Alexander Golovnev +1