A fast additively symmetric homomorphic encryption scheme for vector data

Homomorphic encryption scheme enables direct operations over the encrypted data without decryption. We propose a fast homomorphic encryption scheme for vector data. In the scheme, vector data are transformed to specific bit strings such that addition of two plaintexts could be completed by just a simple XOR operation over the corresponding ciphertexts. Experiments show that the new scheme is about 30% faster than the current fastest homomorphic encryption scheme. In comparison with the prior works, the new scheme is more suitable for dealing with a large number of encrypted data in relational table.