Bootstrappable homomorphic encryption method, computer program and apparatus
View Patent ↗Embodiments of the present invention describe a fully homomorphic encryption scheme using a “bootstrapable” homomorphic encryption scheme that evaluate a function ƒ when ƒ is the encryption schemes own decryption function. Specifically, the fully homomorphic encryption scheme uses the “bootstrapable” homomorphic encryption scheme to determine the decryption function to decrypt data encrypted under the fully homomorphic encryption scheme.
1. A method, comprising: receiving a plurality of ciphertexts that encrypt information under a public key of a bootstrappable homomorphic encryption scheme; and applying the Evaluate function of the bootstrappable homomorphic encryption scheme to inputs comprising the ciphertexts and a circuit.
2. The method of claim 1 , where the bootstrappable homomorphic encryption scheme is a leveled fully homomorphic encryption scheme.
3. The method of claim 1 , where the bootstrappable homomorphic encryption scheme is a fully homomorphic encryption scheme.
4. A method, comprising: receiving a plurality of ciphertexts that encrypt information under a public key of a homomorphic encryption scheme, where the homomorphic encryption scheme is operable to compactly evaluate the addition of two values and also operable to compactly evaluate a multiplication of two values, where the homomorphic encryption scheme uses public key information and secret key information, and includes an encryption function, a decryption function and an evaluation function, where the secret key information in the homomorphic encryption scheme comprises a secret representation of an algebraic ideal in a ring, where the encryption function takes input comprising first information and outputs second information comprising an element of the ring that is in a coset of the algebraic ideal, where the distribution of coset conditioned on the first information has high minentropy, where the decryption function operates to decrypt data encrypted under the certain public key by using at least the secret representation of the algebraic ideal in the secret key information; and applying the Evaluate function of the homomorphic encryption scheme to inputs comprising the ciphertexts and a circuit.
5. The method of claim 4 , where the homomorphic encryption scheme has a proof of semantic security against CPA attacks.
6. The method of claim 4 , where the homomorphic encryption scheme uses ideal lattices.
7. The method of claim 4 , where the homomorphic encryption scheme uses two relatively prime algebraic ideals.
8. The method of claim 4 , where the encryption scheme is operable to compactly evaluate any boolean circuit of depth logarithmic in the security parameter.
9. A program storage device readable by a machine and tangibly embodying a program of instructions executable by the machine for performing operations comprising: receiving a plurality of ciphertexts that encrypt information under a public key of a bootstrappable homomorphic encryption scheme; and applying the Evaluate function of the bootstrappable homomorphic encryption scheme to inputs comprising the ciphertexts and a circuit.
10. The program storage device of claim 9 , where the bootstrappable homomorphic encryption scheme is a leveled fully homomorphic encryption scheme.
11. The program storage device of claim 9 , where the bootstrappable homomorphic encryption scheme is a fully homomorphic encryption scheme.
12. A program storage device readable by a machine and tangibly embodying a program of instructions executable by the machine for performing operations comprising: receiving a plurality of ciphertexts that encrypt information under a public key of a homomorphic encryption scheme, where the homomorphic encryption scheme is operable to compactly evaluate the addition of two values and also operable to compactly evaluate a multiplication of two values, where the homomorphic encryption scheme uses public key information and secret key information, and includes an encryption function, a decryption function and an evaluation function, where the secret key information in the homomorphic encryption scheme comprises a secret representation of an algebraic ideal in a ring, where the encryption function takes input comprising first information and outputs second information comprising an element of the ring that is in a coset of the algebraic ideal, where the distribution of coset conditioned on the first information has high min-entropy, where the decryption function operates to decrypt data encrypted under the certain public key by using at least the secret representation of the algebraic ideal in the secret key information; and applying the Evaluate function of the homomorphic encryption scheme to inputs comprising the ciphertexts and a circuit.
13. The program storage device of claim 12 , where the homomorphic encryption scheme has a proof of semantic security against CPA attacks.
14. The program storage device of claim 12 , where the homomorphic encryption scheme uses ideal lattices.
15. The program storage device of claim 12 , where the homomorphic encryption scheme uses two relatively prime algebraic ideals.
16. The program storage device of claim 12 , where the encryption scheme is operable to compactly evaluate any boolean circuit of depth logarithmic in the security parameter.