Oded Regev
Artificial Intelligence · 2003–2013
A researcher in the Science corpus: 13 papers; trusts 57 researchers and is trusted by 144 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 142 citations into it; #2,028 of 36,961 by trust here, #2,902 by citations
- Computational Theory and Mathematics — 101 citations into it; #140 of 12,489 by trust here, #280 by citations
- Computer Networks and Communications — 22 citations into it; #4,881 of 9,996 by trust here, #5,045 by citations
- Computer Vision and Pattern Recognition — 17 citations into it; #4,730 of 21,973 by trust here, #11,582 by citations
- Information Systems — 17 citations into it
- Privacy & Security — 14 citations into it
- Algorithms & Complexity — 10 citations into it
- Discrete Mathematics and Combinatorics — 6 citations into it
Whom Oded Regev trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Daniele Micciancio
- Chris Peikert
- Vadim Lyubashevsky
- Craig Gentry
- Adam R. Klivans
- Lov K. Grover
- Shafi Goldwasser
- David A. Wagner
- Avrim Blum
- Oded Goldreich
Who trusts Oded Regev overall
- Chris Peikert
- Vadim Lyubashevsky
- Daniele Micciancio
- Zvika Brakerski
- Craig Gentry
- Damien Stehlé
- Vinod Vaikuntanathan
- Hao Chen
- Dan Boneh
- Shai Halevi
Papers from Oded Regev's perspective
Ordered by how strongly the researchers Oded Regev trusts endorse each paper. Same corpus, a different order for every researcher.
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- New lattice based cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- Collision-Free Hashing from Lattice Problems
- On Ideal Lattices and Learning with Errors over Rings
- Fully homomorphic encryption using ideal lattices
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
Their papers
- Worst-case to average-case reductions based on Gaussian measures (2004) — 1,292 citations
- New lattice based cryptographic constructions (2003) — 338 citations
- On Ideal Lattices and Learning with Errors over Rings (2010) — 2,898 citations
- On lattices, learning with errors, random linear codes, and cryptography (2009) — 1,327 citations
- The Complexity of the Local Hamiltonian Problem (2004) — 753 citations
- An optimal lower bound on the communication complexity of gap-hamming-distance (2010) — 189 citations
- Vertex cover might be hard to approximate to within 2-/spl epsiv/ (2003) — 637 citations
- A Toolkit for Ring-LWE Cryptography (2013) — 493 citations
- Classical hardness of learning with errors (2013) — 743 citations
- Lattice Enumeration Using Extreme Pruning (2010) — 313 citations
- Lattice-Based Cryptography (2006) — 367 citations
- On lattices, learning with errors, random linear codes, and cryptography (2005) — 3,832 citations
- Adiabatic quantum computation is equivalent to standard quantum computation (2004) — 964 citations