有效的標(biāo)準(zhǔn)模型下格上基于身份的代理重加密

江明明; 郭宇燕; 余磊; 宋萬干; 魏仕民

doi:10.11999/JEIT180146

有效的標(biāo)準(zhǔn)模型下格上基于身份的代理重加密

doi: 10.11999/JEIT180146 cstr: 32379.14.JEIT180146

淮北師范大學(xué)計算機(jī)科學(xué)與技術(shù)學(xué)院 ??淮北 ??235000

基金項目: 國家自然科學(xué)基金(60573026)，安徽省自然科學(xué)基金(1708085QF154)，安徽省高校自然科學(xué)基金(KJ2016A627, KJ2018A0398, KJ2017ZD32)，安徽省高校人才計劃項目(gxyq2017154)

詳細(xì)信息

作者簡介:
江明明：男，1984年生，博士，講師，研究方向為格公鑰密碼、數(shù)字簽名

郭宇燕：女，1984年生，博士，講師，研究方向為抗泄露密碼、信息安全

余磊：男，1978年生，碩士，副教授，研究方向為信息安全、安全協(xié)議

宋萬干：男，1963年生，碩士，教授，研究方向為信息安全、數(shù)據(jù)挖掘

魏仕民：男，1962年生，博士，教授，研究方向為序列密碼、信息安全

通訊作者:
余磊　yulei@chun.edu.com

中圖分類號: TN918.4
計量
- 文章訪問數(shù): 2098
- HTML全文瀏覽量: 929
- PDF下載量: 67
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2018-02-02
- 修回日期: 2018-10-25
- 網(wǎng)絡(luò)出版日期: 2018-11-02
- 刊出日期: 2019-01-01

Efficient Identity-based Proxy Re-encryption on Lattice in the Standard Model

School of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China

Funds: The National Natural Science Foundations of China (60573026), Anhui Provincial Natural Science Foundation (1708085Q154), The Nature Science Foundation of Anhui Higher Education Institutions (KJ2016A627, KJ2018A398, KJ2017ZD32), The Talent Project of Anhui Higher Education Institutions (gxyq2017154)

摘要

摘要:
代理重加密在云計算環(huán)境下的密文共享等方面起著重要的作用。目前格上基于身份的代理重加密方案都是隨機(jī)預(yù)言機(jī)模型的。針對這個問題，該文構(gòu)造了一個高效的標(biāo)準(zhǔn)模型下格上基于身份的代理重加密方案。在方案中，用戶身份僅僅被映射為一個向量，使得用戶私鑰的尺寸較短。該方案具有雙向性，多次使用性等性質(zhì)，并且在LWE困難假設(shè)下是適應(yīng)性選擇身份CPA安全的。
- 代理重加密 /
- 格密碼 /
- 高斯抽樣 /
- 基于身份的密碼學(xué)
Abstract:
Proxy re-encryption plays an important role for encrypted data sharing and so on in cloud computing. Currently, almost all of the constructions of identity-based proxy re-encryption over lattice are in the random oracle model. According to this problem, an efficient identity-based proxy re-encryption is constructed over lattice in the standard model, where the identity string is just mapped to one vector and getting a shorter secret key for users. The proposed scheme has the properties of bidirectional, multi-use, moreover, it is semantic secure against adaptive chosen identity and chosen plaintext attack based on Learning With Errors (LWE) problems in the standard mode.
- Proxy re-encryption /
- Lattice cryptography /
- Gaussian sampling /
- Identity-based cryptography

HTML全文

表 1 存儲空間及安全模型比較

	主公鑰尺寸	用戶私鑰尺寸	密文尺寸	安全模型
本文方案	O((m+l)nlog₂q)	O(mlog₂q)	O(mlog₂q)	標(biāo)準(zhǔn)模型
文獻(xiàn)[9]	O(nmlog₂q)	O(mlog₂q)	O(mlog₂q)	隨機(jī)預(yù)言機(jī)模型
文獻(xiàn)[10]	O(nmlog₂q)	O(nmlog₂q)	O(mlog₂q)	隨機(jī)預(yù)言機(jī)模型

下載: 導(dǎo)出CSV

表 2 計算效率比較

	私鑰生成	加密	重加密	解密
本文方案	O(n²)	O(n²)	O(n)	O(n)
文獻(xiàn)[9]	O(n²)	O(n²)	O(n)	O(n)
文獻(xiàn)[10]	O(n²)	O(n²)	O(n²)	O(n³)

下載: 導(dǎo)出CSV

參考文獻(xiàn)(15)

蔣建春, 文偉平. " 云”計算環(huán)境的信息安全問題[J]. 信息網(wǎng)絡(luò)安全, 2010, 10(2): 61–63. doi: 10.3969/j.issn.1671-1122.2010.02.026

JIANG Jianchun and WEN Weiping. The information security problems of cloud computing environment[J]. Netinfo Security, 2010, 10(2): 61–63. doi: 10.3969/j.issn.1671-1122.2010.02.026

BLAZE M, BLEUMER G, and STRAUSS M. Divertible protocols and atomic proxy cryptography[C]. EUROCRYPT, Espoo, Finland, 1998: 127–144. doi: 10.1007/BFb0054122.

GREEN M and ATENIESE G. Identity-based proxy re-encryption[C]. International Conference on Applied Cryptography and Network Security, Berlin, Germany, 2007: 288–306. doi: 10.1007/978-3-540-72738-5_19.

SHAO Jun and CAO Zhenfu. Multi-use unidirectional identity-based proxy re-encryption from hierarchical identity-based encryption[J]. Information Sciences, 2012, 206(16): 83–95. doi: 10.1016/j.ins.2012.04.013

ZHANG Jindan, WANG Xu’an, and YANG Xiaoyuan. Identity based proxy re-encryption based on BB2 and SK IBE with the help of PKG[J]. Journal of Computers, 2013, 8(5): 1230–1239. doi: 10.4304/jcp.8.5.1230-1239

XAGAWA K. Cryptography with Lattices[D]. [Ph.D. dissertation], Tokyo Institute of Technology, 2010.

KIRSHANOVA E. Proxy re-encryption from Lattices[C]. The IACR International Conference on Practice and Theory of Public-Key Cryptography, Berlin, Germany, 2014: 77–94. doi: 10.1007/978-3-642-54631-0_5.

SINGH K, RANGAN C P, and BANERJEE A K. Lattice based identity based unidirectional proxy re-encryption scheme[C]. International Conference on Security, Privacy, and Applied Cryptography Engineering, Pune, India, 2014: 76–91. doi: 10.1007/978-3-319-12060-7_6.

JIANG Mingming, HU Yupu, WANG Baocang, et al. Lattice-based unidirectional proxy re-encryption[J]. Security and Commutation Networks, 2016, 18(8): 3796–3803. doi: 10.1002/sec.1300

NUNEZ D, AGUDO I, and LOPEZ J. NTRU ReEncrypt: An efficient proxy re-encryption scheme based on NTRU[C]. Proceedings of ASIACCS, 2015: 14–17.

江明明, 趙利軍, 王艷, 等. 面向云數(shù)據(jù)共享的量子安全的無證書雙向代理重加密[J]. 信息網(wǎng)絡(luò)安全, 2018, 18(8): 17–24. doi: 10.3969/j.issn.1671-1122.2018.08.003

JIANG Mingming, ZHAO Lijun, WANG Yan, et al. Quantum-security certificateless bidirectional proxy re-encryption for cloud data sharing[J]. Netinfo Security, 2018, 18(8): 17–24. doi: 10.3969/j.issn.1671-1122.2018.08.003

WANG Xuyang, HU Aiqun, and FANG Hao. Feasibility analysis of lattice-based proxy re-encryption[C]. Proceedings of the 2017 International Conference on Cryptography, Security and Privacy, Wuhan, China, 2017: 12–16. doi: 10.1145/3058060.3058080.

ALWEN J and PEIKER C. Generating shorter bases for hard random lattices[C]. The 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, 2009: 535–553. doi: 10.1007/s00224-010-9278-3.

GENTRY C, PEIKERT C, and VAIKUNTANATHAN V. How to use a short basis: Trapdoors for hard lattices and new cryptographic constructions[C]. The 40th ACM Symposium on Theory of Computing, Victoria, Canada, 2008: 197–206.

BONEH D and FREENMAN D M. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures[C]. The IACR International Conference on Practice and Theory of Public-Key Cryptography, Taormina, Italy, 2011: 1–16. doi: 10.1007/978-3-642-19379-8_1.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問統(tǒng)計