VKSE-MO: verifiable keyword search over encrypted data in multi-owner settings  

作　　者：Yinbin MIAO Jianfeng MA Ximeng LIU Junwei ZHANG Zhiquan LIU 

机构地区：[1]School of Cyber Engineering, Xidian University [2]School of Information Systems, Singapore Management University

出　　处：《Science China(Information Sciences)》2017年第12期188-202,共15页中国科学（信息科学）（英文版）

基　　金：supported by National High Technology Research and Development Program(863 Program)(Grant No.2015AA016007);National Nature Science Foundation of China(Grant Nos.61303221,61472310,61370078,61309016);Science Foundation of Two sides of Strait(Grant Nos.U1405255,U1135002);Shaanxi Science&Technology Coordination&Innovation Project(Grant No.2016TZC-G-6-3)

摘　　要：Searchable encryption（SE） techniques allow cloud clients to easily store data and search encrypted data in a privacy-preserving manner, where most of SE schemes treat the cloud server as honest-but-curious.However, in practice, the cloud server is a semi-honest-but-curious third-party, which only executes a fraction of search operations and returns a fraction of false search results to save its computational and bandwidth resources. Thus, it is important to provide a results verification method to guarantee the correctness of the search results. Existing SE schemes allow multiple data owners to upload different records to the cloud server,but these schemes have very high computational and storage overheads when applied in a different but more practical setting where each record is co-owned by multiple data owners. To address this problem, we develop a verifiable keyword search over encrypted data in multi-owner settings（VKSE-MO） scheme by exploiting the multisignatures technique. Thus, our scheme only requires a single index for each record and data users are assured of the correctness of the search results in challenging settings. Our formal security analysis proved that the VKSE-MO scheme is secure against a chosen-keyword attack under a random oracle model. In addition, our empirical study using a real-world dataset demonstrated the efficiency and feasibility of the proposed scheme in practice.Searchable encryption（SE） techniques allow cloud clients to easily store data and search encrypted data in a privacy-preserving manner, where most of SE schemes treat the cloud server as honest-but-curious.However, in practice, the cloud server is a semi-honest-but-curious third-party, which only executes a fraction of search operations and returns a fraction of false search results to save its computational and bandwidth resources. Thus, it is important to provide a results verification method to guarantee the correctness of the search results. Existing SE schemes allow multiple data owners to upload different records to the cloud server,but these schemes have very high computational and storage overheads when applied in a different but more practical setting where each record is co-owned by multiple data owners. To address this problem, we develop a verifiable keyword search over encrypted data in multi-owner settings（VKSE-MO） scheme by exploiting the multisignatures technique. Thus, our scheme only requires a single index for each record and data users are assured of the correctness of the search results in challenging settings. Our formal security analysis proved that the VKSE-MO scheme is secure against a chosen-keyword attack under a random oracle model. In addition, our empirical study using a real-world dataset demonstrated the efficiency and feasibility of the proposed scheme in practice.

关 键 词：chosen-keywork attack efficiency and feasibility multi-owner settings result verification searchable encryption 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]