Craig Gentry (computer scientist)
Craig Gentry | |
|---|---|
| Citizenship | United States |
| Alma mater |
|
| Known for | Fully Homomorphic Encryption |
| Awards |
|
| Scientific career | |
| Fields | Cryptography, computer science |
| Institutions | IBM Thomas J. Watson Research Center |
| Thesis | A Fully Homomorphic Encryption Scheme[1] (2009) |
| Doctoral advisor | Dan Boneh |
Craig Gentry (b. 1973[2]) is an American computer scientist. He is best known for his work in cryptography, specifically fully homomorphic encryption.[3][2][4][5] In 2009, his dissertation, in which he constructed the first Fully Homomorphic Encryption scheme, won the ACM Doctoral Dissertation Award.[6] In 2010 he won the ACM Grace Murray Hopper Award for the same work.[7] In 2014, he won a MacArthur Fellowship. He is a research scientist at IBM Thomas J. Watson Research Center.[2]
References
- ^ Craig Gentry at the Mathematics Genealogy Project
- ^ a b c 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, retrieved 26 October 2015
- ^ 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.
| Authority control databases: Academics |
|---|
