Results 261 to 270 of about 696,655 (295)
Some of the next articles are maybe not open access.
Proceedings of the 2017 VI International Conference on Network, Communication and Computing, 2017
A standard technique from the cryptanalysis is to use exhaustive search that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the hash value. But this will take a lot of storage space and the time spent on query will be very long.
Yuanhang Yang, Shuhui Chen
openaire +1 more source
A standard technique from the cryptanalysis is to use exhaustive search that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the hash value. But this will take a lot of storage space and the time spent on query will be very long.
Yuanhang Yang, Shuhui Chen
openaire +1 more source
IEEE/ACM Transactions on Networking, 2001
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this draw-back when the probability of an error is sufficiently low.
openaire +1 more source
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, for many applications the space savings outweigh this draw-back when the probability of an error is sufficiently low.
openaire +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
The deletable Bloom filter: a new member of the Bloom family [PDF]
IEEE Communications Letters, 2010 We introduce the Deletable Bloom filter (DlBF) as a new spin on the popular data structure based on compactly encoding the information of where collisions happen when inserting elements. The DlBF design enables false-negative-free deletions at a fraction of the cost in memory consumption, which turns to be appealing for certain probabilistic filter ...
Fábio Luciano Verdi +1 more
exaly +5 more sources
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
Fast Bloom Filters and Their Generalization
IEEE Transactions on Parallel and Distributed Systems, 2014Bloom filters have been extensively applied in many network functions. Their performance is judged by three criteria: query overhead, space requirement, and false positive ratio. Due to wide applicability, any improvement to the performance of Bloom filters can potentially have a broad impact in many areas of networking research.
Shigang Chen, Yan Qiao
exaly +3 more sources
Ternary Bloom filter replacing counting Bloom filter
2016 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia), 2016A counting Bloom filter (CBF) generalizes a standard 1-bit vector Bloom filter and allows not only membership queries but also insertion and deletion operations for dynamic sets. However, the CBF can cause false negatives because of counter overflows. A 4-bit vector CBF, which provides the probability of false negatives sufficiently small, is generally
Hayoung Byun, Jungwon Lee, Hyesook Lim
openaire +1 more source
PFBF: Pre-Filtered Bloom Filters
2015In this paper we focus on improving the false positive rate of a bloom filter with a pre-filtering scheme. By applying this scheme on a bloom filter, we can quickly screen out lots of input before entering the bloom filter and hence improve the result of false positives.
Ssu-Ting Liu, Sheng-De Wang
openaire +2 more sources
A new Bloom filter structure for identifying true positiveness of a Bloom filter
2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR), 2017Bloom filters have been employed in various fields because of its simple and effective structure in identifying the membership of an input. Since a Bloom filter can produce false positives, the positive results of a Bloom filter should be identified whether the positives are true or not by accessing the original database.
Ju Hyoung Mun, Jungwon Lee, Hyesook Lim
openaire +2 more sources