Faster binary arithmetic operations on encrypted integers

CORC > 重庆绿色智能技术研究院 > 中国科学院重庆绿色智能技术研究院 > 自动推理与认知研究中心

	Faster binary arithmetic operations on encrypted integers
	Chen, Jingwei1 ; Feng, Yong1 ; Liu, Yang 2; Wu, Wenyuan1
	2017
会议日期	June 25, 2017 - June 27, 2017
会议地点	No. 38 A, Xueqing Road, Haidian District, Beijing, China
页码	956-960
通讯作者	Liu, Yang (lyl246@qq.com)
英文摘要	Fully homomorphic encryption (FHE) makes a large number of applications available in cloud computing environment. Following Gentry's seminal work, many FHE schemes have been presented. Among known FHE schemes, the Brakerski-Gentry-Vaikuntanathan scheme with corresponding optimizations is one of the most potential candidates for practical use, and has been implemented by Shoup and Halevi in a homomorphic encryption C++ library HElib. Based on HElib, Xu et al. (2016) reported their implementation of binary arithmetic operations over encrypted integers. In this paper, we optimize their implementation further. More specifically, the multi-thread technique is used to accelerate the arithmetic circuits. Moreover, ciphertext slots are fully used in our implementation. As a result, these techniques enable us to evaluate 600 additions of two 64-bit integers simultaneously within 25 seconds, about 0.042 seconds for per-addition time on average.
会议录	2017 7th International Workshop on Computer Science and Engineering, WCSE 2017
语种	英语
内容类型	会议论文
源URL	[http://119.78.100.138/handle/2HOD01W0/4696]
专题	自动推理与认知研究中心
作者单位	1.Chongqing Key Laboratory of Automated Reasoning and Cognition, Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, Chongqing, China; 2.College of Information Science and Engineering, Chongqing Jiaotong University, Chongqing, China
推荐引用方式 GB/T 7714	Chen, Jingwei,Feng, Yong,Liu, Yang,et al. Faster binary arithmetic operations on encrypted integers[C]. 见:. No. 38 A, Xueqing Road, Haidian District, Beijing, China. June 25, 2017 - June 27, 2017.