Netinfo Security ›› 2017, Vol. 17 ›› Issue (4): 1-8.doi: 10.3969/j.issn.1671-1122.2017.04.001

• Orginal Article •     Next Articles

A Verifiable Ciphertext Retrieval Scheme Based on Merkle Hash Tree

Lanxiang CHEN1,2(), Linbing QIU1,2   

  1. 1.School of Mathematics and Computer Science, Fujian Normal University, Fuzhou Fujian 350108,China
    2. Key Lab of Network Security and Cryptology, Fujian Normal University, Fuzhou Fujian 350108,China
  • Received:2016-11-17 Online:2017-04-20 Published:2020-05-12

Abstract:

In the model of the semi-honest and curious server, in order to achieve the purpose of fast retrieval of ciphertext and verification of server behaviors by constructing the secure inverted index and the authentication data structure, this paper proposes a verifiable ciphertext retrieval scheme based on Merkle Hash tree. The scheme uses the Lucene search engine toolkit to improve the traditional plaintext index structure to get the secure inverted index which is suitable for the ciphertext retrieval, which ensures the efficiency and security of retrieval. In addition, this paper implements the verification of the completeness and correctness of the retrieval results based on Merkle Hash tree structure. Experimental analysis shows that this scheme not only satisfies the user's efficient retrieval requirement on outsourced private data and data security requirement, but also can accurately and efficiently verify the illegal acts of tampering, deletion, forgery and others that exist on cloud server.

Key words: cloud storage, searchable encryption, inverted index, Merkle Hash tree, integrity checking

CLC Number: