Identity-based fully homomorphic encryption from learning with error problem
The fully homomorphic encryption schemes based on learning with errors problem own a great potential value in the cloud computing security. However, the existing schemes share a common flaw of large sized public keys, which may cause inefficiency of such schemes in the key and identity management. A...
Saved in:
Main Authors: | Yan GUANG, Yue-fei ZHU, Jin-long FEI, Chun-xiang GU, Yong-hui ZHENG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2014-02-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.02.015/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Efficient identity-based fully homomorphic encryption over NTRU
by: Ran DUAN, et al.
Published: (2017-01-01) -
A Compact Multi-Identity Fully Homomorphic Encryption Scheme Without Fresh Ciphertexts
by: Ziwei Wang, et al.
Published: (2025-01-01) -
Attribute-based fully homomorphic encryption scheme over rings
by: Yong-hui ZHENG, et al.
Published: (2017-04-01) -
Novel identity-based fully homomorphic encryption scheme from lattice
by: Yong-li TANG, et al.
Published: (2017-05-01) -
NTRU-type fully homomorphic encryption scheme without key switching
by: Xin-xia SONG, et al.
Published: (2017-01-01)