Results 21 to 30 of about 12,077 (255)
Dynamically Allocated Bloom Filter-Based PIT Architectures
IEEE Access, 2022 As a key component in implementing Named Data Networking (NDN), Pending Interest Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup.
Saeyoung Jang, Hayoung Byun, Hyesook Lim
doaj +1 more source
Privacy preserving linkage using multiple dynamic match keys
International Journal of Population Data Science, 2019 Introduction Available and practical methods for privacy preserving linkage have shortcomings: methods utilising anonymous linkage codes provide limited accuracy while methods based on Bloom filters have proven vulnerable to frequency-based attacks ...
Sean Randall +3 more
doaj +1 more source
A cancelable biometric identification scheme based on bloom filter and format-preserving encryption
Journal of King Saud University: Computer and Information Sciences, 2022 Biometric based authentication systems are being prominently used everywhere. The biometric data, popularly known as a biometric template, is generally stored on the database server in its unprotected form.
Vidhi Bansal, Surabhi Garg
doaj +1 more source
PSBF: p-adic Integer Scalable Bloom Filter
Sensors, 2023 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 ...
Wenlong Yi +4 more
doaj +1 more source
A Partially Distributed Intrusion Detection System for Wireless Sensor Networks
Sensors, 2013 The increasing use of wireless sensor networks, which normally comprise several very small sensor nodes, makes their security an increasingly important issue. They can be practically and efficiently secured using intrusion detection systems. Conventional
Eung Jun Cho +3 more
doaj +1 more source
Hash Adaptive Bloom Filter [PDF]
2021 IEEE 37th International Conference on Data Engineering (ICDE), 2021 Bloom filter is a compact memory-efficient probabilistic data structure supporting membership testing, i.e., to check whether an element is in a given set. However, as Bloom filter maps each element with uniformly random hash functions, few flexibilities are provided even if the information of negative keys (elements are not in the set) are available ...
Xie, Rongbiao +6 more
openaire +2 more sources
A Cuckoo Filter Modification Inspired by Bloom Filter [PDF]
AUT Journal of Electrical Engineering, 2019 Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols.
Hananeh Sasaniyan Asl +2 more
doaj +1 more source
Secure Privacy Preserving Record Linkage of Large Databases by Modified Bloom Filter Encodings
International Journal of Population Data Science, 2017 Objective In most European settings, record linkage across different institutions has to be based on personal identifiers such as names, birthday or place of birth. To protect the privacy of research subjects, the identifiers have to be encrypted.
Rainer Schnell, Christian Borgs
doaj +1 more source
Approximate membership query algorithm for incomplete data based on Bloom filter
Dianzi Jishu Yingyong, 2022 More and more scenarios require approximate membership queries for incomplete query data, but traditional Bloom filters for membership queries cannot meet these requirements.
Wu Jiawen +4 more
doaj +1 more source
Set reconciliation based on counting Bloom filters
Tongxin xuebao, 2012 A new set reconciliation algorithm was presented,which called counting-Bloom-filter based set reconciliation(CBFSR).This method represented sets SA and SB as counting Bloom filters,subtracts SA's counting Bloom filter from SB's counting Bloom filter,the ...
Xiao-mei TIAN +5 more
doaj +2 more sources