Noah Stephens-Davidowitz
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
- [c16]Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. Public Key Cryptography (2) 2018: 619-643 - [c15]Divesh Aggarwal, Noah Stephens-Davidowitz:
Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP). SOSA@SODA 2018: 12:1-12:19 - [c14]
- [i16]Stephen D. Miller, Noah Stephens-Davidowitz:
Generalizations of Banaszczyk's transference theorems and tail bound. IACR Cryptology ePrint Archive 2018: 188 (2018) - 2017
- [j2]Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs. Algorithmica 79(4): 1196-1232 (2017) - [j1]Oded Regev, Noah Stephens-Davidowitz:
An Inequality for Gaussians on Lattices. SIAM J. Discrete Math. 31(2): 749-757 (2017) - [c13]Shai Halevi, Tzipora Halevi, Victor Shoup, Noah Stephens-Davidowitz:
Implementing BP-Obfuscation Using Graph-Induced Encoding. ACM Conference on Computer and Communications Security 2017: 783-798 - [c12]Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
On the Quantitative Hardness of CVP. FOCS 2017: 13-24 - [c11]Chris Peikert, Oded Regev, Noah Stephens-Davidowitz:
Pseudorandomness of ring-LWE for any ring and modulus. STOC 2017: 461-473 - [c10]
- [i15]Huck Bennett, Alexander Golovnev, Noah Stephens-Davidowitz:
On the Quantitative Hardness of CVP. CoRR abs/1704.03928 (2017) - [i14]Divesh Aggarwal, Noah Stephens-Davidowitz:
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). CoRR abs/1709.01535 (2017) - [i13]
- [i12]Shai Halevi, Tzipora Halevi, Victor Shoup, Noah Stephens-Davidowitz:
Implementing BP-Obfuscation Using Graph-Induced Encoding. IACR Cryptology ePrint Archive 2017: 104 (2017) - [i11]Chris Peikert, Oded Regev, Noah Stephens-Davidowitz:
Pseudorandomness of Ring-LWE for Any Ring and Modulus. IACR Cryptology ePrint Archive 2017: 258 (2017) - [i10]Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. IACR Cryptology ePrint Archive 2017: 1226 (2017) - 2016
- [c9]Noah Stephens-Davidowitz:
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One. APPROX-RANDOM 2016: 19:1-19:18 - [c8]Yevgeniy Dodis, Ilya Mironov, Noah Stephens-Davidowitz:
Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines. CRYPTO (1) 2016: 341-372 - [c7]Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz:
On the Lattice Distortion Problem. ESA 2016: 9:1-9:17 - [c6]
- [i9]Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz:
On the Lattice Distortion Problem. CoRR abs/1605.03613 (2016) - 2015
- [c5]Ilya Mironov, Noah Stephens-Davidowitz:
Cryptographic Reverse Firewalls. EUROCRYPT (2) 2015: 657-686 - [c4]Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz:
Solving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again! FOCS 2015: 563-582 - [c3]Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract. STOC 2015: 733-742 - [i8]Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz:
Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again! CoRR abs/1504.01995 (2015) - [i7]Noah Stephens-Davidowitz:
Discrete Gaussian Sampling Reduces to CVP and SVP. CoRR abs/1506.07490 (2015) - [i6]Noah Stephens-Davidowitz:
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One. CoRR abs/1512.04138 (2015) - [i5]Yevgeniy Dodis, Ilya Mironov, Noah Stephens-Davidowitz:
Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines. IACR Cryptology ePrint Archive 2015: 548 (2015) - 2014
- [c2]Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
On the Closest Vector Problem with a Distance Guarantee. IEEE Conference on Computational Complexity 2014: 98-109 - [c1]Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs. CRYPTO (2) 2014: 37-54 - [i4]Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
On the Closest Vector Problem with a Distance Guarantee. CoRR abs/1409.8063 (2014) - [i3]Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz:
Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling. CoRR abs/1412.7994 (2014) - [i2]Yevgeniy Dodis, Adi Shamir, Noah Stephens-Davidowitz, Daniel Wichs:
How to Eat Your Entropy and Have it Too - Optimal Recovery Strategies for Compromised RNGs. IACR Cryptology ePrint Archive 2014: 167 (2014) - [i1]Ilya Mironov, Noah Stephens-Davidowitz:
Cryptographic Reverse Firewalls. IACR Cryptology ePrint Archive 2014: 758 (2014)
Coauthor Index
last updated on 2019-01-09 01:19 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint