Huck Bennett - RankMe

47 papers A* 7A 6B 1Journal 31Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Advanced cryptography from lattice isomorphism - new constructions of IBE and FHE. IACR Cryptol. ePrint Arch. Huck Bennett, Zhengnan Lai, Noah Stephens-Davidowitz
2026	J	`jnl`	Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem. IEEE Trans. Inf. Theory Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
2026	J	`jnl`	Hardness of the Binary Covering Radius Problem in Large ℓ CoRR Huck Bennett, Peter Ly
2026	J	`jnl`	Topological k-Metrics. Discret. Comput. Geom. Willow Barkan-Vered, Huck Bennett, Amir Nayyeri
2025	B	`conf`	Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem. ISIT Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
2025	J	`jnl`	Asymptotic improvements to provable algorithms for the code equivalence problem. IACR Cryptol. ePrint Arch. Huck Bennett, Drisana Bhatia, Jean-François Biasse, Medha Durisheti, Lucas LaBuff, Vincenzo Pallozzi Lavorante, Phillip Waitkevich
2025	J	`jnl`	Difficulties Constructing Lattices With Exponential Kissing Number From Codes. IEEE Trans. Inf. Theory Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2025	J	`jnl`	Graph Inference with Effective Resistance Queries. CoRR Huck Bennett, Mitchell Black, Amir Nayyeri, Evelyn Warton
2025	J	`jnl`	Output-Sparse Matrix Multiplication Using Compressed Sensing. CoRR Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Evelyn Warton
2025	J	`jnl`	Relating code equivalence to other isomorphism problems. Des. Codes Cryptogr. Huck Bennett, Kaung Myat Htay Win
2025	A	`conf`	The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions. ITCS Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz
2024	J	`jnl`	Difficulties Constructing Lattices with Exponential Kissing Number from Codes. CoRR Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2024	A	`conf`	Matrix Multiplication Verification Using Coding Theory. APPROX/RANDOM Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Evelyn Warton
2024	J	`jnl`	Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ${\ell_{{p}}}$ Norms. SIAM J. Comput. Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro
2024	J	`jnl`	Relating Code Equivalence to Other Isomorphism Problems. IACR Cryptol. ePrint Arch. Huck Bennett, Kaung Myat Htay Win
2024	J	`jnl`	The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. Electron. Colloquium Comput. Complex. Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz
2024	A*	`conf`	Topological k-Metrics. SoCG Willow Barkan-Vered, Huck Bennett, Amir Nayyeri
2023	A	`conf`	Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. APPROX/RANDOM Huck Bennett, Chris Peikert
2023	—	`conf`	Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice. EUROCRYPT (5) Huck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz
2023	A*	`conf`	Lattice Problems beyond Polynomial Time. STOC Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
2023	J	`jnl`	Matrix Multiplication Verification Using Coding Theory. CoRR Huck Bennett, Karthik Gajulapalli, Alexander Golovnev, Evelyn Warton
2023	A*	`conf`	Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ STOC Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro
2023	J	`jnl`	The Complexity of the Shortest Vector Problem. SIGACT News Huck Bennett
2023	J	`jnl`	Topological k-metrics. CoRR Willow Barkan-Vered, Huck Bennett, Amir Nayyeri
2022	J	`jnl`	Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. CoRR Huck Bennett, Chris Peikert
2022	A	`conf`	Improved Hardness of BDD and SVP Under Gap-(S)ETH. ITCS Huck Bennett, Chris Peikert, Yi Tang
2022	J	`jnl`	Lattice Problems Beyond Polynomial Time. CoRR Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan
2022	J	`jnl`	Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓ Electron. Colloquium Comput. Complex. Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro
2022	J	`jnl`	Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all 𝓁 CoRR Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro
2022	J	`jnl`	The Complexity of the Shortest Vector Problem. Electron. Colloquium Comput. Complex. Huck Bennett
2021	A*	`conf`	Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). SODA Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2021	J	`jnl`	Improved Hardness of BDD and SVP Under Gap-(S)ETH. CoRR Huck Bennett, Chris Peikert, Yi Tang
2021	J	`jnl`	Just how hard are rotations of ℤ IACR Cryptol. ePrint Arch. Huck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz
2021	A*	`conf`	Reconstructing weighted voting schemes from partial information about their power indices. COLT Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
2020	A	`conf`	Hardness of Bounded Distance Decoding on Lattices in ℓ CCC Huck Bennett, Chris Peikert
2020	J	`jnl`	Hardness of Bounded Distance Decoding on Lattices in 𝓁 CoRR Huck Bennett, Chris Peikert
2020	J	`jnl`	Reconstructing weighted voting schemes from partial information about their power indices. CoRR Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
2019	J	`jnl`	Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). CoRR Divesh Aggarwal, Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2019	J	`jnl`	On percolation and -hardness. Random Struct. Algorithms Huck Bennett, Daniel Reichman, Igor Shinkar
2017	J	`jnl`	Amortized analysis of smooth quadtrees in all dimensions. Comput. Geom. Huck Bennett, Chee Yap
2017	A*	`conf`	On the Quantitative Hardness of CVP. FOCS Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2017	J	`jnl`	On the Quantitative Hardness of CVP. CoRR Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz
2016	A*	`conf`	On Percolation and NP-Hardness. ICALP Huck Bennett, Daniel Reichman, Igor Shinkar
2016	A	`conf`	On the Lattice Distortion Problem. ESA Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz
2016	J	`jnl`	On the Lattice Distortion Problem. CoRR Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz
2016	J	`jnl`	Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. Comput. Graph. Forum Huck Bennett, Evanthia Papadopoulou, Chee Yap
2014	—	`conf`	Amortized Analysis of Smooth Quadtrees in All Dimensions. SWAT Huck Bennett, Chee Yap