Oded Regev

Oded Regev is a computer scientist and mathematician noted for contributions to theoretical computer science, complexity theory, and algorithms. He has held academic positions at major research institutions and published influential work on lattice-based cryptography, probabilistic proof systems, and hardness of approximation. Regev's work connects areas represented by prominent figures and institutions in computer science and mathematics.

Early life and education

Regev was born in Israel and grew up amid the cultural and scientific milieu that produced notable figures associated with Hebrew University of Jerusalem, Weizmann Institute of Science, and Technion – Israel Institute of Technology. He completed his undergraduate education at an Israeli institution and pursued graduate studies that culminated in a Ph.D. under supervision that linked traditions from Tel Aviv University and mentors who interacted with scholars from Massachusetts Institute of Technology, Stanford University, and University of California, Berkeley. During his formative years he engaged with research communities connected to conferences such as STOC and FOCS, and workshops organized by DIMACS and Simons Institute.

Academic career

Regev's academic appointments have included positions at research universities and collaborations with laboratories and centers tied to Institute for Advanced Study, Microsoft Research, and national funding bodies like the Israel Science Foundation and National Science Foundation. He has supervised graduate students who went on to positions at institutions such as Princeton University, Harvard University, Columbia University, and international centers including ETH Zurich and École Normale Supérieure. Regev has served on program committees for flagship venues including CRYPTO, Eurocrypt, ICALP, and editorial boards of journals associated with ACM and IEEE. He frequently presented plenary talks at gatherings such as RSA Conference, IACR, and symposia organized by European Research Council grantees.

Research contributions

Regev's research spans interrelated topics that bridge the work of researchers from Leonard Adleman-era cryptography to lattice cryptanalysis initiatives led by groups at IBM Research and Google Research. He is widely recognized for foundational results in lattice problems, probabilistic reductions, and complexity-theoretic hardness. Key contributions include formalizing reductions from worst-case lattice problems like Shortest Vector Problem and Closest Vector Problem to average-case constructions used in cryptographic schemes; these reductions connected strands from Ajtai's earlier proposals to modern constructions inspired by Micciancio and Goldreich. Regev introduced techniques blending quantum computation perspectives influenced by work from Peter Shor and Lov Grover with classical hardness assumptions explored by Noam Nisan and Avi Wigderson, thus informing post-quantum cryptography programs at entities such as NIST.

In complexity theory, Regev contributed to the study of probabilistically checkable proofs and hardness of approximation, engaging ideas related to the PCP theorem and hardness results developed by Johan Håstad and Subhash Khot. His analyses have implications for lattice-based primitives including encryption, signature schemes, and homomorphic encryption, intersecting efforts at IBM Z, Microsoft Azure, and academic labs at University of California, San Diego. Regev's work often references algorithmic frameworks comparable to those advanced by Daniel Spielman and Umesh Vazirani, and has spurred follow-on research from groups at Cornell University, Carnegie Mellon University, and the University of Washington.

Awards and honors

Regev has received recognition from professional bodies and research foundations that honor contributions to theoretical computer science and cryptography. His honors include prizes and fellowships connected to organizations such as ACM, IEEE, and national science academies like the Israel Academy of Sciences and Humanities. He has been invited to speak at major international meetings including International Congress of Mathematicians sessions and award symposia hosted by Simons Foundation and Royal Society. Regev's influence is reflected in citations and prizes that align him with laureates such as Shafi Goldwasser, Silvio Micali, and Oded Goldreich for foundational work in cryptography.

Selected publications

- Regev, O., foundational papers on lattice-based cryptography and reductions establishing worst-case to average-case hardness, published in proceedings alongside contributions at CRYPTO, Eurocrypt, and STOC; these works are often cited in surveys by Daniel Micciancio and texts used at MIT Press and Cambridge University Press. - Regev, O., papers on connections between quantum algorithms and lattice problems, with implications discussed in venues such as QIP and journals associated with SIAM and IEEE Computer Society. - Regev, O., contributions to hardness of approximation and probabilistically checkable proofs, appearing in collections from ICALP and workshops organized by Banff International Research Station.

Category:Computer scientists Category:Cryptographers Category:Theoretical computer scientists