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

被引：9

作者：

Liang, Yanrong ^{[1
]}

Ma, Jianfeng ^{[1
]}

Miao, Yinbin ^{[1
]}

Kuang, Da ^{[1
]}

Meng, Xiangdong ^{[2
]}

Deng, Robert H. ^{[3
]}

机构：

[1] Xidian Univ, Sch Cyber Engn, Xian 710071, Peoples R China

[2] Henan Key Lab Network Cryptog Technol, Zhengzhou 450001, Peoples R China

[3] Singapore Management Univ, Sch Informat Syst, Singapore 188065, Singapore

来源：

IEEE TRANSACTIONS ON COMPUTERS | 2023年 / 72卷 / 11期

基金：

中国国家自然科学基金;

关键词：

Keyword search; Encryption; Cryptography; Servers; Indexes; Security; Privacy; Searchable symmetric encryption; bloom filter-based keyword search; circular shift and coalesce-bloom filter; symmetric-key hidden vector encryption; SECURE;

D O I：

10.1109/TC.2023.3285103

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：3086 / 3098

页数：13