generated by bibbase.org
  2018 (4)
(Gap/S)ETH Hardness of SVP. Aggarwal, D.; and Stephens-Davidowitz, N. In STOC, 2018.
(Gap/S)ETH Hardness of SVP [link]Paper   link   bibtex   abstract  
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). Aggarwal, D.; and Stephens-Davidowitz, N. In SOSA, 2018.
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) [link]Paper   link   bibtex   abstract  
Generalizations of Banaszczyk's Transference Theorems and Tail Bound. Miller, S. D.; and Stephens-Davidowitz, N. 2018.
Generalizations of Banaszczyk's Transference Theorems and Tail Bound [link]Paper   link   bibtex   abstract  
New (and Old) Proof Systems for Lattice Problems. Alamati, N.; Peikert, C.; and Stephens-Davidowitz, N. In PKC, 2018.
New (and Old) Proof Systems for Lattice Problems [link]Paper   link   bibtex   abstract  
  2017 (6)
An Inequality for Gaussians on Lattices. Regev, O.; and Stephens-Davidowitz, N. SIDMA. 2017.
An Inequality for Gaussians on Lattices [link]Paper   link   bibtex   abstract  
On the Quantitative Hardness of CVP. Bennett, H.; Golovnev, A.; and Stephens-Davidowitz, N. In FOCS, 2017.
On the Quantitative Hardness of CVP [link]Paper   On the Quantitative Hardness of CVP [link] princeton talk   link   bibtex   abstract  
Pseudorandomness of Ring-LWE for Any Ring and Modulus. Peikert, C.; Regev, O.; and Stephens-Davidowitz, N. In STOC, 2017.
Pseudorandomness of Ring-LWE for Any Ring and Modulus [link]Paper   link   bibtex   abstract  
A Reverse Minkowski Theorem. Regev, O.; and Stephens-Davidowitz, N. In STOC, 2017.
A Reverse Minkowski Theorem [link]Paper   A Reverse Minkowski Theorem [link] tcs+ talk   A Reverse Minkowski Theorem [link] ias talk   link   bibtex   abstract  
On the Gaussian Measure over Lattices. Stephens-Davidowitz, N. Ph.D. Thesis, New York University, 2017.
link   bibtex  
Implementing BP-Obfuscation Using Graph-Induced Encoding. Halevi, S.; Halevi, T.; Shoup, V.; and Stephens-Davidowitz, N. In 2017.
Implementing BP-Obfuscation Using Graph-Induced Encoding [link]Paper   link   bibtex   abstract  
  2016 (4)
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater than One. Stephens-Davidowitz, N. In APPROX, 2016.
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater than One [link]Paper   link   bibtex   abstract  
On the Lattice Distortion Problem. Bennett, H.; Dadush, D.; and Stephens-Davidowitz, N. In ESA, 2016.
On the Lattice Distortion Problem [link]Paper   link   bibtex   abstract  
Discrete Gaussian Sampling Reduces to CVP and SVP. Stephens-Davidowitz, N. In SODA, 2016.
Discrete Gaussian Sampling Reduces to CVP and SVP [link]Paper   link   bibtex   abstract  
Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines. Dodis, Y.; Mironov, I.; and Stephens-Davidowitz, N. In CRYPTO, 2016.
Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines [link]Paper   Message Transmission with Reverse Firewalls—Secure Communication on Corrupted Machines [link] crypto talk   link   bibtex   abstract  
  2015 (4)
Solving the Closest Vector Problem in $2^n$ Time—The Discrete Gaussian Strikes Again!. Aggarwal, D.; Dadush, D.; and Stephens-Davidowitz, N. In FOCS, 2015.
Solving the Closest Vector Problem in $2^n$ Time—The Discrete Gaussian Strikes Again! [link]Paper   link   bibtex   abstract  
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. Aggarwal, D.; Dadush, D.; Regev, O.; and Stephens-Davidowitz, N. In STOC, 2015.
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling [link]Paper   Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling [link] simons talk   link   bibtex   abstract  
Dimension-Preserving Reductions between Lattice Problems. Stephens-Davidowitz, N. 2015.
Dimension-Preserving Reductions between Lattice Problems [pdf]Paper   link   bibtex   abstract  
Cryptographic Reverse Firewalls. Mironov, I.; and Stephens-Davidowitz, N. In Eurocrypt, 2015.
Cryptographic Reverse Firewalls [link]Paper   Cryptographic Reverse Firewalls [pdf] slides   link   bibtex   abstract  
  2014 (2)
On the Closest Vector Problem with a Distance Guarantee. Dadush, D.; Regev, O.; and Stephens-Davidowitz, N. In CCC, 2014.
On the Closest Vector Problem with a Distance Guarantee [link]Paper   link   bibtex   abstract  
How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs. Dodis, Y.; Shamir, A.; Stephens-Davidowitz, N.; and Wichs, D. In CRYPTO, 2014.
How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs [link]Paper   link   bibtex   abstract  
  2007 (2)
The Cyclic Sieving Phenomenon on the Alternating Sign Matrices. Stephens-Davidowitz, N.; and Cloninger, A. 2007.
The Cyclic Sieving Phenomenon on the Alternating Sign Matrices [pdf]Paper   link   bibtex   abstract  
On Link Patterns AND Alternating Sign Matrices. Hong, F. C. K.; Cloninger, A.; and Stephens-Davidowitz, N. 2007.
On Link Patterns AND Alternating Sign Matrices [pdf]Paper   link   bibtex   abstract