Journal on Communications ›› 2020, Vol. 41 ›› Issue (9): 118-129.doi: 10.11959/j.issn.1000-436x.2020146

• Papers • Previous Articles     Next Articles

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)

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

CLC Number: 

No Suggested Reading articles found!