Computing arbitrary functions of encrypted data
Top Cited Papers
- 1 March 2010
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 53 (3), 97-105
- https://doi.org/10.1145/1666420.1666444
Abstract
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorphic" encryption scheme that keeps data private, but that allows a worker that does not have the secret decryption key to compute any (still encrypted) result of the data, even when the function of the data is very complex. In short, a third party can perform complicated processing of data without being able to see it. Among other things, this helps make cloud computing compatible with privacy.Keywords
This publication has 4 references indexed in Scilit:
- Fully homomorphic encryption using ideal latticesPublished by Association for Computing Machinery (ACM) ,2009
- Quantum Algorithms for Some Hidden Shift ProblemsSIAM Journal on Computing, 2006
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978