Journal of Xidian University

Previous Articles     Next Articles

Verifiable search over encrypted data with a variable keyword-field

MIAO Yinbin1;MA Jianfeng2,3;LIU Zhiquan2;WEI Fushan1;WANG Xu'an1   

  1. (1. School of Telecommunication Engineering, Xidian Univ., Xi'an 710071, China;
    2. School of Computer Science and Technology, Xidian Univ., Xi'an 710071, China;
    3. School of Cyber Engineering, Xidian Univ., Xi'an 710071, China)
  • Received:2016-01-07 Online:2017-02-20 Published:2017-04-01
  • Contact: MA Jianfeng E-mail:jfma@mail.xidian.edu.cn

Abstract:

The latest searchable encryption (SE) technique allows cloud clients to conduct the search query over ciphertext according to keywords. However, the malicious cloud service provider (CSP) may return incorrect or forged search results which lead to data integrity compromises in practical applications, and most of existing SE schemes has a fixed keyword-field. To solve these problems, this paper devises a cryptographic primitive called  verifiable search after encrypted data with the variable keyword-field scheme through an asymmetric bilinear map. Formal security analysis proves that our scheme can guarantee data confidentiality and integrity simultaneously, and resist the chosen keyword attack. Furthermore, experimental results over the real-world dataset show that our scheme is feasible in practice.