Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2020, Vol. 46 ›› Issue (9): 123-128,135. doi: 10.19678/j.issn.1000-3428.0056028

• Cyberspace Security • Previous Articles     Next Articles

Analysis and Improvement of Searchable Encryption Scheme Based on Composite-Order Bilinear Pairs

DENG Zhihui1,2, WANG Shaohui1,2, WANG Ping1,2   

  1. 1. School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China;
    2. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing 210003, China
  • Received:2019-09-16 Revised:2019-11-06 Published:2019-11-15

基于合数阶双线性对的可搜索加密方案分析与改进

邓志辉1,2, 王少辉1,2, 王平1,2   

  1. 1. 南京邮电大学 计算机学院, 南京 210003;
    2. 江苏省无线传感网高技术研究重点实验室, 南京 210003
  • 作者简介:邓志辉(1996-),男,硕士研究生,主研方向为网络信息安全;王少辉,副教授;王平,硕士研究生。
  • 基金资助:
    国家自然科学基金(61872192,61373139,61672016);江苏省科技支撑计划项目(61003236):南京邮电大学科研项目(NY214064,NY213036)。

Abstract: Searchable encryption,as the core technology of secure search,enables data storage servers to retrieve data under ciphertext.However,the existing searchable encryption scheme without secure channel fail to resist off-line keyword guessing attacks initiated by external attackers.In order to solve the problem,this paper analyzes the security of the searchable encryption scheme based on composite-order bilinear pairs,and proves that the existing scheme does not consider the indistinguishability of keyword trapdoor.Also,this paper redesigns the Trapdoor algorithm and proposes an improved searchable public key encryption scheme without secure channel,which proves to be able to resist external keyword guessing attacks.Analysis results show that the proposed scheme has good ciphertext and trapdoor size,its computational complexity is close to that of the original scheme,but its security performance is better.

Key words: searchable encryption, composite-order bilinear pairs, keyword trapdoor, indistinguishability, external keyword guessing attack

摘要: 可搜索加密作为安全搜索的核心技术,使数据存储服务器能在密文下检索数据,但无安全信道的可搜索加密方案不能抵御由外部攻击者发起的离线关键字猜测攻击。针对该问题,对基于合数阶双线性对的可搜索加密方案安全性进行分析,证明该方案未考虑关键字陷门的不可区分性,重新设计生成陷门的Trapdoor算法,提出一种改进的无安全信道可搜索公钥加密方案,并证明其具有关键字陷门的不可区分性,能有效抵抗外部关键字猜测攻击。分析结果表明,该方案具有良好的密文与陷门尺寸,计算复杂度与原方案接近,但安全性能更高。

关键词: 可搜索加密, 合数阶双线性对, 关键字陷门, 不可区分性, 外部关键字猜测攻击

CLC Number: