通信学报 ›› 2020, Vol. 41 ›› Issue (9): 118-129.doi: 10.11959/j.issn.1000-436x.2020146

• 学术论文 • 上一篇    下一篇

基于改进Merkle-Tree认证方法的可验证多关键词搜索方案

田有亮1,2,3,骆琴1,3,4   

  1. 1 公共大数据国家重点实验室(贵州大学),贵州 贵阳 550025
    2 贵州大学计算机科学与技术学院,贵州 贵阳 550025
    3 贵州大学密码学与数据安全研究所,贵州 贵阳 550025
    4 贵州大学数学与统计学院,贵州 贵阳 550025
  • 修回日期:2020-06-19 出版日期:2020-09-25 发布日期:2020-10-12
  • 作者简介:田有亮(1982- ),男,贵州盘县人,博士,贵州大学教授、博士生导师,主要研究方向为算法博弈论、密码学与安全协议、大数据安全与隐私保护等|骆琴(1994- ),女,贵州贵阳人,贵州大学硕士生,主要研究方向为可搜索加密协议
  • 基金资助:
    教育部—中国移动科研基金资助项目(MCM20170401);国家自然科学基金资助项目(61772008);国家自然科学基金资助项目(U1836205);贵州省科技重大专项计划基金资助项目(20183001);贵州省科技计划基金资助项目(黔科合基础)([2019]1098);贵州省科技计划基金资助项目(黔科合平台人才)([2017]5788);贵州省科学技术基金资助项目(黔科合J字)([2008]2121)

Verifiable multi-keyword search scheme based on improved Merkle-Tree authentication method

Youliang TIAN1,2,3,Qin LUO1,3,4   

  1. 1 State Key Laboratory of Public Big Data (Guizhou University),Guiyang 550025,China
    2 College of Computer Science and Technology,Guizhou University,Guiyang 550025,China
    3 Institute of Cryptography &Data Security,Guizhou University,Guiyang 550025,China
    4 College of Mathematics and Statistics,Guizhou University,Guiyang 550025,China
  • Revised:2020-06-19 Online:2020-09-25 Published:2020-10-12
  • Supported by:
    Ministry of Education-China Mobile Research Fund Project(MCM20170401);The National Natural Science Foundation of China(61772008);The National Natural Science Foundation of China(U1836205);Science and Technology Major Support Program of Guizhou Province(20183001);Guizhou Provincial Science and Technology Plan Project([2019]1098);Guizhou Provincial Science and Technology Plan Project([2017]5788);Science and Technology Foundation of Guizhou Province([2008]2121)

摘要:

针对可搜索加密方案中的结果验证方法复杂,搜索成本高且效率低,难以满足多关键词搜索结果高效验证和安全性需求的问题,提出了基于改进的 Merkle-Tree 认证方法的多关键词搜索方案。首先,利用双线性映射构造多关键词的可搜索算法,实现高效精准的多关键词搜索;其次,基于Bawa改进的Merkle-Tree认证方法构造搜索方案的验证及动态更新算法,将计算成本从经典的MHT的O(n)降低到O(log n),防止数据篡改、删除和伪造等不法操作的高效验证。在决策线性假设和CDH假设下,所提方案满足密文不可区分性和签名不可伪造性。

关键词: 云计算, 搜索隐私性, 有效验证, 动态更新

Abstract:

Aiming at the problem that the result verification method in the searchable encryption scheme was complicated,the search cost was high and the efficiency was low,it was difficult to meet the requirements of efficient verification and security of multi-keyword search results,a multi-keyword search scheme based on the improved Merkle-Tree authentication method was proposed.Firstly,a multi-keyword searchable algorithm was built to achieve efficient and accurate multi-keyword search by the bilinear mapping.Secondly,based on the improved Merkle-Tree authentication method of Bawa,the verification and dynamic update algorithm of the search scheme was constructed to reduce the calculation cost of the classic MHT to prevent the efficient verification and update of illegal operations such as data tampering,deletion,and forgery.Under the decision-type linear hypothesis and CDH hypothesis,the proof scheme meets the indistinguishability and unforgeability of ciphertext.

Key words: cloud computing, search privacy, valid verification, dynamic update

中图分类号: 

No Suggested Reading articles found!