On the Closest Vector Problem with a Distance Guarantee. - Daniel Dadush; Oded Regev 001; Noah Stephens-Davidowitz (CCC, 2014)

Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. - Divesh Aggarwal; Daniel Dadush; Oded Regev 001; Noah Stephens-Davidowitz (CoRR, 2014)

Cryptographic Reverse Firewalls. - Ilya Mironov; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2014)

Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! - Divesh Aggarwal; Daniel Dadush; Noah Stephens-Davidowitz (FOCS, 2015)

Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract. - Divesh Aggarwal; Daniel Dadush; Oded Regev 001; Noah Stephens-Davidowitz (STOC, 2015)

Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines. - Yevgeniy Dodis; Ilya Mironov; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2015)

Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One. - Noah Stephens-Davidowitz (APPROX-RANDOM, 2016)

On the Lattice Distortion Problem. - Huck Bennett; Daniel Dadush; Noah Stephens-Davidowitz (ESA, 2016)

Discrete Gaussian Sampling Reduces to CVP and SVP. - Noah Stephens-Davidowitz (SODA, 2016)

On the Quantitative Hardness of CVP. - Huck Bennett; Alexander Golovnev; Noah Stephens-Davidowitz (FOCS, 2017)

A reverse Minkowski theorem. - Oded Regev 001; Noah Stephens-Davidowitz (STOC, 2017)

How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. - Yevgeniy Dodis; Adi Shamir; Noah Stephens-Davidowitz; Daniel Wichs (Algorithmica, 2017)

New (and Old) Proof Systems for Lattice Problems. - Navid Alamati; Chris Peikert; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

Implementing BP-Obfuscation Using Graph-Induced Encoding. - Shai Halevi; Tzipora Halevi; Victor Shoup; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

Pseudorandomness of Ring-LWE for Any Ring and Modulus. - Chris Peikert; Oded Regev 001; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

An Inequality for Gaussians on Lattices. - Oded Regev 001; Noah Stephens-Davidowitz (SIAM J. Discret. Math., 2017)

On the Gaussian Measure Over Lattices. - Noah Stephens-Davidowitz (2017)

Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). - Divesh Aggarwal; Noah Stephens-Davidowitz (SOSA, 2018)

(Gap/S)ETH hardness of SVP. - Divesh Aggarwal; Noah Stephens-Davidowitz (STOC, 2018)

Generalizations of Banaszczyk's transference theorems and tail bound. - Stephen D. Miller; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2018)

A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic. - Noah Stephens-Davidowitz (CCC, 2019)

Extractor Lower Bounds, Revisited. - Divesh Aggarwal; Siyao Guo; Maciej Obremski; João Ribeiro 002; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2019)

SETH-hardness of Coding Problems. - Noah Stephens-Davidowitz; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2019)

Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP. - Tamalika Mukherjee; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2019)

Kissing Numbers and Transference Theorems from Generalized Tail Bounds. - Stephen D. Miller; Noah Stephens-Davidowitz (SIAM J. Discret. Math., 2019)

Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. - Divesh Aggarwal; Jianwei Li; Phong Q. Nguyen; Noah Stephens-Davidowitz (CRYPTO (2), 2020)

A 2n/2-Time Algorithm for √n-SVP and √n-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. - Divesh Aggarwal; Zeyong Li; Noah Stephens-Davidowitz (CoRR, 2020)

On the Hardness of Average-Case k-SUM. - Zvika Brakerski; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (APPROX-RANDOM, 2021)

No Time to Hash: On Super-Efficient Entropy Accumulation. - Yevgeniy Dodis; Siyao Guo; Noah Stephens-Davidowitz; Zhiye Xie (CRYPTO (4), 2021)

A 2n/2-Time Algorithm for $ sqrt{n}$-SVP and $ sqrt{n}$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP. - Divesh Aggarwal; Zeyong Li; Noah Stephens-Davidowitz (EUROCRYPT (1), 2021)

Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else). - Divesh Aggarwal; Huck Bennett; Alexander Golovnev; Noah Stephens-Davidowitz (SODA, 2021)

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Zeyong Li; Noah Stephens-Davidowitz (SODA, 2021)

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms. - Divesh Aggarwal; Yanlin Chen; Rajendra Kumar 002; Zeyong Li; Noah Stephens-Davidowitz (CoRR, 2021)

On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization. - Alexander Golovnev; Siyao Guo; Spencer Peters; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2021)

Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice. - Huck Bennett; Atul Ganju; Pura Peetathawatchai; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2021)

No Time to Hash: On Superefficient Entropy Accumulation. - Yevgeniy Dodis; Siyao Guo; Noah Stephens-Davidowitz; Zhiye Xie (IACR Cryptol. ePrint Arch., 2021)

Online Linear Extractors for Independent Sources. - Yevgeniy Dodis; Siyao Guo; Noah Stephens-Davidowitz; Zhiye Xie (IACR Cryptol. ePrint Arch., 2021)

Revisiting Time-Space Tradeoffs for Function Inversion. - Alexander Golovnev; Siyao Guo; Spencer Peters; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2022)

On Seedless PRNGs and Premature Next. - Sandro Coretti; Yevgeniy Dodis; Harish Karthikeyan; Noah Stephens-Davidowitz; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2022)

The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. - Alexander Golovnev; Siyao Guo; Spencer Peters; Noah Stephens-Davidowitz (APPROX/RANDOM, 2023)

Just How Hard Are Rotations of $ mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice. - Huck Bennett; Atul Ganju; Pura Peetathawatchai; Noah Stephens-Davidowitz (EUROCRYPT (5), 2023)

Lattice Problems beyond Polynomial Time. - Divesh Aggarwal; Huck Bennett; Zvika Brakerski; Alexander Golovnev; Rajendra Kumar 002; Zeyong Li; Spencer Peters; Noah Stephens-Davidowitz; Vinod Vaikuntanathan (STOC, 2023)

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. - Eldon Chung; Alexander Golovnev; Zeyong Li; Maciej Obremski; Sidhant Saraogi; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2023)

More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More. - Surendra Ghentiyala; Noah Stephens-Davidowitz (APPROX/RANDOM, 2024)

Difficulties Constructing Lattices with Exponential Kissing Number from Codes. - Huck Bennett; Alexander Golovnev; Noah Stephens-Davidowitz (CoRR, 2024)

The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. - Huck Bennett; Surendra Ghentiyala; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2024)

The More the Merrier! On Total Coding and Lattice Problems and the Complexity of Finding Multicollisions. - Huck Bennett; Surendra Ghentiyala; Noah Stephens-Davidowitz (ITCS, 2025)

Recursive lattice reduction - A framework for finding short lattice vectors. - Divesh Aggarwal; Thomas Espitau; Spencer Peters; Noah Stephens-Davidowitz (SOSA, 2025)

Guarding the Signal: Secure Messaging with Reverse Firewalls. - Yevgeniy Dodis; Bernardo Magri; Noah Stephens-Davidowitz; Yiannis Tselekounis (IACR Cryptol. ePrint Arch., 2025)