Privacy-Preserving Bloom Filter-Based Keyword Search Over Large Encrypted Cloud Data

• Main Authors: LIANG, Yanrong, MA, Jianfeng, MIAO, Yinbin, KUANG, Da, MENG, Xiangdong, DENG, Robert H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2023
• Subjects: Keyword search; Encryption; cryptography; security; privacy; searchable symmetric encryption; Bloom-filter-based keyword search; circular shift and coalesce Bloom filter; Databases and Information Systems; Information Security
• Online Access: https://ink.library.smu.edu.sg/sis_research/8322; https://ink.library.smu.edu.sg/context/sis_research/article/9325/viewcontent/Privacy_Bloom_2023_av.pdf
• Institution: Singapore Management University

To achieve the search over encrypted data in cloud server, Searchable Encryption (SE) has attracted extensive attention from both academic and industrial fields. The existing Bloom filter-based SE schemes can achieve similarity search, but will generally incur high false positive rates, and even leak the privacy of values in Bloom filters (BF). To solve the above problems, we first propose a basic Privacy-preserving Bloom filter-based Keyword Search scheme using the Circular Shift and Coalesce-Bloom Filter (CSC-BF) and Symmetric-key Hidden Vector Encryption (SHVE) technology (namely PBKS), which can achieve effective search while protecting the values in BFs. Then, we design a new index structure T-CSCBF utilizing the Twin Bloom Filter (TBF) technology. Based on this, we propose an improved scheme PBKS+, which assigns a unique inclusion identifier to each position in each BF with privacy protection. Formal security analysis proves that our schemes are secure against Indistinguishability under Selective Chosen-Plaintext Attack (IND-SCPA), and extensive experiments using real-world datasets demonstrate that our schemes are feasible in practice.