一种陷门随机生成的公钥认证可搜索加密方案  

A searchable encryption scheme for public key authentication randomly generated by trapdoor

作　　者：肖心雨 李高燕 孙文涛[1] 杜浩瑞 XIAO Xinyu;LI Gaoyan;SUN Wentao;DU Haorui(College of Science,Tibet University,Lhasa 850000,China;School of Mathematics and Statistics,Wuhan University,Wuhan 430061,China)

机构地区：[1]西藏大学理学院,拉萨850000 [2]武汉大学数学与统计学院,武汉430061

出　　处：《智能计算机与应用》2024年第7期136-139,共4页Intelligent Computer and Applications

基　　金：国家级大学生创新训练项目(202120694008)。

摘　　要：本文针对于无配对公钥认证可搜索加密方案,相同关键字不满足陷门的不可区分性,提出一种满足陷门不可区分性的公钥认证可搜索加密方案。该方案抵抗恶意服务器关键字猜测攻击,防止在信息检索中生成的陷门的泄露,降低了检索过程中信息泄露的可能性,更好的维护了用户信息的安全性。仿真实验表明,本方案生成2000个关键字密文、陷门和测试分别需要340.005 ms、472.684 ms和208.056 ms,提高了检索信息的效率。In this paper,a searchable encryption scheme for unpaired public key authentication is proposed to satisfy the trap indistinguishability for the same keyword.The scheme resists the malicious server keyword guessing attack,prevents the leakage of trap gate generated in information retrieval,reduces the possibility of information leakage in the retrieval process,and better maintains the security of user information.Simulation results show that it takes 340.005 ms,472.684 ms and 208.056 ms to generate 2000 keyword ciphertext,trap gate and test respectively,which improves the efficiency of information retrieval.

关 键 词：无配对公钥认证 可搜索加密 陷门不可区分性 恶意服务器 

分 类 号：TN918.4[电子电信—通信与信息系统]