Efficient homomorphic encryption on integer vectors and its applications
- 1 February 2014
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2014 Information Theory and Applications Workshop (ITA)
Abstract
Homomorphic encryption, aimed at enabling computation in the encrypted domain, is becoming important to a wide and growing range of applications, from cloud computing to distributed sensing. In recent years, a number of approaches to fully (or nearly fully) homomorphic encryption have been proposed, but to date the space and time complexity of the associated schemes has precluded their use in practice. In this work, we demonstrate that more practical homomorphic encryption schemes are possible when we require that not all encrypted computations be supported, but rather only those of interest to the target application. More specifically, we develop a homomorphic encryption scheme operating directly on integer vectors that supports three operations of fundamental interest in signal processing applications: addition, linear transformation, and weighted inner products. Moreover, when used in combination, these primitives allow us to efficiently and securely compute arbitrary polynomials. Some practically relevant examples of the computations supported by this framework are described, including feature extraction, recognition, classification, and data aggregation.Keywords
This publication has 13 references indexed in Scilit:
- Recent Advances in Homomorphic Encryption: A Possible Future for Signal Processing in the Encrypted DomainIEEE Signal Processing Magazine, 2013
- Batch Fully Homomorphic Encryption over the IntegersLecture Notes in Computer Science, 2013
- Encrypted signal processing for privacy protection: Conveying the utility of homomorphic encryption and multiparty computationIEEE Signal Processing Magazine, 2012
- Can homomorphic encryption be practical?Published by Association for Computing Machinery (ACM) ,2011
- Efficient Fully Homomorphic Encryption from (Standard) LWEPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Fully Homomorphic Encryption over the Integers with Shorter Public KeysLecture Notes in Computer Science, 2011
- A Simple BGN-Type Cryptosystem from LWELecture Notes in Computer Science, 2010
- Fully Homomorphic Encryption over the IntegersLecture Notes in Computer Science, 2010
- Secure aggregation in hybrid mesh/sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Probabilistic encryption & how to play mental poker keeping secret all partial informationPublished by Association for Computing Machinery (ACM) ,1982