| Fully homomorphic encryption using ideal lattices C Gentry Proceedings of the 41st annual ACM symposium on Theory of computing, 169-178, 2009 | 7720* | 2009 |
| Aggregate and verifiably encrypted signatures from bilinear maps D Boneh, C Gentry, B Lynn, H Shacham International conference on the theory and applications of cryptographic …, 2003 | 2185 | 2003 |
| Fully homomorphic encryption over the integers M Van Dijk, C Gentry, S Halevi, V Vaikuntanathan Annual international conference on the theory and applications of …, 2010 | 2097 | 2010 |
| Trapdoors for hard lattices and new cryptographic constructions C Gentry, C Peikert, V Vaikuntanathan Proceedings of the fortieth annual ACM symposium on Theory of computing, 197-206, 2008 | 2062 | 2008 |
| Hierarchical ID-based cryptography C Gentry, A Silverberg International conference on the theory and application of cryptology and …, 2002 | 1557 | 2002 |
| Collusion resistant broadcast encryption with short ciphertexts and private keys D Boneh, C Gentry, B Waters Annual international cryptology conference, 258-275, 2005 | 1256 | 2005 |
| Candidate indistinguishability obfuscation and functional encryption for all circuits S Garg, C Gentry, S Halevi, M Raykova, A Sahai, B Waters SIAM Journal on Computing 45 (3), 882-929, 2016 | 1251 | 2016 |
| Non-interactive verifiable computing: Outsourcing computation to untrusted workers R Gennaro, C Gentry, B Parno Annual Cryptology Conference, 465-482, 2010 | 1214 | 2010 |
| Fully homomorphic encryption without bootstrapping C Gentry | 1159* | 2011 |
| Implementing gentry’s fully-homomorphic encryption scheme C Gentry, S Halevi Annual international conference on the theory and applications of …, 2011 | 1159 | 2011 |
| Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based C Gentry, A Sahai, B Waters Annual Cryptology Conference, 75-92, 2013 | 1153 | 2013 |
| Practical identity-based encryption without random oracles C Gentry Annual international conference on the theory and applications of …, 2006 | 952 | 2006 |
| Pinocchio: Nearly practical verifiable computation B Parno, J Howell, C Gentry, M Raykova 2013 IEEE Symposium on Security and Privacy, 238-252, 2013 | 845 | 2013 |
| Candidate multilinear maps from ideal lattices S Garg, C Gentry, S Halevi Annual International Conference on the Theory and Applications of …, 2013 | 792 | 2013 |
| Homomorphic evaluation of the AES circuit C Gentry, S Halevi, NP Smart Annual Cryptology Conference, 850-867, 2012 | 789 | 2012 |
| Computing arbitrary functions of encrypted data C Gentry Communications of the ACM 53 (3), 97-105, 2010 | 702 | 2010 |
| Certificate-based encryption and the certificate revocation problem C Gentry International Conference on the Theory and Applications of Cryptographic …, 2003 | 691 | 2003 |
| Quadratic span programs and succinct NIZKs without PCPs R Gennaro, C Gentry, B Parno, M Raykova Annual International Conference on the Theory and Applications of …, 2013 | 609 | 2013 |
| Fully homomorphic encryption with polylog overhead C Gentry, S Halevi, NP Smart Annual International Conference on the Theory and Applications of …, 2012 | 549 | 2012 |
| Separating succinct non-interactive arguments from all falsifiable assumptions C Gentry, D Wichs Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 384 | 2011 |
