Authors:
Michael Brenner
;
Henning Perl
and
Matthew Smith
Affiliation:
Leibniz Universitt Hannover, Germany
Keyword(s):
Homomorphic Encryption, Private Information Retrieval, Encrypted Search.
Related
Ontology
Subjects/Areas/Topics:
Data and Application Security and Privacy
;
Information and Systems Security
;
Network Security
;
Secure Cloud Computing
;
Security in Distributed Systems
;
Sensor and Mobile Ad Hoc Network Security
Abstract:
Homomorphic cryptography has been one of the most interesting topics of mathematics and computer security since Gentry presented the first construction of a fully homomorphic encryption (FHE) scheme in 2009. Since then, a number of different schemes have been found, that follow the approach of bootstrapping a fully homomorphic scheme from a somewhat homomorphic foundation. All existing implementations of these systems clearly proved, that fully homomorphic encryption is not yet practical, due to significant performance limitations. However, there are many applications in the area of secure methods for cloud computing, distributed computing and delegation of computation in general, that can be implemented with homomorphic encryption schemes of limited depth. We discuss a simple algebraically homomorphic scheme over the integers that is based on the factorization of an approximate semiprime integer. We analyze the properties of the scheme and provide a couple of known protocols that ca
n be implemented with it. We also provide a detailed discussion on searching with encrypted search terms and present implementations and performance figures for the solutions
discussed in this paper.
(More)