Cryptology ePrint Archive: Report 2015/349

Efficient Searchable Symmetric Encryption for Storing Multiple Source Data on Cloud

Chang Liu and Liehuang Zhu and Jinjun Chen

Abstract: Cloud computing has greatly facilitated large-scale data outsourcing due to its cost efficiency, scalability and many other advantages. Subsequent privacy risks force data owners to encrypt sensitive data, hence making the outsourced data no longer searchable. Searchable Symmetric Encryption (SSE) is an advanced cryptographic primitive addressing the above issue, which maintains efficient keyword search over encrypted data without disclosing much information to the storage provider. Existing SSE schemes implicitly assume that original user data is centralized, so that a searchable index can be built at once. Nevertheless, especially in cloud computing applications, user-side data centralization is not reasonable, e.g. an enterprise distributes its data in several data centers. In this paper, we propose the notion of Multi-Data-Source SSE (MDS-SSE), which allows each data source to build a local index individually and enables the storage provider to merge all local indexes into a global index afterwards. We propose a novel MDS-SSE scheme, in which an adversary only learns the number of data sources, the number of entire data files, the access pattern and the search pattern, but not any other distribution information such as how data files or search results are distributed over data sources. We offer rigorous security proof of our scheme, and report experimental results to demonstrate the efficiency of our scheme.

Category / Keywords: Searchable Symmetric Encryption, Multiple Data Sources, Data Outsourcing, Cloud Computing.

Date: received 20 Apr 2015

Contact author: changliu bit at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150423:023649 (All versions of this report)

Short URL: ia.cr/2015/349

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]