Novel hierarchical identity-based encryption scheme from lattice

被引：0

作者：

Ye Q. ^{[1
]}

Hu M.-X. ^{[1
]}

Tang Y.-L. ^{[1
]}

Liu K. ^{[1
]}

Yan X.-X. ^{[1
]}

机构：

[1] College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo

来源：

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

基金：

中国国家自然科学基金;

关键词：

Hierarchical identity-based encryption; Lattice; Learning with error; Standard model; Trapdoor delegation;

D O I：

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

中图分类号：

TQ [化学工业];

学科分类号：

0817 ;

摘要：

Aiming at the high complexity in user's private key extraction and large expansion ratio of trapdoor size in previous hierarchical identity-based encryption (HIBE) schemes, a new HIBE scheme was proposed. The implicit extension method to improve preimage sampling algorithm was used, and then combined the improved algorithm with MP12 trapdoor delegation algorithm to construct an efficient HIBE user's private key extraction algorithm. Finally, the new extraction algorithm and the Dual-LWE algorithm was integrated to complete the scheme. Compared with the similar schemes, the efficiency of the proposed scheme was improved in system establishment and user's private key extraction stage, the trapdoor size grows only linearly with the system hierarchical depth, and the improved preimage sample algorithm partly solves the Gaussian parameter increasing problem induced by MP12 trapdoor delegation. The security of the proposed scheme strictly reduces to the hardness of decisional learning with errors problem in the standard model. © 2017, Editorial Board of Journal on Communications. All right reserved.

引用

页码：54 / 64

页数：10

共 23 条

[1]

Gentry C., Silverberg A., Hierarchical id-based cryptography, advances in cryptology, ASIACRYPT 2002, pp. 548-566, (2002)

[2]

Horwitz J., Lynn B., Toward hierarchical identity-based encryption, pp. 466-481, (2002)

[3]

Boneh D., Franklin M., Identity-based encryption from theweil pairing, Advances in Cryptology CRYPTO 2001, pp. 213-229, (2001)

[4]

Lai J., Deng R.H., Liu S., Et al., Identity-based encryption secure against selective opening chosen-ciphertextattack, Advances in Cryptology EUROCRYPT 2012, pp. 77-92, (2012)

[5]

Yamada S., Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters, Advances in Cryptology EUROCRYPT2016, pp. 32-62, (2016)

[6]

Wang F.H., Liu Z.H., Wang C.X., Full secure identity-based encryption scheme with short public key size over lattices in the standard model, The International Journal of Computer Mathematics, 93, 6, pp. 854-863, (2016)

[7]

Regev O., On lattices, learning with errors, random linear codes, and cryptography, The Annual ACM Symposium on Theory of Computing, 56, 6, pp. 84-93, (2009)

[8]

Nguyen P., Zhang J., Zhang Z.F., Simpler efficient group signatures from lattices, Public-Key Cryptography, pp. 401-426, (2015)

[9]

Brakerski Z., Perlman R., Lattice-based fully dynamic multi-key FHE with short ciphertexts, CRYPTO2016, pp. 190-213, (2016)

[10]

Libert B., Ling S., Nguyen K., Et al., Zero-knowledge arguments for lattice-based accumulators, logarithmic-size ring signatures and group signatures without trapdoors, Advances in Cryptology EUROCRYPT 2016, pp. 1-31, (2016)

← 1 2 3 →