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: | , , , , |
|---|---|
| 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!
|
| Summary: | 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. An identity-based fully homomorphic en-cryption scheme was presented. The scheme compromises the merits of both identity-based and fully homomorphic en-cryption schemes, and it overcomes the above mentioned flaw. The security of the proposed scheme reduces to the hard-ness of learning with errors problem and the one-wayness of trapdoor function in the random oracle model. |
|---|---|
| ISSN: | 1000-436X |