Craig Gentry
Artificial Intelligence · 2002–2019
A researcher in the Science corpus: 29 papers; trusts 115 researchers and is trusted by 723 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 354 citations into it; #870 of 36,961 by trust here, #530 by citations
- Computational Theory and Mathematics — 211 citations into it; #7 of 12,489 by trust here, #19 by citations
- Information Systems — 120 citations into it; #35 of 9,233 by trust here, #93 by citations
- Computer Networks and Communications — 62 citations into it; #67 of 9,996 by trust here, #244 by citations
- Privacy & Security — 58 citations into it; #5 of 710 by trust here, #7 by citations
- Computer Vision and Pattern Recognition — 48 citations into it; #3,551 of 21,973 by trust here, #3,281 by citations
- Algorithms & Complexity — 16 citations into it
Whom Craig Gentry trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Zvika Brakerski
- Oded Regev
- Brent Waters
- Chris Peikert
- Vinod Vaikuntanathan
- Daniele Micciancio
- Shai Halevi
- Vadim Lyubashevsky
- Nigel P. Smart
Who trusts Craig Gentry overall
- Shai Halevi
- Brent Waters
- Hao Chen
- Dan Boneh
- Allison Bishop
- Zvika Brakerski
- Yarkin Doröz
- Wei Wang
- Vinod Vaikuntanathan
- Xavier Boyen
Papers from Craig Gentry's perspective
Ordered by how strongly the researchers Craig Gentry trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Fully homomorphic encryption using ideal lattices
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- New Directions in Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Probabilistic Encryption
- Public Key Encryption with Keyword Search (International Conference on the Theory and Application of Cryptographic Techniques)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A method for obtaining digital signatures and public-key cryptosystems
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- Fully homomorphic encryption using ideal lattices (2009) — 7,168 citations
- Trapdoors for hard lattices and new cryptographic constructions (2008) — 2,665 citations
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (2014) — 3,339 citations
- Computing arbitrary functions of encrypted data (2010) — 693 citations
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (2013) — 1,661 citations
- Practical Identity-Based Encryption Without Random Oracles (2006) — 845 citations
- Candidate Multilinear Maps from Ideal Lattices (2013) — 756 citations
- Witness encryption and its applications (2013) — 362 citations
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (2005) — 1,140 citations
- Separating succinct non-interactive arguments from all falsifiable assumptions (2011) — 531 citations
- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps (2003) — 2,058 citations
- Quadratic Span Programs and Succinct NIZKs without PCPs (2013) — 917 citations
- Single-Database Private Information Retrieval with Constant Communication Rate (2005) — 382 citations
- Certificate-Based Encryption and the Certificate Revocation Problem (2003) — 554 citations
- Identity-Based Aggregate Signatures (2006) — 306 citations
- Compressible FHE with Applications to PIR (2019) — 114 citations
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (2014) — 477 citations
- Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013) — 1,329 citations
- Packed Ciphertexts in LWE-Based Homomorphic Encryption (2013) — 224 citations
- Pinocchio: Nearly Practical Verifiable Computation (2013) — 1,238 citations