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

Liang, Yanrong; Ma, Jianfeng; Miao, Yinbin; Kuang, Da; Meng, Xiangjian; Deng, Robert H.

doi:10.1109/tc.2023.3285103

Cited by 7 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To address the aforementioned issues, previous studies have put forth over 60 enhanced bloom filters with the aim of enhancing their adaptability and performance [ 4 ]. These enhanced bloom filters exhibit enhanced flexibility and performance benefits in various application scenarios, including content caching [ 5 , 6 , 7 , 8 , 9 , 10 ], data storage [ 11 , 12 , 13 , 14 , 15 ], and other domains. By reducing false positives, optimizing implementation, augmenting collection diversity, and enriching functionalities, these enhanced bloom filters offer improved adaptability and efficacy, thereby rendering bloom filters a more potent tool for handling extensive datasets.…”

Section: Introductionmentioning

confidence: 99%

PSBF: p-adic Integer Scalable Bloom Filter

Yi,

Wang,

Xie

et al. 2023

Sensors

View full text Add to dashboard Cite

Given the challenges associated with the dynamic expansion of the conventional bloom filter’s capacity, the prevalence of false positives, and the subpar access performance, this study employs the algebraic and topological characteristics of p-adic integers to introduce an innovative approach for dynamically expanding the p-adic Integer Scalable Bloom Filter (PSBF). The proposed method involves converting the target element into an integer using a string hash function, followed by the conversion of said integer into a p-adic integer through algebraic properties. This process automatically establishes the topological tree access structure of the PSBF. The experiment involved a comparison of access performance among the standard bloom filter, dynamic bloom filter, and scalable bloom filter. The findings indicate that the PSBF offers advantages such as avoidance of a linear storage structure, enhanced efficiency in element insertion and query, improved storage space utilization, and reduced likelihood of false positives. Consequently, the PSBF presents a novel approach to the dynamic extensibility of bloom filters.

show abstract