Efficient identity-based fully homomorphic encryption over NTRU

Ran DUAN; Chun-xiang GU; Yue-fei ZHU; Yong-hui ZHENG; Li CHEN

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

您当前的位置：

首页 >

文章列表页 >

Efficient identity-based fully homomorphic encryption over NTRU

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

- Efficient identity-based fully homomorphic encryption over NTRU
- Journal on Communications Vol. 38, Issue 1, Pages: 66-75(2017)
- 作者机构：
  
  1. 信息工程大学四院，河南郑州 450002
  2. 数学工程与先进计算国家重点实验室，江苏无锡 214125
  3. 河南财经政法大学网络信息安全研究所，河南郑州 450046
- 作者简介：
- 基金信息：
  
  The National Science-Technology Support Plan Project of China(2012BAH47B01);The National Natural Science Foundation of China(61170234);The National Natural Science Foun-dation of China(61309007);The National Natural Science Foun-dation of China(61502533);Henan Provincial Science and Technology Innovation Fund for Outstanding Young(134100510002);Foundation and Research in Cutting-edge Technologies in the Project of Henan Province(142300410002);Henan University Science and Technology Innovation Talent Support Project(13HASTIT043)
- DOI：10.11959/j.issn.1000-436x.2017008
  CLC： TP309.7
- Online First：2017-01，
  
  Published：25 January 2017
- 稿件说明：
移动端阅览
Ran DUAN, Chun-xiang GU, Yue-fei ZHU, et al. Efficient identity-based fully homomorphic encryption over NTRU[J]. Journal on Communications, 2017, 38(1): 66-75.
DOI：

Ran DUAN, Chun-xiang GU, Yue-fei ZHU, et al. Efficient identity-based fully homomorphic encryption over NTRU[J]. Journal on Communications, 2017, 38(1): 66-75. DOI： 10.11959/j.issn.1000-436x.2017008.

摘要

全同态加密是目前解决云计算网络数据隐私保护问题的最佳方案，但目前的体制的公钥尺寸普遍较大。首先，通过引入Kullback-Leibler散度的概念，构造一种NTRU格上的基于身份公钥的加密体制，参数分析表明体制具有较小的密钥和密文尺寸，实验数据表明体制具有较高的加解密效率。其次，利用近似特征向量技术，给出一种方法，将基于身份的公钥加密体制转换为基于身份的全同态加密体制，可以进一步减小密文尺寸。和现有体制相比，除了不需要计算密钥，实现真正意义上的基于身份特性以外，还减小了密钥和密文尺寸，提高了计算和传输效率。

Abstract

Fully homomorphic encryption is the best solution for solving privacy concerns for data over cloud so far

while large public key size is a general shortcoming for existing schemes.First

by introducing the concept of Kullback-Leibler divergence

an identity-based public key scheme over NTRU lattice with modified ciphertext form was proposed.Analysis on parameter setting showed its small key size and ciphertext size

and experiments revealed its high computational efficiency.Second

with the idea of approximate eigenvector

an improved method to convert the scheme into an identity-based fully homomorphic encryption one was put forward to further reduce ciphertext size.Compared with existing schemes

the converted scheme not only abandons evaluation keys to make it fully identity-based

but also has smaller keys and ciphertext

which results in higher computational and transmission efficiency.

关键词

Keywords

references

RIVEST R L , ADLEMAN L , DERTOUZOS M L . On data banks and privacy homomorphisms [J ] . Foundations of Secure Computation , 1978 , 4 ( 11 ): 169 - 180 .

GENTRY C , . Fully homomorphic encryption using ideal lattices [C ] // 41st Annual ACM Symposium on Theory of Computing (STOC 2009),Bethesda,USA . 2009 : 169 - 178 .

LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings [J ] . Journal of the ACM , 2013 , 60 ( 6 ): 43 - 65 .

BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE [J ] . SIAM Journal on Computing , 2014 , 43 ( 2 ): 831 - 871 .

TREPACHEVA A , BABENKO L . Known plaintexts attack on polynomial based homomorphic encryption [C ] // 7th International Conference on Security of Information and Networks (SIN 2014),Glasgow,UK . 2014 .

YASUDA M , SHIMOYAMA T , KOGURE J , et al . Secure statistical analysis using RLWE-based homomorphic encryption [C ] // 20th Australasian Conference on Information Security and Privacy (ACISP 2015),QUT,Australia . 2015 : 471 - 487 .

汤殿华 , 祝世雄 , 王林 , 等 . 基于 RLWE 的全同态加密方案 [J ] . 通信学报 , 2014 , 35 ( 1 ): 173 - 182 .

TANG D H , ZHU S X , WANG L , et al . Fully homomorphic encryption scheme from RLWE [J ] . Journal on Communications , 2014 , 35 ( 1 ): 173 - 182 .

SHAMIR A , . Identity-based cryptosystems and signature schemes [C ] // CRYPTO '84,Santa Barbara,California,USA . 1984 : 47 - 53 .

光焱 , 祝跃飞 , 费金龙 , 等 . 利用容错学习问题构造基于身份的全同态加密体制 [J ] . 通信学报 , 2014 , 35 ( 2 ): 111 - 117 .

GUANG Y , ZHU Y F , FEI J L , et al . Identity-based fully homomorphic encryption from learning with error problem [J ] . Journal on Communications , 2014 , 35 ( 2 ): 111 - 117 .

GENTRY C , SAHAI A , WATERS B . Homomorphic encryption from learning with errors:conceptually-simpler,asymptotically-faster,attribute-based [C ] // 33rd Annual International Cryptology Conference (CRYPTO 2013) , Santa Barbara,CA,USA , 2013 : 75 - 92 .

HOFFSTEIN J , PIPHER J , SILVERMAN J H . NTRU:a ring-based public key cryptosystem [C ] // ANTS III,Portland,Oregon,USA . 1998 : 267 - 288 .

DUCAS L , DURMUS A , LEPOINT T , et al . Lattice signatures and bimodal Gaussians [C ] // 33rd Annual International Cryptology Conference (CRYPTO 2013),Santa Barbara,CA,USA . 2013 : 40 - 56 .

PEIKERT C , . Lattice cryptography for the internet [C ] // 6th International Conference on Post-Quantum Cryptography (PQCrypto 2014).Waterloo,ON,Canada . 2014 : 197 - 219 .

LÓPEZ-ALT A , TROMER E , VAIKUNTANATHAN V . On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption [C ] // 44th Annual ACM Symposium on Theory of Computing (STOC 2012) . Portland,USA , 2012 : 1219 - 1234 .

DUCAS L , LYUBASHEVSKY V , PREST T . Efficient identity-based encryption over NTRU lattices [C ] // 20th Annual International Conference on the Theory and Application of Cryptology and Information Security (AsiaCrypt 2014),Kaohsiung,Taiwan (R.O.C.) . 2014 : 22 - 41 .

ALBRECHT M R , FAUGERE J C , FITZPATRICK R , et al . Lazy modulus switching for the BKW algorithm on LWE [C ] // 17th IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2014) . Buenos Aires,Argentina , 2014 : 429 - 445 .

KIRCHNER P , FOUQUE P A . An improved BKW algorithm for LWE with applications to cryptography and lattices [C ] // 35th Annual International Cryptology Conference (CRYPTO 2015) . Santa Barbara,CA,USA , 2015 : 43 - 62 .

LYUBASHEVSKY V , PREST T . Quadratic time,linear space algorithms for gram-schmidt orthogonalization and gaussian sampling in structured lattices [C ] // 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EuroCrypt 2015) . Sofia,Bulgaria , 2015 : 789 - 815 .

LYUBASHEVSKY V , PEIKERT C , REGEV O . A toolkit for ring-LWE cryptography [C ] // 32rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (Euro Crypt2013) . Athens,Greece , 2013 : 35 - 54 .

REGEV O . On lattices,learning with errors,random linear codes,and cryptography [J ] . Journal of the ACM (JACM) , 2009 , 56 ( 6 ): 34 - 43 .

MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on gaussian measures [J ] . SIAM Journal on Computing , 2007 , 37 ( 1 ): 267 - 302 .

DUCAS L , NGUYEN P Q . Faster Gaussian lattice sampling using lazy floating-point arithmetic [C ] // 18th Annual International Conference on the Theory and Application of Cryptology and Information Security (AsiaCrypt 2012) . Beijing,China , 2012 : 415 - 432 .

GAMA N , NGUYEN P Q . Predicting lattice reduction [C ] // 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EuroCrypt 2008) . Istanbul,Turkey , 2008 : 31 - 51 .

MICCIANCIO D . Lattice-based cryptography [M ] . US : Encyclopedia of Cryptography and SecurityPress , 2011 .

Views

1339

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Novel identity-based fully homomorphic encryption scheme from lattice

Identity-based fully homomorphic encryption from learning with error problem

Blind rotation optimization technique for the FINAL fully homomorphic encryption scheme

Efficient implementation for BFV fully homomorphic encryption algorithm based on Zynq platform

Attribute-based fully homomorphic encryption scheme over rings

Related Author

Xi-xi YAN

Qing YE

Kun LIU

Ming-xing HU

Yong-li TANG

Yan GUANG

Yue-fei ZHU

Jin-long FEI

Related Institution

College of Computer Science and Technology,Henan Polytechnic University

Fourth Institute,PLA Information Engineering University

State Key Laboratory of Mathematical Engineering and Advanced Computing, PLA Information Engineering University

School of Cryptographic Engineering, Cyberspace Force Information Engineering University

Department of Electronic and Communication Engineering, Beijing Electronic Science and Technology Institute

AI问答

⁰