Analyzing and Assessing Pollution Attacks on Bloom Filters: Some Filters are More Vulnerable than Others

In this paper the tasks of managing the directory in coherence maintenance systems in multiprocessor systems with a large number of processors are solved. In microprocessor systems with a large number of processors (MSLP) the problem of maintaining the coherence of processor caches is significantly complicated. This is due to increased traffic on the memory buses and increased complexity of interprocessor communications. This problem is solved in various ways. In this paper, we propose the use of Bloom filters used to accelerate the determination of an element’s belonging to a certain array. In this article, such filters are used to establish the fact that the processor belongs to some subset of the processors and determine if the processor has a cache line in the set. In the paper, the processes of writing and reading information in the data shared between processors are discussed in detail, as well as the process of data replacement from private caches. The article also shows how the addresses of cache lines and processor numbers are removed from the Bloom filters. The system proposed in this paper allows significantly speeding up the implementation of operations to maintain cache coherence in the MSLP as compared to conventional systems. In terms of performance and additional hardware and software costs, the proposed system is not inferior to the most efficient of similar systems, but on some applications and significantly exceeds them.

Download Full-text

Privacy-Preserving Crowd-Monitoring Using Bloom Filters and Homomorphic Encryption

Proceedings of the 4th International Workshop on Edge Systems, Analytics and Networking ◽

10.1145/3434770.3459735 ◽

2021 ◽

Author(s):

Valeriu-Daniel Stanciu ◽

Maarten van Steen ◽

Ciprian Dobre ◽

Andreas Peter

Keyword(s):

Homomorphic Encryption ◽

Privacy Preserving ◽

Bloom Filters ◽

Crowd Monitoring

Download Full-text

Securing Bloom Filters for Privacy-preserving Record Linkage

Proceedings of the 29th ACM International Conference on Information & Knowledge Management ◽

10.1145/3340531.3412105 ◽

2020 ◽

Author(s):

Thilina Ranbaduge ◽

Rainer Schnell

Keyword(s):

Record Linkage ◽

Privacy Preserving ◽

Bloom Filters

Download Full-text

A Secure Protocol against Selfish and Pollution Attacker Misbehavior in Clustered WSNs

Electronics ◽

10.3390/electronics10111244 ◽

2021 ◽

Vol 10 (11) ◽

pp. 1244

Author(s):

Hana Rhim ◽

Damien Sauveron ◽

Ryma Abassi ◽

Karim Tamine ◽

Sihem Guemara

Keyword(s):

Denial Of Service ◽

Base Station ◽

Hierarchical Organization ◽

Secure Routing ◽

Sensor Nodes ◽

Dos Attacks ◽

Linear Network ◽

Secure Protocol ◽

Misbehaving Nodes ◽

Pollution Attacks

Wireless sensor networks (WSNs) have been widely used for applications in numerous fields. One of the main challenges is the limited energy resources when designing secure routing in such networks. Hierarchical organization of nodes in the network can make efficient use of their resources. In this case, a subset of nodes, the cluster heads (CHs), is entrusted with transmitting messages from cluster nodes to the base station (BS). However, the existence of selfish or pollution attacker nodes in the network causes data transmission failure and damages the network availability and integrity. Mainly, when critical nodes like CH nodes misbehave by refusing to forward data to the BS, by modifying data in transit or by injecting polluted data, the whole network becomes defective. This paper presents a secure protocol against selfish and pollution attacker misbehavior in clustered WSNs, known as (SSP). It aims to thwart both selfish and pollution attacker misbehaviors, the former being a form of a Denial of Service (DoS) attack. In addition, it maintains a level of confidentiality against eavesdroppers. Based on a random linear network coding (NC) technique, the protocol uses pre-loaded matrices within sensor nodes to conceive a larger number of new packets from a set of initial data packets, thus creating data redundancy. Then, it transmits them through separate paths to the BS. Furthermore, it detects misbehaving nodes among CHs and executes a punishment mechanism using a control counter. The security analysis and simulation results demonstrate that the proposed solution is not only capable of preventing and detecting DoS attacks as well as pollution attacks, but can also maintain scalable and stable routing for large networks. The protocol means 100% of messages are successfully recovered and received at the BS when the percentage of lost packets is around 20%. Moreover, when the number of misbehaving nodes executing pollution attacks reaches a certain threshold, SSP scores a reception rate of correctly reconstructed messages equal to 100%. If the SSP protocol is not applied, the rate of reception of correctly reconstructed messages is reduced by 90% at the same case.

Download Full-text