A Searchable Asymmetric Encryption Scheme with Support for Boolean Queries for Cloud Applications. (20th December 2018)

• Record Type: Journal Article
• Authors: Zeng, Ming; Zhang, Kai; Qian, Haifeng; Chen, Xiaofeng; Chen, Jie
• Editors: Mu, Yi
• Is Part Of: Computer journal. Volume 62:Number 4(2019)
• Page Start: 563
• Page End: 578
• Publication Date: 2018-12-20
• Subjects: data security -- searchable encryption -- boolean query -- cloud security; Computers -- Periodicals; 005.1
• DOI: 10.1093/comjnl/bxy134
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: Cloud computing is a new promising technology paradigm that can provide clients from the whole network with scalable storage resources and on-demand high-quality services. However, security concerns are raised when sensitive data are outsourced. Searchable encryption is a kind of cryptographic primitive that enables clients to selectively retrieve encrypted data, the existing schemes that support for sub-linear boolean queries are only considered in symmetric key setting, which makes a limitation for being widely deployed in many cloud applications. In order to address this issue, we propose a novel searchable asymmetric encryption scheme to support for sub-linear boolean query over encrypted data in a multi-client model that is extracted from an important observation that the outsourced database in cloud is continuously contributed and searched by multiple clients. For the purpose of introducing the scheme, we combine both the ideas of symmetric searchable encryption and public key searchable encryption and then design a novel secure inverted index. Furthermore, a detailed security analysis for our scheme is given under the simulation-based security definition. Finally, we conduct experiments for our construction on a real dataset (Enron) along with a performance analysis to show its practicality.