Bloom Filter Query Algorithm

Xie, Kun; Wen, Jigang; Zhang, Dafang; Xie, Gaogang

doi:10.3724/sp.j.1001.2009.00096

Cited by 10 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bloom filter is a space-saving probabilistic data structure, mainly used to test the membership of elements [49,50]. In the blockchain, it represents a collection of address elements A � @ 1 , @ 2 , .…”

Section: Bloom Filter Privacy Protection Algorithm Based Onmentioning

confidence: 99%

A Privacy Protection Method of Lightweight Nodes in Blockchain

Lin

Jiang

2021

Security and Communication Networks

View full text Add to dashboard Cite

Aiming at the privacy protection of lightweight nodes based on Bloom filters in blockchain, this paper proposes a new privacy protection method. Considering the superimposition effect of query information, node and Bloom filter are regarded as the two parties of the game. A privacy protection mechanism based on the mixed strategy Nash equilibrium is proposed to judge the information query. On this basis, a Bloom filter privacy protection algorithm is proposed when the probability of information query and privacy, not being leaked, is less than the node privacy protection. It is based on variable factor disturbance, adjusting the number of bits’ set to 1 in the Bloom filter to improve the privacy protection performance in different scenarios. The experiment uses Bitcoin transaction data from 2009 to 2019 as the test data to verify the effectiveness, reliability, and superiority of the method.

show abstract

Section: Bloom Filter Privacy Protection Algorithm Based Onmentioning

confidence: 99%

A Privacy Protection Method of Lightweight Nodes in Blockchain

Lin

Jiang

2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…The experimental data we used is come from The Cooperative Association for Internet Data Analysis (CAIDA) [5].By using the experimental methods and procedures we proposed before, we verify the veracity of our algorithm to identify large flows. SDBF has three layers in total.…”

Section: Experimental Simulatementioning

confidence: 99%

Identifying Large Flows Based on SDBF Algorithm in High Speed Network Measurement

Lei

Chen

2015

AMM

View full text Add to dashboard Cite

It is very important in developing effective and efficient traffic engineering schemes for identifying large flows. In this paper, according to the characteristic of network flows, a new algorithm which combined by scalable bloom filter and dynamic bloom filter is proposed to realize elephant flows identification. This method can improve the performance of network measurement and the efficiency of the resource usage of measurement system by handling flows with different strategy according to its different feature. The theoretical analysis and the simulation result indicate that under the condition of existing some tolerable measurement error about the length of flows, our algorithm can identify elephant flows accurately, which reduce the storage space and improve the processing speed efficiently.

show abstract

“…The server can calculate the size of query frame F and polling cycle K based on the required detection probability and the number of tags within the range of reader. Using the several responses from tag to reader, we can build a Bloom filter [9] similar to the partition. Use the Bloom filter of this partition to determine the existence of a tag.…”

Section: Algorithm Descriptionmentioning

confidence: 99%

Missing Tag HPL Detection Algorithm in Large Scale Active RFID System

Fan

Feng

2014

AMM

View full text Add to dashboard Cite

To address this issue that the real time monitoring tag of large-scale active RFID tag system, we propose an another missing tag detection algorithm which is based on frame-slotted ALOHA protocol. By reducing the number of bits of the tag reply information, the energy consumption of active tags has been greatly reduced. Compared with that traditional detection algorithm based on tag identification number, experimental results demonstrate that HPL algorithm will reduce an order of magnitude on energy consumption of label, and at the same time, it will reduce the execution time of the algorithm. Meanwhile, compared with the best iteration ID-free protocol detection algorithm currently, HPL algorithm will reduce three orders of magnitude on energy consumption of label, and reduce the execution time of the algorithm.

show abstract

Bloom Filter Query Algorithm

Cited by 10 publications

References 33 publications

A Privacy Protection Method of Lightweight Nodes in Blockchain

A Privacy Protection Method of Lightweight Nodes in Blockchain

Identifying Large Flows Based on SDBF Algorithm in High Speed Network Measurement

Missing Tag HPL Detection Algorithm in Large Scale Active RFID System

Contact Info

Product

Resources

About