Database query privacy using homomorphic encryptions

Homomorphic encryption is a novel encryption method for it enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing it's content. In this paper we summarize how SQL queries can be made secure using a homomorphic encryption scheme based on the ideas of Gahi, et al [1]. Gahi's model is based on the DGHV scheme which is a homomorphic encryption scheme which acts on plaintext bits and produce corresponding ciphertext. We use Gahi's blueprint to propose an improved model which is based on the more recent Ring based homomorphic encryption scheme by Braserski, et al [2]. Our method is more general in the sense that it can be extended to use with any fully homomorphic encryption scheme rather than being restricted to the DGHV scheme as in Gahi's method.