Attribute-based fully homomorphic encryption scheme over rings

被引：0

作者：

Zheng Y.-H. ^{[1
,2
]}

Kang Y.-J. ^{[3
]}

Gu C.-X. ^{[1
,2
]}

Dong H. ^{[3
]}

机构：

[1] Information Engineering University, Zhengzhou

[2] State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi

[3] 66136 Troop of PLA, Beijing

来源：

Tongxin Xuebao/Journal on Communications | 2017年 / 38卷 / 04期

关键词：

Attribute-based encryption; Fully homomorphic encryption; Recode; RLWE problem;

D O I：

10.11959/j.issn.1000-436x.2017077

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The fully homomorphic encryption has important applications in the area of data security and privacy security of cloud computing, but the size of secret keys and ciphertext in most of current homomorphic encryption schemes were too large, which restricted its practical. To improve these drawbacks, a recoding scheme and a attribute-based encryption scheme based on learning with errors problem over rings were provided, then a attribute-based fully homomorphic encryption was constructed. The new scheme overcame the above mentioned drawbacks, because it did't need public key certificate, meanwhile, it can achieve the fine-grained access control to the ciphertext. Compared with similar results, proposed method decreases the size of keys and ciphertext greatly. © 2017, Editorial Board of Journal on Communications. All right reserved.

引用

页码：55 / 63

页数：8

共 18 条

[1]

Rivest R.L., Adleman L., Dertouzos M.L., On data banks and privacy homomorphisms, Foundations of Secure Computation, 4, 11, pp. 169-180, (1978)

[2]

Gentry C., Fully homomorphic encryption using ideal lattices, STOC, 9, pp. 169-178, (2009)

[3]

Duk M.V., Gentry C., Halevi S., Et al., Fully homomorphic encryption over the integers, The 29th Annual Eurocrypt Conference, pp. 24-43, (2010)

[4]

Smart N.P., Vercauteren F., Fully homomorp-hic encryption with relatively small key and cipher-ext sizes, The 13th International Conference on Practive and Theory in Public Key Cryptography(PKC2010), pp. 420-443, (2010)

[5]

Gentry C., Halevi S., Implementing gentry's fully homomorphic encryption scheme, EUROCRYP-T, Lecture Notes in Computer Science, pp. 129-148, (2011)

[6]

Brakerski Z., Vaikuntanathan V., Efficient fully homomorphic encryption from (standard) LWE, SIAM Journal on Computing, 43, 2, pp. 831-871, (2014)

[7]

Brakerski Z., Vaikuntanathan V., Fully homomorphic encryption from ring-LWE and security for key dependent messages, Advances in Cryptology CRYPTO 2011, pp. 505-524, (2011)

[8]

Regev O., On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM (JACM), 56, 6, (2009)

[9]

Lyubashevsky V., Peikert C., Regev O., On ideal lattices and learning with errors over rings, Journal of the ACM (JACM), 60, 6, (2013)

[10]

Brakerski Z., Gentry C., Vaikuntanathan V., (Leveled) fully homomorphic encryption without bootstrapping, The 3rd Innovations in Theoretical Computer Science Conference, pp. 309-325, (2012)

← 1 2 →