《计算机应用》唯一官方网站

• •    下一篇

基于穿刺伪随机函数的动态可搜索加密方案

刘运东,汪学明   

  1. 贵州大学计算机科学与技术学院
  • 收稿日期:2024-07-17 修回日期:2024-10-15 发布日期:2024-11-19 出版日期:2024-11-19
  • 通讯作者: 刘运东
  • 基金资助:
    国家自然科学基金项目;贵州省自然科学基金项目

Dynamic searchable encryption scheme based on puncture pseudorandom function

  • Received:2024-07-17 Revised:2024-10-15 Online:2024-11-19 Published:2024-11-19

摘要: 动态可搜索加密由于在云服务器上提供添加、删除与搜索数据的功能而受到广泛关注。现有的动态可搜索加密方案通常须由较高安全性的密码学原语构造,在方案搜索时需要计算多次双线性对运算。针对动态可搜索加密方案在服务器中搜索时具有较大的计算开销,将穿刺伪随机函数引入进动态可搜索加密中,设计提出了一种基于穿刺伪随机函数(PPRF)的动态可搜索加密方案。方案不必使用对称加密算法加密文件标识符,同时也不必在服务器搜索时解密密文获取文件标识符,客户端与服务器仅需一次交互即能完成数据搜索。方案在删除关键字时标记密钥,搜索时使用标记密钥计算穿刺伪随机函数,使用前向安全方案实现后向安全,在保证安全性的同时提高搜索效率。根据动态可搜索加密方案的安全模型,证明了方案的安全性。仿真实验结果表明,与基于密钥可更新伪随机函数(KUPRF)构建的方案ROSE、基于对称穿刺加密(SPE)构建的方案Janus++、基于对称可撤销加密(SRE)构建的方案Aura相比,每个关键字的平均搜索时间分别降低了17%、64%、57%,提出的方案有效且可行,有效地降低了服务器的搜索成本,提高了方案的搜索效率,增加了方案实用性。

关键词: 可搜索加密, 伪随机函数, 穿刺伪随机函数, 前向安全, 后向安全

Abstract: Dynamic searchable encryption has attracted wide attention due to its ability to add, delete, and search data on cloud servers. Existing dynamic searchable encryption schemes are usually constructed using highly secure cryptographic primitives, and multiple bilinear pairing operations need to be calculated when searching for the scheme. In view of the large computational overhead of dynamic searchable encryption schemes when searching on server, a puncture pseudorandom function was introduced into dynamic searchable encryption, and a dynamic searchable encryption scheme based on a Puncture PseudoRandom Function (PPRF) was designed and proposed. The file identifier does not need to be encrypted using symmetric encryption algorithms, and it is also not necessary to decrypt the ciphertext to obtain the file identifier during server searches; the client and server can complete the data search with just one interaction. The scheme marks the key when deleting keywords, uses the marked key to calculate the punctured pseudo-random function during the search, and implements backward security with a forward-secure scheme, ensuring security while improving search efficiency. According to the security model of the dynamic searchable encryption scheme, the security of the scheme was proved. The simulation experiment results show that compared with other schemes such as RObust Searchable Encryption (ROSE) scheme built on Key Updateable Pseudo-Random Function (KUPRF), Janus++ scheme built on Symmetric Puncture Encryption (SPE), and Aura scheme built on symmetric revocable encryption (SRE), the average search time of each keyword is reduced by 17%, 64%, and 57% respectively. The proposed scheme is effective and feasible, which effectively reduces the search cost of server, improves the search efficiency of the scheme, and increases the practicality of the scheme.

Key words: searchable encryption, pseudo-random function, puncture pseudorandom function, forward security, backward security

中图分类号: