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

• Published in: Jisuanji gongcheng
• Main Author: DENG Zhihui, WANG Shaohui, WANG Ping
• Format: Article
• Language: English
• Published: Editorial Office of Computer Engineering 2020-09-01
• Subjects: searchable encryption|composite-order bilinear pairs|keyword trapdoor|indistinguishability|external keyword guessing attack
• Online Access: https://www.ecice06.com/fileup/1000-3428/PDF/20200916.pdf

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.