Name
Abstract | ||
|---|---|---|
Based on the public key compressing technique and the Chinese Remainder Theorem, an efficient somewhat homomorphic encryption (SWHE) scheme is proposed, whose security can be reduced to the approximate greatest common divisor problem. Then the fully homomorphic encryption scheme is obtained by using Gentry's squashing decryption circuit technique, which could resist chosen plaintext attacks. The efficiency analysis shows that our SWHE scheme's public key size and ciphertext size are reduced compared to DGHV scheme. And the simulation results show that the multiplication of the proposed SWHE scheme is much more efficient than that of DGHV scheme. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/CCIS.2016.7790295 | 2016 4th International Conference on Cloud Computing and Intelligence Systems (CCIS) |
Keywords | Field | DocType |
fully homomorphic encryption,somewhat homomorphic encryption,approximate greatest common divisor,Chinese Remainder Theorem | Homomorphic encryption,Chinese remainder theorem,Computer science,Arithmetic,Theoretical computer science,Greatest common divisor,Probabilistic encryption,Ciphertext,Homomorphic secret sharing,Public-key cryptography,Plaintext,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-5090-1257-2 | 0 | 0.34 |
References | Authors | |
1 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peng Zhang | 1 | 38 | 7.06 |
| Xiaoqiang Sun | 2 | 0 | 0.34 |
| Ting Wang | 3 | 36 | 9.43 |
| Sizhu Gu | 4 | 0 | 0.34 |
| Jianping Yu | 5 | 158 | 8.25 |
| Weixin Xie | 6 | 651 | 62.35 |