DocumentCode :
3612645
Title :
Properties of gsw and their applications
Author :
Yang Xiaoyuan ; Zhou Tanping ; Zhang Wei ; Tan Zhenlin
Author_Institution :
Electron. Dept., Chinese People´s Armed Police, Xi´an, China
Volume :
12
Issue :
11
fYear :
2015
fDate :
11/1/2015 12:00:00 AM
Firstpage :
1
Lastpage :
8
Abstract :
In CRYPTO´13, Gentry et al. proposed a fully homomorphic encryption scheme, called GSW. We find that the scheme has three special properties, which are not sufficiently recognized and applied in current literatures. Property 1: Noise grows asymmetrically in multiplication. Property 2: Small noise in MultConst(C, α) . Property 3: Fixed noise bound when α is a power of 2 in MultConst(C, α) . We made use of property 1 to the Yi´s private searching on streaming data protocol, called YBVX. Compared with YBVX, the four mainly aspects of efficiency in our protocol had been improved, the computation complexity of the sever decreased from O(ml2 + μ)multi. + O(ml2 + μ)add.+O(μd)enc. +O(μ)ADD. t o O(m +μ)multi. + O(m +μ)add.+ O(μd)enc.+O(μ) ADD; the space complexity decreased from O(ml2 + μd) to O(m + μd) ; the communication complexity decreased from O(ml)+O(d|D|k) to O(m)+O(d|D|k) ; the computation complexity of the client decreased from O(ml)dec.+O(d | D |) enc to O(m)dec.+ O(d | D |)enc. what´s more, the above three properties can have a variety of applications, ranging from improving the property of cryptographic prototypes to protocol building.
Keywords :
cryptographic protocols; CRYPTO´13; GSW; communication complexity; computation complexity; cryptographic prototypes; homomorphic encryption scheme; protocol building; space complexity; streaming data protocol; Complexity theory; Dictionaries; Encryption; Protocols; Search problems;
fLanguage :
English
Journal_Title :
Communications, China
Publisher :
ieee
ISSN :
1673-5447
Type :
jour
DOI :
10.1109/CC.2015.7366238
Filename :
7366238
Link To Document :
بازگشت