Enabling Generic, Verifiable, and Secure Data Search in Cloud Services

• Published in: IEEE transactions on parallel and distributed systems Vol. 29; no. 8; pp. 1721 - 1735
• Main Authors: Zhu, Jie, Li, Qi, Wang, Cong, Yuan, Xingliang, Wang, Qian, Ren, Kui
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Cloud; Cloud computing; Data integrity; Data models; Data search; Data storage; Encryption; Freshness; Indexes; secure data search; Servers; verifiable data search
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2018.2808283

Searchable Symmetric Encryption (SSE) has been widely studied in cloud storage, which allows cloud services to directly search over encrypted data. Most SSE schemes only work with honest-but-curious cloud services that do not deviate from the prescribed protocols. However, this assumption does not always hold in practice due to the untrusted nature in storage outsourcing. To alleviate the issue, there have been studies on Verifiable Searchable Symmetric Encryption (VSSE), which functions against malicious cloud services by enabling results verification. But to our best knowledge, existing VSSE schemes exhibit very limited applicability, such as only supporting static database, demanding specific SSE constructions, or only working in the single-user model. In this paper, we propose GSSE, the first generic verifiable SSE scheme in the single-owner multiple-user model, which provides verifiability for any SSE schemes and further supports data updates. To generically support result verification, we first decouple the proof index in GSSE from SSE. We then leverage Merkle Patricia Tree (MPT) and Incremental Hash to build the proof index with data update support. We also develop a timestamp-chain for data freshness maintenance across multiple users. Rigorous analysis and experimental evaluations show that GSSE is secure and introduces small overhead for result verification.