d-DSE

Distinct Dynamic Searchable Encryption Resisting Volume Leakage in Encrypted Databases

Conference Paper (2024)
Author(s)

Dongli Liu (Huazhong University of Science and Technology)

Wei Wang (Huazhong University of Science and Technology)

Peng Xu (Huazhong University of Science and Technology, Jinyinhu Laboratory)

Laurence T. Yang (St. Francis Xavier University, Huazhong University of Science and Technology)

Bo Luo (University of Kansas Lawrence)

K. Liang (TU Delft - Cyber Security)

Research Group
Cyber Security
More Info
expand_more
Publication Year
2024
Language
English
Research Group
Cyber Security
Pages (from-to)
2563-2580
ISBN (electronic)
9781939133441
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Dynamic Searchable Encryption (DSE) has emerged as a solution to efficiently handle and protect large-scale data storage in encrypted databases (EDBs). Volume leakage poses a significant threat, as it enables adversaries to reconstruct search queries and potentially compromise the security and privacy of data. Padding strategies are common countermeasures for the leakage, but they significantly increase storage and communication costs. In this work, we develop a new perspective on handling volume leakage. We start with distinct search and further explore a new concept called distinct DSE (d-DSE). We also define new security notions, in particular Distinct with Volume-Hiding security, as well as forward and backward privacy, for the new concept. Based on d-DSE, we construct the d-DSE designed EDB with related constructions for distinct keyword (d-KW-dDSE), keyword (KW-dDSE), and join queries (JOIN-dDSE) and update queries in encrypted databases. We instantiate a concrete scheme BF-SRE, employing Symmetric Revocable Encryption. We conduct extensive experiments on real-world datasets, such as Crime, Wikipedia, and Enron, for performance evaluation. The results demonstrate that our scheme is practical in data search and with comparable computational performance to the SOTA DSE scheme (MITRA*, AURA) and padding strategies (SEAL, ShieldDB). Furthermore, our proposal sharply reduces the communication cost as compared to padding strategies, with roughly 6.36 to 53.14x advantage for search queries.

Files

License info not available