Craig Gentry (computer scientist)
From Wikipedia, the free encyclopedia
| Craig Gentry | |
|---|---|
| Residence | Berkeley, California, United States |
| Citizenship | United States |
| Fields | Cryptography, computer science |
| Institutions | IBM Thomas J. Watson Research Center |
| Alma mater | Duke University B.S. (1995), J.D. Harvard Law School (1998), and Ph.D. Stanford University (2009) |
| Doctoral advisor | Dan Boneh |
| Known for | Fully Homomorphic Encryption |
| Notable awards | MacArthur Fellowship (2014), Grace Murray Hopper Award (2010) |
Craig Gentry (b. 1972/73[1]) is an American computer scientist. He is best known for his work in cryptography, specifically fully homomorphic encryption.[2][1][3][4] In 2009, his dissertation, in which he constructed the first Fully Homomorphic Encryption scheme, won the ACM Doctoral Dissertation Award.[5] In 2010 he won the ACM Grace Murray Hopper Award for the same work.[6] In 2014, he won a MacArthur Fellowship. He is a research scientist at IBM's Thomas J. Watson Research Center.[1]
References[edit]
- ^ 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. Retrieved 2015-10-26.
- ^ "Craig Gentry". Retrieved 26 October 2015.
| P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
