Oded Regev  

Alma mater  Tel Aviv University 
Known for  Learning with errors 
Awards 

Scientific career  
Fields  Computer science, Latticebased cryptography 
Institutions  Courant Institute of Mathematical Sciences 
Thesis  (2001) 
Doctoral advisor  Yossi Azar 
Website  cims 
Oded Regev (Hebrew: עודד רגב) is an IsraeliAmerican theoretical computer scientist and mathematician. He is a professor of computer science at the Courant institute at New York University.^{[3]} He is best known for his work in latticebased cryptography, and in particular for introducing the learning with errors problem.
Biography
Oded Regev earned his B.Sc. in 1995, M.Sc. in 1997, and Ph.D. in 2001, all from Tel Aviv University. He completed his Ph.D. at the age of 21, advised by Yossi Azar, with a thesis titled "Scheduling and Load Balancing."^{[4]}^{[5]}^{[6]} He held faculty positions at Tel Aviv University and the École Normale Supérieure before joining the Courant institute.^{[7]}
Work
Regev has done extensive work on lattices. He is best known for introducing the learning with errors problem (LWE), for which he won the 2018 Gödel Prize.^{[8]} As the citation reads:
Regev’s work has ushered in a revolution in cryptography, in both theory and practice. On the theoretical side, LWE has served as a simple and yet amazingly versatile foundation for nearly every kind of cryptographic object imaginable—along with many that were unimaginable until recently, and which still have no known constructions without LWE. Toward the practical end, LWE and its direct descendants are at the heart of several efficient realworld cryptosystems.
Regev's most influential other work on lattices includes cryptanalysis of the GGH and NTRU signature schemes in joint work with Phong Q. Nguyen, for which they won a best paper award at Eurocrypt 2006; introducing the ring learning with errors problem in joint work with Chris Peikert and Vadim Lyubashevsky; and proving a converse to Minkowski's theorem and exploring its applications in joint works with his student Noah StephensDavidowitz and his former postdoc Daniel Dadush. ^{[9]}^{[10]}^{[11]}^{[12]}^{[13]}
In addition to his work on lattices, Regev has also done work in a large number of other areas in theoretical computer science and mathematics. These include quantum computing, communication complexity, hardness of approximation, online algorithms, combinatorics, probability, and dimension reduction. He has also recently become interested in topics in biology, and particularly RNA splicing.^{[14]}^{[15]}
Regev is an associate editor in chief of the journal Theory of Computing, and is a cofounder and organizer of the TCS+ online seminar series.^{[16]}^{[17]}
References
 ^ "Simons Investigators". Simons Foundation. July 10, 2018.
 ^ http://www.wolffund.org.il/index.php?dir=site&page=winners&cs=565
 ^ Faculty listing, Courant Institute of Mathematical Sciences, accessed 20190625.
 ^ School of Computer Science Thesis Repository, TelAviv University, accessed 20190625.
 ^ https://www.aftau.org/2013redesign/pages/tau/spotlights/blavatnikschoolofcomputerscience#alumniSay.
 ^ http://primage.tau.ac.il/libraries/theses/exeng/free/1509397_abe.pdf.
 ^ "Oded Regev". Simons Foundation. October 5, 2014.
 ^ http://eatcs.org/index.php/component/content/article/1news/26702018godelprize
 ^ "IACR Publication Awards". www.iacr.org.
 ^ Nguyen, Phong Q.; Regev, Oded (2008). "Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures". Journal of Cryptology. 22 (2): 139–160. doi:10.1007/s0014500890310. ISSN 09332790. S2CID 2164840.
 ^ Lyubashevsky, Vadim; Peikert, Chris; Regev, Oded (2010). "On Ideal Lattices and Learning with Errors over Rings". Advances in Cryptology – EUROCRYPT 2010. Lecture Notes in Computer Science. 6110. pp. 1–23. doi:10.1007/9783642131905_1. ISBN 9783642131899. ISSN 03029743.
 ^ Regev, Oded; StephensDavidowitz, Noah (2017), A reverse Minkowski theorem, Annual ACM SIGACT Symposium on Theory of Computing, Montreal, Quebec, Canada, pp. 941–953, arXiv:1611.05979
 ^ Dadush, Daniel; Regev, Oded (2016). "Towards Strong Reverse MinkowskiType Inequalities for Lattices". 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). pp. 447–456. arXiv:1606.06913. doi:10.1109/FOCS.2016.55. ISBN 9781509039333. S2CID 16828584.
 ^ https://cims.nyu.edu/~regev/.
 ^ "Oded Regev". scholar.google.com.
 ^ List of editors, Theory of Computing, accessed 20190625.
 ^ "TCS+". sites.google.com.