DocumentCode :
3028253
Title :
A fast additively symmetric homomorphic encryption scheme for vector data
Author :
Ningduo Peng ; Guangchun Luo ; Ke Qin ; Aiguo Chen
Author_Institution :
Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fYear :
2013
fDate :
20-22 Dec. 2013
Firstpage :
2586
Lastpage :
2589
Abstract :
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.
Keywords :
cryptography; XOR operation; bit strings; encrypted data; fast additively symmetric homomorphic encryption scheme; plaintexts; relational table; vector data; Computers; Encryption; Servers; Symmetric matrices; Vectors; additive homomorphism; homomorphic encryption; symmetric encryption; vector encryption;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic Sciences, Electric Engineering and Computer (MEC), Proceedings 2013 International Conference on
Conference_Location :
Shengyang
Print_ISBN :
978-1-4799-2564-3
Type :
conf
DOI :
10.1109/MEC.2013.6885469
Filename :
6885469
Link To Document :
بازگشت