Homomorphic Encryption: Theory & Applications

Partially Homomorphic Encryption Schemes over Finite Fields

Homomorphic encryption scheme enables computation in the encrypted domain, which is of great importance because of its wide and growing range of applications. The main issue with the known fully (or partially) homomorphic encryption schemes is the high computational complexity and large communication cost required for their execution. In this work, we study symmetric partially homomorphic encry...

Introduction to Homomorphic Encryption

Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...

Multi-integer Somewhat Homomorphic Encryption Scheme with China Remainder Theorem

As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their high computational complexity and huge key size. In 2013, Coron et al. proposed a batch homomorphic encryption scheme, i.e. a scheme that supports encrypting and homomorphically evaluating several plaintext bits as...

Enhanced Flexibility for Homomorphic Encryption Schemes via CRT

The Chinese Remainder Theorem (CRT) has numerous applications including in cryptography. In a striking example of this utility, we demonstrate how the CRT facilitates making one additive homomorphic encryption scheme viable and making another more flexible. First we show that the CRT may be used to turn an intractable problem into a tractable one. Specifically, using the CRT to replace a single...

KV Web Security: Applications of Homomorphic Encryption

Efficient Integer Vector Homomorphic Encryption

Homomorphic Encryption yields deliberately malleable ciphertext, allowing operations on encrypted data. We outline and implement a homomorphic encryption scheme as suggested by Zhou and Wornell [1] that encrypts integer vectors to allow computation of arbitrary polynomials in the encrypted domain with a bounded degree. This finds applications particularly in cloud computation, when one is inter...