|Born||1973 (age 49–50)|
|Known for||Fully-homomorphic encryption|
|Education||Duke University (BS)|
Harvard University (JD)
Stanford University (PhD)
|Thesis||A Fully Homomorphic Encryption Scheme (2009)|
|Doctoral advisor||Dan Boneh|
|Discipline||Cryptography, computer science|
|Institutions||IBM Thomas J. Watson Research Center, Algorand Foundation|
In 1993, while studying at Duke University, he became a Putnam Fellow. In 2009, his dissertation, in which he constructed the first Fully Homomorphic Encryption scheme, won the ACM Doctoral Dissertation Award.
In 2010, he won the ACM Grace Murray Hopper Award for the same work. In 2014, he won a MacArthur Fellowship. Previously, he was a research scientist at the Algorand Foundation and IBM Thomas J. Watson Research Center.
- Craig Gentry at the Mathematics Genealogy Project
- MacArthur Foundation (17 September 2014). "Craig Gentry". MacArthur Foundation. Retrieved 12 March 2015.
- Craig Gentry. Fully Homomorphic Encryption Using Ideal Lattices. In the 41st ACM Symposium on Theory of Computing (STOC), 2009.
- Greenberg, Andy (3 November 2014), "Hacker Lexicon: What is Homomorphic Encryption?", Wired, retrieved 26 October 2015
- Hayden, Erika (23 March 2015), "Extreme cryptography paves way to personalized medicine", Nature, vol. 519, no. 7544, pp. 400–1, Bibcode:2015Natur.519..400C, doi:10.1038/519400a, PMID 25810184, retrieved 26 October 2015
- "Putnam Competition Individual and Team Winners". Mathematical Association of America. Retrieved December 14, 2021.
- Gold, Virginia (16 June 2010). "Doctoral Candidate Developed Scheme that Could Spur Advances in Cloud Computing, Search Engine Queries, and E-Commerce" (Press release). New York. The Association for Computing Machinery. Archived from the original on 9 January 2016. Retrieved 2015-10-26.
- "Craig Gentry". Retrieved 26 October 2015.