DocumentCode
3579721
Title
An Encryption Depth Optimization Scheme for Fully Homomorphic Encryption
Author
Liquan Chen ; Hongmei Ben ; Jie Huang
Author_Institution
Sch. of Inf. Sci. & Eng., Southeast Univ., Nanjing, China
fYear
2014
Firstpage
137
Lastpage
141
Abstract
Fully homomorphic encryption scheme over the integers uses integer modular arithmetic and is conceptually simple. However, its efficiency is low and the re-encryption process is complex. According to the depth analysis of the somewhat homomorphic encryption scheme, we propose a re-encryption optimization scheme over the given arbitrary function, which designs a depth threshold value and do function decomposition while the depth value of given function is deeper than the designed depth threshold value. Then, an encryption-depth optimization fully homomorphic encryption (EDO-FHE) scheme is constructed. Based on analysis results, the complexity of the proposed EDO-FHE scheme is far less than the DGHV scheme. It greatly improved the efficiency of the fully homomorphic encryption scheme, while the security is also proved based on the approximate GCD problem.
Keywords
cryptography; optimisation; DGHV scheme; EDO-FHE scheme; approximate GCD problem; arbitrary function; depth analysis; encryption depth optimization scheme; encryption-depth optimization fully homomorphic encryption; fully homomorphic encryption; integer modular arithmetic; reencryption optimization scheme; Approximation algorithms; Encryption; Noise; Polynomials; Public key; Approximate GCD; Fully homomorphic encryption; Re-encryption;
fLanguage
English
Publisher
ieee
Conference_Titel
Identification, Information and Knowledge in the Internet of Things (IIKI), 2014 International Conference on
Type
conf
DOI
10.1109/IIKI.2014.35
Filename
7064015
Link To Document