Oded Regev
Oded Regev
Professor of Computer Science
Verifierad e-postadress på cims.nyu.edu - Startsida
Titel
Citeras av
Citeras av
År
On lattices, learning with errors, random linear codes, and cryptography
O Regev
Journal of the ACM (JACM) 56 (6), 1-40, 2009
28062009
On ideal lattices and learning with errors over rings
V Lyubashevsky, C Peikert, O Regev
Annual International Conference on the Theory and Applications of …, 2010
12342010
Worst-case to average-case reductions based on Gaussian measures
D Micciancio, O Regev
SIAM Journal on Computing 37 (1), 267-302, 2007
9152007
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
7402008
Lattice-based cryptography
D Micciancio, O Regev
Encyclopedia of Cryptography and Security, 713-715, 2011
6742011
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
5992008
The complexity of the local Hamiltonian problem
J Kempe, A Kitaev, O Regev
SIAM Journal on Computing 35 (5), 1070-1097, 2006
5172006
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
5122013
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
4222013
A toolkit for ring-LWE cryptography
V Lyubashevsky, C Peikert, O Regev
Annual International Conference on the Theory and Applications of …, 2013
3272013
New lattice-based cryptographic constructions
O Regev
Journal of the ACM (JACM) 51 (6), 899-942, 2004
3072004
The learning with errors problem
O Regev
Invited survey in CCC 7, 30, 2010
2672010
Lattice enumeration using extreme pruning
N Gama, PQ Nguyen, O Regev
Annual International Conference on the Theory and Applications of …, 2010
2612010
Quantum computation and lattice problems
O Regev
SIAM Journal on Computing 33 (3), 738-760, 2004
2282004
A new multilayered PCP and the hardness of hypergraph vertex cover
I Dinur, V Guruswami, S Khot, O Regev
SIAM Journal on Computing 34 (5), 1129-1146, 2005
1872005
Lattice problems in NP∩ coNP
D Aharonov, O Regev
Journal of the ACM (JACM) 52 (5), 749-765, 2005
1732005
Lattice-based cryptography
O Regev
Annual International Cryptology Conference, 131-141, 2006
1632006
Recovering short generators of principal ideals in cyclotomic rings
R Cramer, L Ducas, C Peikert, O Regev
Annual International Conference on the Theory and Applications of …, 2016
1512016
Conditional hardness for approximate coloring
I Dinur, E Mossel, O Regev
SIAM Journal on Computing 39 (3), 843-873, 2009
1502009
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
I Haviv, O Regev
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
140*2007
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20