Results 261 to 270 of about 2,234,842 (311)
Some of the next articles are maybe not open access.
Multi-biometric template protection based on bloom filters
Information Fusion, 2018Biometric verification systems are currently being deployed in numerous large-scale and everyday applications. It is hence of the utmost importance to protect the privacy of the enrolled subjects.
M. Gomez-Barrero +5 more
semanticscholar +1 more source
Pollution Attacks on Counting Bloom Filters for Black Box Adversaries
Conference on Network and Service Management, 2020The wide adoption of Bloom filters makes their security an important issue to be addressed. For example, an attacker can increase their error rate through polluting and eventually saturating the filter by inserting elements that set to one a large number
P. Reviriego, Ori Rottenstreich
semanticscholar +1 more source
Effect of Hadamard multiplication on bloom filter and double bloom filter transformations
SECURITY AND PRIVACY, 2023AbstractIris biometric is the most common and widely accepted biometric authentication method due to its high accuracy. The iris biometric template should be protected to overcome security and privacy attacks. The two standard iris biometric template protection methods are bloom filter and double bloom filter‐based feature transformations.
Ajish Sreedharan, K. S. Anil Kumar
openaire +2 more sources
Adaptive Learned Bloom Filters under Incremental Workloads
COMAD/CODS, 2020The recently proposed paradigm of learned Bloom filters (LBF) seems to offer significant advantages over traditional Bloom filters in terms of low memory footprint and overall performance as evidenced by empirical evaluations over static data.
Arindam Bhattacharya +2 more
semanticscholar +1 more source
Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter
IEEE Communications Letters, 2015The use of Bloom filters in network applications has increased rapidly. Since Bloom filters can produce false positives, the trueness of each positive needs to be identified by referring to an off-chip hash table. This letter proposes a new method for identifying the trueness of Bloom filter positives.
Hyesook Lim, Jungwon Lee, Changhoon Yim
openaire +1 more source
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks, 2010 Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in ...
Deke Guo
exaly +2 more sources
Ultra-Fast Bloom Filters using SIMD Techniques
IEEE Transactions on Parallel and Distributed Systems, 2019The network link speed is growing at an ever-increasing rate, which requires all network functions on routers/switches to keep pace. Bloom filter is a widely-used membership check data structure in networking applications.
Jianyuan Lu +7 more
semanticscholar +1 more source
A Bloom filter variant for Blockchain
Concurrency and Computation: Practice and Experience, 2021AbstractBlockchain is a single linked list of blocks consisting of transactions identified by their hash value. Querying Blockchain, primarily searching blocks/transactions, can be treated as membership queries and efficiently evaluated by a Bloom filter (BF).
Xing Fan, Baoning Niu
openaire +1 more source
2015
Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a
Martin Werner 0001, Mirco Schönfeld
openaire +1 more source
Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a
Martin Werner 0001, Mirco Schönfeld
openaire +1 more source
A Distributed Event-Based System based on Compressed Fragmented-Iterated Bloom Filters
Future Generation Computer Systems, 2017 In this research, we propose the construction of a new architecture of Fragmented-Iterated Bloom Filters to redirect events of a distributed event-based system.
Pierre Leone
exaly +2 more sources