Craig Gentry
Fully homomorphic encryption addresses the problem of computing on protected data without first revealing it. Gentry's 2009 construction made this goal a practical research direction rather than only a theoretical aspiration.
Craig Gentry is a cryptographer known for work on fully homomorphic encryption (FHE), a technique for performing computations on encrypted data.
A 2009 breakthrough
IBM Research identifies Gentry's 2009 scheme as the first plausible fully homomorphic encryption scheme. It addressed a longstanding obstacle: the accumulation of noise during encrypted computation.
Applications and limits
FHE has motivated research on privacy-preserving cloud computation, data analysis, and machine learning. Its deployment requires careful attention to performance, parameters, and threat models.
Security legacy
Gentry's work helped establish encrypted computation as an active technical field and informed subsequent work on practical FHE schemes.
Timeline
- 2009Introduces a plausible fully homomorphic encryption scheme while at IBM Research.
- 2010Receives the ACM Doctoral Dissertation Award for the work, as recorded by IBM.
- 2023RSAC Conference lists him as CTO of TripleBlind and a pioneer of FHE.
Craig Gentry
- Type
- Person
- Era
- 2000s-Present
- Known for
- Fully homomorphic encryption; Encrypted computation; Privacy-preserving cryptography
- Tags
- cryptography, fully-homomorphic-encryption, privacy, encrypted-computation, research
Created by Joas A Santos · Something wrong or want it removed? Open an issue.