Abstract
We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result -- that, to construct an encryption scheme that permits evaluation of arbitrary circuits, it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable.
Keywords
Homomorphic encryptionEncryptionConstruct (python library)Scheme (mathematics)Computer scienceMultiple encryptionIdeal (ethics)Probabilistic encryptionTheoretical computer scienceElectronic circuitHomomorphic secret sharing40-bit encryptionCryptographyAlgorithmComputer networkMathematicsSecure multi-party computationEngineeringLaw
Affiliated Institutions
Related Publications
Non-interactive cryptocomputing for NC/sup 1/
The area of "computing with encrypted data" has been studied by numerous authors in the past twenty years since it is fundamental to understanding properties of encryption and i...
A Survey on Homomorphic Encryption Schemes
Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns....
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two import...
A New Approach for Algebraically Homomorphic Encryption.
The existence of an efficient and provably secure algebraically homomorphic scheme (AHS), i.e., one that supports both addition and multiplication operations, is a long stated o...
Publication Info
- Year
- 2009
- Type
- article
- Pages
- 169-178
- Citations
- 6229
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
6229
OpenAlex
Cite This
Craig Gentry
(2009).
Fully homomorphic encryption using ideal lattices.
, 169-178.
https://doi.org/10.1145/1536414.1536440
Identifiers
- DOI
- 10.1145/1536414.1536440