| Fully homomorphic encryption using ideal lattices C Gentry Proceedings of the 41st annual ACM symposium on Theory of computing, 169-178, 2009 | 9397* | 2009 |
| 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 | 2488 | 2008 |
| Aggregate and verifiably encrypted signatures from bilinear maps D Boneh, C Gentry, B Lynn, H Shacham Advances in Cryptology—EUROCRYPT 2003: International Conference on the …, 2003 | 2443 | 2003 |
| Fully homomorphic encryption over the integers M Van Dijk, C Gentry, S Halevi, V Vaikuntanathan Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010 | 2361 | 2010 |
| Hierarchical ID-based cryptography C Gentry, A Silverberg Advances in Cryptology—ASIACRYPT 2002: 8th International Conference on the …, 2002 | 1656 | 2002 |
| Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based C Gentry, A Sahai, B Waters Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013 | 1552 | 2013 |
| Fully homomorphic encryption without bootstrapping C Gentry | 1493* | 2011 |
| 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 | 1437 | 2016 |
| Collusion resistant broadcast encryption with short ciphertexts and private keys D Boneh, C Gentry, B Waters Advances in Cryptology–CRYPTO 2005: 25th Annual International Cryptology …, 2005 | 1369 | 2005 |
| Non-interactive verifiable computing: Outsourcing computation to untrusted workers R Gennaro, C Gentry, B Parno Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010 | 1353 | 2010 |
| Implementing gentry’s fully-homomorphic encryption scheme C Gentry, S Halevi Advances in Cryptology–EUROCRYPT 2011: 30th Annual International Conference …, 2011 | 1296 | 2011 |
| Pinocchio: Nearly practical verifiable computation B Parno, J Howell, C Gentry, M Raykova Communications of the ACM 59 (2), 103-112, 2016 | 1138 | 2016 |
| Practical identity-based encryption without random oracles C Gentry Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference …, 2006 | 1015 | 2006 |
| Homomorphic evaluation of the AES circuit C Gentry, S Halevi, NP Smart Advances in Cryptology–CRYPTO 2012: 32nd Annual Cryptology Conference, Santa …, 2012 | 943 | 2012 |
| Candidate multilinear maps from ideal lattices S Garg, C Gentry, S Halevi Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013 | 856 | 2013 |
| Quadratic span programs and succinct NIZKs without PCPs R Gennaro, C Gentry, B Parno, M Raykova Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013 | 831 | 2013 |
| Computing arbitrary functions of encrypted data C Gentry Communications of the ACM 53 (3), 97-105, 2010 | 794 | 2010 |
| Certificate-based encryption and the certificate revocation problem C Gentry Eurocrypt 2656, 272-293, 2003 | 733 | 2003 |
| Fully homomorphic encryption with polylog overhead. C Gentry, S Halevi, NP Smart Eurocrypt 7237, 465-482, 2012 | 629 | 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 | 475 | 2011 |
