Zvika Brakerski
Artificial Intelligence · 2011–2014
A researcher in the Science corpus: 9 papers; trusts 27 researchers and is trusted by 218 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 122 citations into it; #983 of 35,345 by trust here, #2,006 by citations
- Computational Theory and Mathematics — 76 citations into it; #38 of 12,182 by trust here, #114 by citations
- Computer Vision and Pattern Recognition — 26 citations into it
- Privacy & Security — 21 citations into it; #13 of 709 by trust here, #39 by citations
- Information Systems — 16 citations into it; #381 of 8,771 by trust here, #614 by citations
- Computer Networks and Communications — 12 citations into it
- Mathematical Optimization — 8 citations into it
Whom Zvika Brakerski trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Chris Peikert
- Oded Regev
- Daniele Micciancio
- Vinod Vaikuntanathan
- Vadim Lyubashevsky
- Dan Boneh
- Shai Halevi
- Marten van Dijk
- Christian Cachin
Who trusts Zvika Brakerski overall
- Shai Halevi
- Hao Chen
- Craig Gentry
- Vinod Vaikuntanathan
- Kim Laine
- Ilaria Chillotti
- Jean-Sébastien Coron
- Kristin E. Lauter
- Wei Dai
- Abbas Acar
Papers from Zvika Brakerski's perspective
Ordered by how strongly the researchers Zvika Brakerski trusts endorse each paper. Same corpus, a different order for every researcher.
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- On Ideal Lattices and Learning with Errors over Rings
- Collision-Free Hashing from Lattice Problems
- New lattice based cryptographic constructions
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- A fully homomorphic encryption scheme
- Random oracles are practical: a paradigm for designing efficient protocols
Their papers
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (2014) — 3,339 citations
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages (2011) — 1,202 citations
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP (2012) — 1,387 citations
- Efficient Fully Homomorphic Encryption from (Standard) LWE (2011) — 1,878 citations
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ (2014) — 344 citations
- Lattice-based FHE as secure as PKE (2014) — 300 citations
- Packed Ciphertexts in LWE-Based Homomorphic Encryption (2013) — 224 citations
- Classical hardness of learning with errors (2013) — 743 citations
- (Leveled) fully homomorphic encryption without bootstrapping (2012) — 177 citations