Noah Stephens-Davidowitz

发表

A Tight Reverse Minkowski Inequality for the Epstein Zeta Function

O. Regev, Yael Eisenberg, Noah Stephens-Davidowitz, 2022, 2201.05201.

On the Gaussian Measure Over Lattices

Noah Stephens-Davidowitz, 2017 .

The (im)possibility of simple search-to-decision reductions for approximate optimization

Alexander Golovnev, Siyao Guo, Noah Stephens-Davidowitz, 2022 .

Lattice Problems beyond Polynomial Time

Zvika Brakerski, V. Vaikuntanathan, Divesh Aggarwal, 2022, STOC.

On the Hardness of Average-case k-SUM pdf

Vinod Vaikuntanathan, Zvika Brakerski, Noah Stephens-Davidowitz, 2020, APPROX-RANDOM.

Online Linear Extractors for Independent Sources

Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, 2021, IACR Cryptol. ePrint Arch..

On Seedless PRNGs and Premature Next

Stefano Tessaro, Sandro Coretti, Noah Stephens-Davidowitz, 2022, IACR Cryptol. ePrint Arch..

A Tight Reverse Minkowski Inequality for the Epstein Zeta Function

O. Regev, Yael Eisenberg, Noah Stephens-Davidowitz, 2022, 2201.05201.

Revisiting Time-Space Tradeoffs for Function Inversion

Alexander Golovnev, Siyao Guo, Noah Stephens-Davidowitz, 2022, Electron. Colloquium Comput. Complex..

Generalizations of Banaszczyk's transference theorems and tail bound

Noah Stephens-Davidowitz, Stephen D. Miller, S. Miller, 2018, IACR Cryptol. ePrint Arch..

Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!

Daniel Dadush, Divesh Aggarwal, Noah Stephens-Davidowitz, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

Pseudorandomness of ring-LWE for any ring and modulus

Chris Peikert, Oded Regev, Noah Stephens-Davidowitz, 2017, STOC.

(Gap/S)ETH hardness of SVP

Divesh Aggarwal, Noah Stephens-Davidowitz, Divesh Aggarwal, 2017, STOC.

Just how hard are rotations of ℤn? Algorithms and cryptography with the simplest lattice

Huck Bennett, Noah Stephens-Davidowitz, Atul Ganju, 2021, IACR Cryptol. ePrint Arch..

On the Closest Vector Problem with a Distance Guarantee

Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

Extractor Lower Bounds, Revisited

Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, 2019, Electron. Colloquium Comput. Complex..

Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract

Daniel Dadush, Divesh Aggarwal, Oded Regev, 2014, STOC.

Recursive lattice reduction - A framework for finding short lattice vectors

Divesh Aggarwal, Thomas Espitau, Noah Stephens-Davidowitz, 2023, ArXiv.

Dimension-Preserving Reductions Between SVP and CVP in Different p-Norms pdf

Divesh Aggarwal, Noah Stephens-Davidowitz, Rajendra Kumar, 2021, SODA.

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, 2020, ArXiv.

Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One

Noah Stephens-Davidowitz, Noah Stephens-Davidowitz, 2015, APPROX-RANDOM.

Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again!

D. Dadush, Divesh Aggarwal, Noah Stephens-Davidowitz, 2015, ArXiv.

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, 2021, EUROCRYPT.

On Bounded Distance Decoding and the Closest Vector Problem with Preprocessing

O. Regev, D. Dadush, Noah Stephens-Davidowitz, 2013 .

How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs

Adi Shamir, Yevgeniy Dodis, Daniel Wichs, 2017, Algorithmica.

Pseudorandomness of ring-LWE for any ring and modulus

Noah Stephens-Davidowitz, Chris Peikert, Oded Regev, 2017, STOC.