Novel hierarchical identity-based encryption scheme from lattice

Qing YE; Ming-xing HU; Yong-li TANG; Kun LIU; Xi-xi YAN

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

您当前的位置：

首页 >

文章列表页 >

Novel hierarchical identity-based encryption scheme from lattice

Papers | 更新时间：2024-06-05

- Novel hierarchical identity-based encryption scheme from lattice
- Journal on Communications Vol. 38, Issue 11, Pages: 54-64(2017)
- 作者机构：
  
  河南理工大学计算机科学与技术学院，河南焦作 454000
- 作者简介：
- 基金信息：
  
  The “13th Five-Year” National Crypto Development Foundation(MMJJ20170122);The National Natural Science Foundation of China(61300216);The Project of Science and Technology Department of Henan Province(142300410147);The Project of Education Department of Henan Province(18A413001);Foundation of Henan Educational Committee(16A520013);Doctoral Fund of Henan Polytechnic University(B2014-044);Doctoral Fund of Henan Polytechnic University(B2016-36)
- DOI：10.11959/j.issn.1000-436x.2017219
  CLC： TP309
- Online First：2017-11，
  
  Published：25 November 2017
- 稿件说明：
移动端阅览
Qing YE, Ming-xing HU, Yong-li TANG, et al. Novel hierarchical identity-based encryption scheme from lattice[J]. Journal on Communications, 2017, 38(11): 54-64.
DOI：

Qing YE, Ming-xing HU, Yong-li TANG, et al. Novel hierarchical identity-based encryption scheme from lattice[J]. Journal on Communications, 2017, 38(11): 54-64. DOI： 10.11959/j.issn.1000-436x.2017219.

摘要

针对格上基于身份的分级加密（HIBE

hierarchical identity-based encryption）体制中用户密钥提取算法复杂度过高和陷门尺寸膨胀率大的问题，提出一种新的HIBE方案。首先，利用隐式扩展法对HIBE方案中的原像采样算法优化，然后，结合MP12陷门派生算法提出一种高效的HIBE用户密钥提取算法，并基于该算法结合对偶 LWE 算法完成 HIBE 方案构造。对比分析表明，所提方案的效率较同类方案在系统建立和用户密钥提取阶段均有提升，陷门尺寸与系统分级深度仅成线性增长关系，且优化后的原像采样算法一定程度上可解决MP12陷门派生算法在陷门派生后高斯参数增长的问题。在标准模型下，方案安全性归约至判定性 LWE 问题的难解性，并包含严格的安全性证明。

Abstract

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.

关键词

Keywords

references

GENTRY C , SILVERBERG A . Hierarchical id-based cryptography,advances in cryptology [C ] // ASIACRYPT 2002 . 2002 : 548 - 566 .

HORWITZ J , LYNN B . Toward hierarchical identity-based encryption [C ] // EUROCRYPT . 2002 : 466 - 481 .

BONEH D , FRANKLIN M . Identity-based encryption from theweil pairing [C ] // Advances in Cryptology CRYPTO 2001 . 2001 : 213 - 229 .

LAI J , DENG R H , LIU S , et al . Identity-based encryption secure against selective opening chosen-ciphertextattack [C ] // Advances in Cryptology EUROCRYPT 2012 . 2012 : 77 - 92 .

YAMADA S , . Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters [C ] // Advances in Cryptology EUROCRYPT2016 . 2016 : 32 - 62 .

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 [J ] . The International Journal of Computer Mathematics , 2016 , 93 ( 6 ): 854 - 863 .

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

NGUYEN P , ZHANG J , ZHANG Z F . Simpler efficient group signatures from lattices [C ] // Public-Key Cryptography . 2015 : 401 - 426 .

BRAKERSKI Z , PERLMAN R . Lattice-based fully dynamic multi-key FHE with short ciphertexts [C ] // CRYPTO2016 . 2016 : 190 - 213 .

LIBERT B , LING S , NGUYEN K , et al . Zero-knowledge arguments for lattice-based accumulators,logarithmic-size ring signatures and group signatures without trapdoors [C ] // Advances in Cryptology EUROCRYPT 2016 . 2016 : 1 - 31 .

段然 , 顾纯祥 , 祝跃飞 , 等 . NTRU 格上高效的基于身份的全同态加密体制 [J ] . 通信学报 , 2017 , 38 ( 1 ): 66 - 75 .

DUAN R , GU C X , ZHU Y F , et al . Efficient identity-based fully homomorphic encryption over NTRU [J ] . Journal on Communications , 2017 , 38 ( 1 ): 66 - 75 .

CASH D , HOFHEINZ D , KILTZ E , et al . Bonsai trees,or how to delegate lattice basis [C ] // Advances in Cryptology EUROCRYPT 2010 . 2010 25 ( 4 ): 523 - 552 .

GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions [C ] // The 40th ACM Symposium on Theory of Computing . 2008 : 197 - 206 .

AGRAWAL S , BONEH D , BOYEN X . Efficient lattice (H)IBE in the standard model [C ] // Advances in Cryptology EUROCRYPT2010 , 2010 : 553 - 572 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller [C ] // Advances in Cryptology EUROCRYPT2012 . 2012 : 700 - 718 .

ALWEN J , PEIKERT C . Generating shorter bases for hard random lattices [C ] // The 26th International Symposium on Theoretical Aspects of Computer Science . 2009 : 535 - 553 .

PEIKERT C , . An efficient and parallel Gaussian sampler for lattices [C ] // Advances in Cryptology CRYPTO 2010 . 2010 : 80 - 97 .

AGRAWAL S , BOYEN X , VAIKUNTANATHAN V , et al . Functional encryption for threshold functions(or fuzzy IBE) from lattices [C ] // 15th International Conference on Practice and Theory in Public Key Cryptography . 2012 : 280 - 297 .

YANG C , ZHENG S , WANG L , et al . Hierarchical identity-based broadcast encryption scheme from LWE [J ] . Journal of Communications ＆ Networks , 2014 , 16 ( 3 ): 258 - 263 .

KATSUMATA S , YAMADA S . Partitioning via non-linear polynomial functions:more compact IBEs from ideal lattices and bilinear maps [C ] // Advances in Cryptology ASIACRYPT 2016 . 2016 : 682 - 712 .

ZHANG J , CHEN Y , ZHANG Z . Programmable hash functions from lattices:short signatures and IBEs with small key sizes [C ] // Advances in Cryptology CRYPTO 2016 . 2016 : 302 - 332 .

WANG F H , WANG C X , LIU Z H . Efficient hierarchical identity based encryption scheme in the standard model over lattices [J ] . Frontiers of Information Technology ＆ Electronic Engineering , 2016 , 17 ( 8 ): 781 - 791 .

DODIS Y , OSTROVSKY R , REYZIN L , et al . Fuzzy extractors:How to generate strong keys from biometrics and other noisy data [J ] . The Society for Industrial and Applied Mathematics (SIAM) , 2008 , 38 ( 1 ): 97 - 139 .

Views

1615

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Identity-based incremental signature scheme from lattices

Novel identity-based fully homomorphic encryption scheme from lattice

Linearly homomorphic aggregate signature secure in the standard model

Lattice-based verifiable timed signature and application

Lattice-based lightweight post quantum access authentication scheme for satellite network

Related Author

Miaomiao TIAN

Jing CHEN

Hong ZHONG

Yong-li TANG

HAN Yiliang

LI Ruifeng

ZHOU Tanping

WANG Jingjing

Related Institution

School of Computer Science and Technology, Anhui University

Key Laboratory of Counter-Terrorism Command & Information Engineering of Ministry of Education, Engineering University of PAP

Key Lab of the Armed Police Force for Network and Information Security

School of Cryptography and Engineering, Engineering University of PAP

Department of Cryptology Science and Technology, Beijing Electronic Science and Technology Institute

AI问答

⁰