无配对公钥认证可搜索加密方案  

Public-Key Authenticated Encryption with Keyword Search Without Pairings

作　　者：杨宁滨 周权[1] 许舒美 Yang Ningbin;Zhou Quan;Xu Shumei(School of Mathematics and Information Science,Guangzhou University,Guangzhou 510006)

机构地区：[1]广州大学数学与信息科学学院,广州510006

出　　处：《计算机研究与发展》2020年第10期2125-2135,共11页Journal of Computer Research and Development

基　　金：广东省重点领域研发计划项目(2019B020215004);国家自然科学基金项目(61772147);国家重点研发计划项目(2018YFB0803600)。

摘　　要：随着云计算与5G通信的快速发展与广泛应用,云移动用户数迅速增长.云数据的隐私性保护越来越受大众关注.早期提出的带关键字搜索的公钥加密方案(public key encryption scheme with keyword search,PEKS)和公共通道带关键字搜索的公钥加密方案(secure channel free PEKS,SCF-PEKS)允许系统中的任何用户向服务器发送加密文件供接收者检索,起到一定的隐私保护作用.但之后Rhee等人的工作中发现方案仍存在关键词隐私性安全不足.同时,多数的公钥可搜索加密方案是基于双线性对下计算的.在运算能力有限的设备上应用,其计算效率会有所限制.针对以上问题,提出一种非双线性对运算的公共通道的公钥认证可搜索加密方案(non bilinear pairs secure channel free public key authentication encryption with keyword search scheme,NBP-SCF-PAEKS),该方案的计算效率相对于双线性对方案高,并且在关键词检索过程具有访问控制功能.在不使用随机预言机模型下,通过Game-Hopping方法证明方案满足适应性选择关键词攻击下多关键词密文不可区分性以及适应性选择关键词攻击的陷门不可区分性,使得方案模型抵抗在线模式下外部攻击者关键词猜测攻击和离线模式下内部攻击者关键词猜测攻击.根据方案设计进行仿真实验,结果表明:该方案相对于其他方案是高效安全的.With the rapid development and wide application of cloud computing and 5G communication,the number of cloud mobile users has increased rapidly.The privacy protection of cloud data is getting more and more attention.Public key encryption scheme with keyword search(PEKS)and secure channel free public key encryption with keyword search(SCF-PEKS)allow any user in the system to send encrypted files to the server for retrieval by the receiver,which plays a certain role of privacy protection.However,Rhee et al.found that the scheme may result in loss of privacy security of keywords in their work.Meanwhile,many of public-key searchable encryption schemes are calculated based on bilinear pairings,and their computational efficiency is limited on battery-limited devices.To address these issue,we propose a non bilinear pairs secure channel free public key authentication encryption with keyword search scheme(NBP-SCF-PAEKS).The scheme has higher computational efficiency than the bilinear pair scheme,and has access control function in keyword retrieval process.Without random oracle model,we prove that the scheme can resist the online keyword guessing attack and the offline keyword guessing attack,by ensuring the multi-keyword ciphertext indistinguishability under adaptive chosen keyword attack and the keyword trapdoor indistinguishability under adaptive chosen keyword attack through game-hopping method.Compared with other schemes,the simulation results show that the scheme is efficient and secure.

关 键 词：公钥 关键词猜测攻击 可搜索加密 多关键词密文安全 认证 非双线性对 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]