Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 92 for “"Bloom filter"”.

  1. Bloom Filter Based Intrusion Detection for Smart Grid

    … using a combination of n-gram analysis and Bloom Filter. The predictable and regular nature of the SCADA communication patterns is exploited to train the intrusion detection system. The protocol considered to test the proposed approach is MODBUS which is used for communication between a …

    tamu Repository record for Bloom Filter Based Intrusion Detection for Smart Grid (opens in a new tab)

  2. Idempotent distributed counters using a Forgetful Bloom Filter

    … server-side data structure called the Forgetful Bloom Filter (FBF). Like a traditional Bloom filter, an FBF is a compact representation of a set of elements (e.g., client requests). However, an FBF is more powerful than a Bloom filter in two aspects: i) it can forget older elements (e.g., …

    uiuc Repository record for Idempotent distributed counters using a Forgetful Bloom Filter (opens in a new tab)

  3. The Hierarchical Interleaved Bloom Filter: Algorithmic design of a novel data structure for fast approximate sequence queries

    … data structure, the Hierarchical Interleaved Bloom Filter (HIBF), that proposes a substantial leap in performance for approximate set membership queries. It can serve as an efficient prefilter that enables fast genetic database searches. While building on its predecessor, the Interleaved Bloom …

    fu-berlin Repository record for The Hierarchical Interleaved Bloom Filter: Algorithmic design of a novel data structure for fast approximate sequence queries (opens in a new tab)

  4. Role based access control and authentication for SCADA field devices using a dual Bloom filter and challenge-response.

    … describes the design and analysis of a dual Bloom filter structure for use in a field device security preprocessor. A dual Bloom filter is a variant of the traditional Bloom filter, that performs role based access checks in O(1) time. It is shown this structure, which can produce false …

    louisville Repository record for Role based access control and authentication for SCADA field devices using a dual Bloom filter and challenge-response. (opens in a new tab)

  5. A Statistically Rigorous Evaluation of the Cascade Bloom Filter for Distributed Access Enforcement in Role-Based Access Control (RBAC) Systems

    … been proposed for enforcement: the Cascade Bloom Filter. The Cascade Bloom Filter is an extension of the Bloom filter, and provides for time- and space-efficient encodings of sets. We compare the Cascade Bloom Filter to the Bloom Filter, and another approach called Authorization Recycling …

    waterloo Repository record for A Statistically Rigorous Evaluation of the Cascade Bloom Filter for Distributed Access Enforcement in Role-Based Access Control (RBAC) Systems (opens in a new tab)

  6. Graphics Processing Unit Bloom Filters: Classical and Probabilistic

    … data structure used in Computer Science is the Bloom Filter, which is used in many types of applications including databases and security logging. The Bloom Filter is a lossy data structure that uses several hash functions to store keys into a bit array. A novel, new Bloom Filter meant for use …

    ut-knoxville Repository record for Graphics Processing Unit Bloom Filters: Classical and Probabilistic (opens in a new tab)

  7. State-Efficient Forwarding with In-packet Bloom Filters

    … to the receiver is encoded in a space-efficient Bloom filter, that is inserted in the packet header, and each router on the path can effiently verify the outgoing links where the packet should be delivered to. Bloom filter-based forwarding has some advantages over IP forwarding. First, with Bloom …

    aalto Repository record for State-Efficient Forwarding with In-packet Bloom Filters (opens in a new tab)

  8. BloomCasting for publish/subscribe networks

    … work is divided into two areas: rendezvous and Bloomcasting, i.e. fast Bloom filter-based forwarding architecture for source-specific multicast. Taken together these are combined as a publish/subscribe architecture, where publisher and subscriber matching is done by the rendezvous and Bloom …

    aalto Repository record for BloomCasting for publish/subscribe networks (opens in a new tab)

  9. Saving Energy in Network Hosts With an Application Layer Proxy: Design and Evaluation of New Methods That Utilize Improved Bloom Filters

    … for reducing the false positive rate of a Bloom filter was explored. A Best-of-N Bloom filter was developed, which was shown to have a lower false positive rate than a standard Bloom filter and the Power-of-2 Bloom filter. An analysis of the Best-of-N Bloom Filter was completed using Order …

    usf Repository record for Saving Energy in Network Hosts With an Application Layer Proxy: Design and Evaluation of New Methods That Utilize Improved Bloom Filters (opens in a new tab)

  10. Assessment of Privacy-Preserving Record Linkage Methods for Integrating Homelessness Datasets in Calgary

    … were encoded using regular and hardened Bloom filters, and four supervised methods were compared with the unsupervised Fellegi--Sunter model. A frequency-based attack re-identified 52.2%-100% of records under the regular Bloom filter, compared with only 0.9%-10.5% under the hardened Bloom …

    calgary Repository record for Assessment of Privacy-Preserving Record Linkage Methods for Integrating Homelessness Datasets in Calgary (opens in a new tab)

  11. An Efficient and Secure Cross-Group Data Deduplication Scheme for Cloud Storage

    … duplicate detection. First, a dual Bloom filter architecture uses a Temporary Bloom Filter (TBF) for newly generated tags and a Permanent Bloom Filter (PBF) for historical tags, improving timely checks and reducing missed detections during synchronization. Second, controlled tag …

    queens Repository record for An Efficient and Secure Cross-Group Data Deduplication Scheme for Cloud Storage (opens in a new tab)

  12. Hot and cold data identification: applications to storage devices and systems.

    … hot data identification schemes: (1) multiple bloom filter-based scheme and (2) sampling-based scheme. Then I apply them to the storage device and system such as Solid State Drives (SSD) and data deduplication system. In the multiple bloom filter-based hot data identification scheme, I adopt …

    umn Repository record for Hot and cold data identification: applications to storage devices and systems. (opens in a new tab)

  13. Space-efficient data sketching algorithms for network applications

    … accounting, anomaly detection and etc. Bloom filters and counter braids are two well-known representatives in this category. Those sketching algorithms usually need to strike a tradeoff between performance (how much information can be revealed and how fast) and cost (storage, …

    gatech Repository record for Space-efficient data sketching algorithms for network applications (opens in a new tab)

  14. Efficient data search and synchronization for tree-structured data on mobile devices

    … on a special data structure we proposed, called Bloom Filter Tree. It is to compute a bloom filter for each interior node of the tree, essentially building a co-existing BF-tree to enhance the original data tree in order to allow more operations. Using the BF-tree, these two processes become …

    uoit Repository record for Efficient data search and synchronization for tree-structured data on mobile devices (opens in a new tab)

  15. Hardware acceleration for power efficient deep packet inspection

    … compressions of the DFAs. In this work, Bloom filters are used to implement DPI on an FPGA for hardware acceleration with the design of a parallel architecture. Furthermore, devoted at a balance of power and performance, an energy efficient adaptive Bloom filter is designed with the …

    dcu Download PDF for Hardware acceleration for power efficient deep packet inspection (opens in a new tab)

  16. Multi-attribute query resolution in structured peer-to-peer networks

    … Communication within the network is done using Bloom filters as a data structure, which represents the resources satisfying different attribute values. The novelty of the architecture and the communication methodology lies in the fact that architecture facilitates any number of attributes having …

    colostate Repository record for Multi-attribute query resolution in structured peer-to-peer networks (opens in a new tab)

  17. Optimizing network data transfer by profile aggregation, resource selection and data redundancy elimination

    … are based on summary exchange and make use of Bloom filter. To show the viability of these algorithms, we present a comprehension generation scenario for the mobile search engines and evaluate it with the existing semantic search engine. In order to build a better Bloom filter, we propose two …

    unsw Repository record for Optimizing network data transfer by profile aggregation, resource selection and data redundancy elimination (opens in a new tab)

  18. Achieving Energy Efficiency on Networking Systems with Optimization Algorithms and Compressed Data Structures

    … A novel data structure called the Probabilistic Bloom Filter (PBF), which extends the classical bloom filter into the probabilistic direction, so that it can effectively identify heavy hitters with a small memory foot print to reduce energy consumption of network measurement.</p> <p>To achieve …

    utk-theses Repository record for Achieving Energy Efficiency on Networking Systems with Optimization Algorithms and Compressed Data Structures (opens in a new tab)

  19. Improving sequence analysis with probabilistic data structures and algorithms

    … concept is a probabilistic data structure, the Bloom filter, which enables low memory indexing with high computational efficiency at the cost of false-positive queries by storing a signature of a sequence rather than the sequence itself. This thesis explores high-performance applications of this …

    ubc Repository record for Improving sequence analysis with probabilistic data structures and algorithms (opens in a new tab) Download PDF for Improving sequence analysis with probabilistic data structures and algorithms (opens in a new tab)

Page 1 of 5