Efficient identity-based fully homomorphic encryption over NTRU
Fully homomorphic encryption is the best solution for solving privacy concerns for data over cloud so far,while large public key size is a general shortcoming for existing schemes.First,by introducing the concept of Kullback-Leibler divergence,an identity-based public key scheme over NTRU lattice wi...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2017-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017008/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539485940056064 |
|---|---|
| author | Ran DUAN Chun-xiang GU Yue-fei ZHU Yong-hui ZHENG Li CHEN |
| author_facet | Ran DUAN Chun-xiang GU Yue-fei ZHU Yong-hui ZHENG Li CHEN |
| author_sort | Ran DUAN |
| collection | DOAJ |
| description | Fully homomorphic encryption is the best solution for solving privacy concerns for data over cloud so far,while large public key size is a general shortcoming for existing schemes.First,by introducing the concept of Kullback-Leibler divergence,an identity-based public key scheme over NTRU lattice with modified ciphertext form was proposed.Analysis on parameter setting showed its small key size and ciphertext size,and experiments revealed its high computational efficiency.Second,with the idea of approximate eigenvector,an improved method to convert the scheme into an identity-based fully homomorphic encryption one was put forward to further reduce ciphertext size.Compared with existing schemes,the converted scheme not only abandons evaluation keys to make it fully identity-based,but also has smaller keys and ciphertext,which results in higher computational and transmission efficiency. |
| format | Article |
| id | doaj-art-27550a6b7106459eb45fa7f5c7a9cdfd |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2017-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-27550a6b7106459eb45fa7f5c7a9cdfd2025-01-14T07:11:26ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2017-01-0138667559706607Efficient identity-based fully homomorphic encryption over NTRURan DUANChun-xiang GUYue-fei ZHUYong-hui ZHENGLi CHENFully homomorphic encryption is the best solution for solving privacy concerns for data over cloud so far,while large public key size is a general shortcoming for existing schemes.First,by introducing the concept of Kullback-Leibler divergence,an identity-based public key scheme over NTRU lattice with modified ciphertext form was proposed.Analysis on parameter setting showed its small key size and ciphertext size,and experiments revealed its high computational efficiency.Second,with the idea of approximate eigenvector,an improved method to convert the scheme into an identity-based fully homomorphic encryption one was put forward to further reduce ciphertext size.Compared with existing schemes,the converted scheme not only abandons evaluation keys to make it fully identity-based,but also has smaller keys and ciphertext,which results in higher computational and transmission efficiency.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017008/fully homomorphic encryptionidentity-based encryptionNTRU latticerandom oracle modelapproximate eigenvector |
| spellingShingle | Ran DUAN Chun-xiang GU Yue-fei ZHU Yong-hui ZHENG Li CHEN Efficient identity-based fully homomorphic encryption over NTRU Tongxin xuebao fully homomorphic encryption identity-based encryption NTRU lattice random oracle model approximate eigenvector |
| title | Efficient identity-based fully homomorphic encryption over NTRU |
| title_full | Efficient identity-based fully homomorphic encryption over NTRU |
| title_fullStr | Efficient identity-based fully homomorphic encryption over NTRU |
| title_full_unstemmed | Efficient identity-based fully homomorphic encryption over NTRU |
| title_short | Efficient identity-based fully homomorphic encryption over NTRU |
| title_sort | efficient identity based fully homomorphic encryption over ntru |
| topic | fully homomorphic encryption identity-based encryption NTRU lattice random oracle model approximate eigenvector |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017008/ |
| work_keys_str_mv | AT randuan efficientidentitybasedfullyhomomorphicencryptionoverntru AT chunxianggu efficientidentitybasedfullyhomomorphicencryptionoverntru AT yuefeizhu efficientidentitybasedfullyhomomorphicencryptionoverntru AT yonghuizheng efficientidentitybasedfullyhomomorphicencryptionoverntru AT lichen efficientidentitybasedfullyhomomorphicencryptionoverntru |