Folgen
Oded Regev
Oded Regev
Professor of Computer Science
Bestätigte E-Mail-Adresse bei cims.nyu.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On lattices, learning with errors, random linear codes, and cryptography
O Regev
Journal of the ACM (JACM) 56 (6), 1-40, 2009
43052009
On ideal lattices and learning with errors over rings
V Lyubashevsky, C Peikert, O Regev
Journal of the ACM (JACM) 60 (6), 1-35, 2013
25042013
Worst-case to average-case reductions based on Gaussian measures
D Micciancio, O Regev
SIAM Journal on Computing 37 (1), 267-302, 2007
12412007
Lattice-based cryptography
D Micciancio, O Regev
Encyclopedia of Cryptography and Security, 713-715, 2011
9752011
Vertex cover might be hard to approximate to within 2− ε
S Khot, O Regev
Journal of Computer and System Sciences 74 (3), 335-349, 2008
8992008
Adiabatic quantum computation is equivalent to standard quantum computation
D Aharonov, W Van Dam, J Kempe, Z Landau, S Lloyd, O Regev
SIAM review 50 (4), 755-787, 2008
8532008
Classical hardness of learning with errors
Z Brakerski, A Langlois, C Peikert, O Regev, D Stehlé
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
7272013
The complexity of the local Hamiltonian problem
J Kempe, A Kitaev, O Regev
Siam journal on computing 35 (5), 1070-1097, 2006
6982006
A toolkit for ring-LWE cryptography
V Lyubashevsky, C Peikert, O Regev
Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013
4902013
New lattice-based cryptographic constructions
O Regev
Journal of the ACM (JACM) 51 (6), 899-942, 2004
3672004
Lattice enumeration using extreme pruning
N Gama, PQ Nguyen, O Regev
Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010
3592010
Quantum computation and lattice problems
O Regev
SIAM Journal on Computing 33 (3), 738-760, 2004
2792004
Pseudorandomness of ring-LWE for any ring and modulus
C Peikert, O Regev, N Stephens-Davidowitz
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
2322017
Recovering short generators of principal ideals in cyclotomic rings
R Cramer, L Ducas, C Peikert, O Regev
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
2142016
Lattice problems in NP∩ coNP
D Aharonov, O Regev
Journal of the ACM (JACM) 52 (5), 749-765, 2005
2132005
A new multilayered PCP and the hardness of hypergraph vertex cover
I Dinur, V Guruswami, S Khot, O Regev
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2112003
The learning with errors problem
O Regev
Invited survey in CCC 7 (30), 11, 2010
2052010
Lattice-based cryptography
O Regev
Advances in Cryptology-CRYPTO 2006: 26th Annual International Cryptology …, 2006
2032006
Conditional hardness for approximate coloring
I Dinur, E Mossel, O Regev
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing …, 2006
1772006
An optimal lower bound on the communication complexity of gap-hamming-distance
A Chakrabarti, O Regev
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
1732011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20