Journal of Xidian University

Previous Articles     Next Articles

Efficient verifiable multi-keyword search over encrypted data

MIAO Yinbin1;MA Jianfeng1,2;ZHANG Junwei1;LIU Zhiquan1   

  1. (1. School of Cyber Engineering, Xidian Univ., Xi'an 710071, China;
    2. School of Computer Science and Technology, Xidian Univ., Xi'an 710071, China)
  • Received:2016-08-26 Online:2017-08-20 Published:2017-09-29

Abstract:

Most of existing searchable encryption (SE) schemes cannot support fine-grained access control and accurately verify the correctness of search results. Moreover, single keyword search will return many irrelevant search results and definitely bring down user search experience. Along this direction, we propose an efficient verifiable multi-keyword search scheme by exploiting CP-ABE (Ciphertext-Policy Attribute-Based Encryption) and the private audit server. Rigorous security analysis proves that our scheme is secure against the chosen-keyword attack in the random oracle model, and an empirical study of the real-world dataset justifies that this scheme is feasible and efficient in practice.

Key words: searchable encryption, fine-grained access control, attribute-based encryption, random oracle model, chosen-keyword attack