Jacob Alperin-Sheriff
Artificial Intelligence · 2014
A researcher in the Science corpus: 1 paper; trusts 9 researchers and is trusted by 12 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 11 citations into it; #11,545 of 35,345 by trust here, #24,417 by citations
- Computational Theory and Mathematics — 9 citations into it; #3,299 of 12,182 by trust here, #6,463 by citations
Whom Jacob Alperin-Sheriff trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Zvika Brakerski
- Chris Peikert
- Vinod Vaikuntanathan
- Oded Regev
- Vadim Lyubashevsky
- Amit Sahai
- Daniele Micciancio
- Brent Waters
- Dan Boneh
Who trusts Jacob Alperin-Sheriff overall
- Shai Halevi
- Ilaria Chillotti
- Alhassan F. Khedr
- Abbas Acar
- Nicolas Gama
- A. Al Badawi
- Glenn Gulak
- Hidayet Aksu
- Mariya Georgieva
- Vinod Vaikuntanathan
Papers from Jacob Alperin-Sheriff's perspective
Ordered by how strongly the researchers Jacob Alperin-Sheriff trusts endorse each paper. Same corpus, a different order for every researcher.
- On lattices, learning with errors, random linear codes, and cryptography
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
- On Ideal Lattices and Learning with Errors over Rings
- A fully homomorphic encryption scheme
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Collision-Free Hashing from Lattice Problems
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully homomorphic encryption using ideal lattices
Their papers
- Faster Bootstrapping with Polynomial Error (2014) — 322 citations