Results 31 to 40 of about 13,604 (287)
Privacy preserving linkage using multiple dynamic match keys
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
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
Bloom Filters in Adversarial Environments [PDF]
Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and correctness are analyzed using probabilistic tools under the assumption that the inputs and queries are independent of the internal randomness of the data structure.
Moni Naor, Eylon Yogev
openaire +3 more sources
PSBF: p-adic Integer Scalable Bloom Filter
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
Partitioned Learned Bloom Filter
Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives. Recently, variations referred to as learned Bloom filters were developed that can provide improved performance in terms of the rate of false positives, by using a learned model for the ...
Kapil Vaidya +3 more
openaire +3 more sources
Extraction of fingerprint from regular expression for efficient prefiltering [PDF]
Deep packet inspection at high speed has become extremely important due to its application in a wide range of network applications, such as network security and network monitoring. Network intrusion detection system (NIDS) uses a collection of signatures
Wang, Xiaojun +11 more
core +1 more source
A Partially Distributed Intrusion Detection System for Wireless Sensor Networks
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]
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 ...
Rongbiao Xie +6 more
openaire +2 more sources
Secure Privacy Preserving Record Linkage of Large Databases by Modified Bloom Filter Encodings
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
A Cuckoo Filter Modification Inspired by Bloom Filter [PDF]
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

