Craig Gentry (computer scientist)

Craig Gentry
Craig Gentry
Born	1973 (age 50–51)
Known for	Fully-homomorphic encryption
Awards	ACM Doctoral Dissertation Award (2009); MacArthur Fellowship (2014); Grace Murray Hopper Award (2010); Gödel Prize (2022);
Academic background
Education	Duke University (BS); Harvard University (JD); Stanford University (PhD)
Thesis	A Fully Homomorphic Encryption Scheme (2009)
Doctoral advisor	Dan Boneh
Academic work
Discipline	Cryptography, computer science
Institutions	IBM Thomas J. Watson Research Center, Algorand Foundation

Craig Gentry (born 1973)^[2] is an American computer scientist working as CTO of TripleBlind. He is best known for his work in cryptography, specifically fully homomorphic encryption.^[3]^[2]^[4]^[5]

Education

In 1993, while studying at Duke University, he became a Putnam Fellow.^[6] In 2009, his dissertation, in which he constructed the first Fully Homomorphic Encryption scheme, won the ACM Doctoral Dissertation Award.^[7]

Career

In 2010, he won the ACM Grace Murray Hopper Award for the same work.^[8] In 2014, he won a MacArthur Fellowship. Previously, he was a research scientist at the Algorand Foundation and IBM Thomas J. Watson Research Center.^[2] In 2022, he won the Gödel Prize with Zvika Brakerski and Vinod Vaikuntanathan.^[9]

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, 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.
^ "2022 Gödel Prize Citation". ACM Special Interest Group on Algorithms and Computation Theory. Association for Computing Machinery.

P ≟ NP

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

[1] Craig Gentry at the Mathematics Genealogy Project

[mf-2] MacArthur Foundation (17 September 2014). "Craig Gentry". MacArthur Foundation. Retrieved 12 March 2015.

[stoc-3] Craig Gentry. Fully Homomorphic Encryption Using Ideal Lattices. In the 41st ACM Symposium on Theory of Computing (STOC), 2009.

[wired-4] Greenberg, Andy (3 November 2014), "Hacker Lexicon: What is Homomorphic Encryption?", Wired, retrieved 26 October 2015

[nature-5] 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

[MMA-6] "Putnam Competition Individual and Team Winners". Mathematical Association of America. Retrieved December 14, 2021.

[7] 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.

[8] "Craig Gentry". Retrieved 26 October 2015.

[9] "2022 Gödel Prize Citation". ACM Special Interest Group on Algorithms and Computation Theory. Association for Computing Machinery.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]