电信科学 ›› 2020, Vol. 36 ›› Issue (2): 13-23.doi: 10.11959/j.issn.1000-0801.2020049

• 研究与开发 • 上一篇    下一篇

基于BDH问题的支持多服务器连接关键词可搜索加密方案

卢艳华1,2,4,田有亮2,3,4,刘成2,3,4   

  1. 1 贵州大学数学与统计学院,贵州 贵阳 550025
    2 贵州省公共大数据重点实验室,贵州 贵阳 550025
    3 贵州大学计算机科学与技术学院,贵州 贵阳 550025
    4 贵州大学密码学与数据安全研究所,贵州 贵阳 550025
  • 修回日期:2019-12-22 出版日期:2020-02-20 发布日期:2020-05-19
  • 作者简介:卢艳华(1994- ),女,贵州大学数学与统计学院硕士生,主要研究方向为可搜索加密|田有亮(1985- ),男,博士,贵州大学计算机科学与技术学院教授、博士生导师,主要研究方向为算法博弈论、密码与安全协议、大数据安全和隐私保护、区块链和电子货币等|刘成(1994- ),女,贵州大学计算机科学与技术学院硕士生,主要研究方向为隐私保护
  • 基金资助:
    国家自然科学基金资助项目(61662009);贵州省教育厅科技拔尖人才支持项目([2016]060);贵州省科技重大专项计划项目(2018300);贵州省科技计划项目([2017]5788);教育部—中国移动科研基金研发项目(MCM20170401);贵州大学培育项目([2017]5788);国家自然科学基金联合基金重点支持项目(U1836205);贵州省科技计划项目([2019]1098)

Multi-server conjunctive keyword searchable encryption scheme based on BDH problem

Yanhua LU1,2,4,Youliang TIAN2,3,4,Chen LIU2,3,4   

  1. 1 College of Mathematics &Statistics,Guizhou University,Guiyang 550025,China
    2 Guizhou Province Key Laboratory of Public Big Data,Guiyang 550025,China
    3 College of Computer Science &Technology,Guizhou University,Guiyang 550025,China
    4 Institute of Cryptography &Data Security,Guizhou University,Guiyang 550025,China
  • Revised:2019-12-22 Online:2020-02-20 Published:2020-05-19
  • Supported by:
    The National Natural Science Foundation of China(61662009);Guizhou Provincial Department of Education Science and Technology Top Talent Support Project([2016]060);Science and Technology Major Support Program of Guizhou Province of China(2018300);Science and Technology Program of Guizhou Province of China([2017]5788);Ministry of Education-China Mobile Research Fund Project(MCM20170401);Guizhou University Cultivation Project of China([2017]5788);Key Project Supported by the Joint Fund of the National Natural Science Foundation of China(U1836205);Science and Technology Program of Guizhou Province of China([2019]1098)

摘要:

可搜索加密是一种支持用户在密文上进行关键字查找的密码学原语,鉴于传统单服务器可搜索加密方案数据检索效率不高的问题,基于身份在证书管理方面的优势,提出了在多服务器环境下利用双线性映射构造一种支持连接关键词搜索的加密方案。在该方案中,加密数据的存储与查询分配给不同的服务器,通过协作共同提高用户存储和关键词的检索效率;再利用多服务器与用户的身份实现连接关键词的加密与搜索;同时结合连接关键词的可搜索加密方法,基于双线性映射构造新的安全模型。且在双线性Diffie-Hellman问题下,该方案满足选择消息攻击下的密文不可区分性。

关键词: 多服务器, 连接关键词, 基于身份加密, 双线性Diffie-Hellman, 密文不可区分性

Abstract:

Searchable encryption is a cryptographic primitive that supports users to search for keywords on ciphertext.In view of the low efficiency of traditional single-server searchable encryption schemes,it was based on the advantages of identity management in certificate management.In the multi-serve environment,a bilinear mapping was used to construct an identity-based encryption scheme that supports conjunctive keyword search.In this scheme,the storage and query of the encrypted data were allocated to different servers,and the retrieval efficiency of the user storage and keyword was improved by cooperation.Re-use the encryption and search ability of the connection keywords by using the identity of multi-server and user.At the same time,combine with the searchable encryption method of conjunctive keyword,a new security model was constructed based on bilinear pairing.And under the bilinear Diffie-Hellman problem,the scheme satisfies the ciphertext indistinguishability under selected message attack.

Key words: multi-server, conjunctive keyword, ID-based encryption, bilinear Diffie-Hellman

中图分类号: 

No Suggested Reading articles found!