Efficient searchable symmetric encryption for storing multiple source dynamic social data on cloud

Publication Type:
Journal Article
Citation:
Journal of Network and Computer Applications, 2017, 86 pp. 3 - 14
Issue Date:
2017-05-15
Full metadata record
Files in This Item:
Filename Description Size
Efficient searchable symmetric encrypti...pdfPublished Version1.33 MB
Adobe PDF
© 2016 Elsevier Ltd 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. Dynamic Searchable Symmetric Encryption (DSSE) is an advanced cryptographic primitive addressing the above issue, which maintains efficient keyword search over dynamic encrypted data without disclosing much information to the storage provider. Existing DSSE schemes implicitly assume that original user data is centralized, so that a searchable index can be built at once. Nevertheless, especially in pervasive social networking applications, user-side data centralization is not reasonable. E.g., social chatting records are often separately distributed over multiple devices such as mobile phones, laptops, tablet computers, etc. In this paper, we propose the notion of Multi-Data-Source DSSE (MDS-DSSE), 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-DSSE 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.
Please use this identifier to cite or link to this item: