Space/time trade-offs in hash coding with allowable errors
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Upper and lower bounds on black-box steganography
- Minimal and almost minimal perfect hash function search with application to natural language lexicon design
- Non-expansive hashing
- An algorithm for approximate membership checking with application to password security
- Large scale implementations for Twitter sentiment classification
- Bloom filter-based secure data forwarding in large-scale cyber-physical systems
- A new analysis of the false positive rate of a Bloom filter
- A survey on design and implementation of protected searchable data in the cloud
- PAS: policy-based assistance in sensor networks
- Skyline-join query processing in distributed databases
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
- Supporting early pruning in top-\(k\) query processing on massive data
- Sketching asynchronous data streams over sliding windows
- Improving MinHash via the containment index with applications to metagenomic analysis
- Secure and efficient multiparty private set intersection cardinality
- Robust property-preserving hash functions for Hamming distance and more
- Privacy-preserving authenticated key exchange for constrained devices
- Property-preserving hash functions for Hamming distance from standard assumptions
- Expressive query over outsourced encrypted data
- Server-aided private set intersection based on reputation
- A query privacy-enhanced and secure search scheme over encrypted data in cloud computing
- On the analysis of Bloom filters
- A new protocol for the detection of node replication attacks in mobile wireless sensor networks
- Hardened bloom filters, with an application to unobservability
- Improving the performance of invertible Bloom lookup tables
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
- Partitioned searchable encryption
- Compressed string dictionary search with edit distance one
- Two 2D search filters and their performance analyses
- scientific article; zbMATH DE number 1689608 (Why is no real title available?)
- From Sets to Bits in Coq
- A Survey of Data Structures in the Bitprobe Model
- Performance/security tradeoffs for content-based routing supported by Bloom filters
- Minimal and monotone minimal perfect hash functions
- Towards proofs of ownership beyond bounded leakage
- Low-leakage secure search for Boolean expressions
- Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
- Error analysis for superimposed random coding
- Using fault screeners for software error detection
- Compressing regular expressions' DFA table by matrix decomposition
- Explicit-state model checking
- Privately computing set-union and set-intersection cardinality via Bloom filters
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- Multi-attribute counterfeiting tag identification protocol in large-scale RFID system
- The contig assembly problem and its algorithmic solutions
- Compact Hash Tables Using Bidirectional Linear Probing
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Constructing SAT filters with a quantum annealer
- HordeSat: a massively parallel portfolio SAT solver
- Spatial Bloom filters: enabling privacy in location-aware applications
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Efficient and robust associative memory from a generalized Bloom filter
- Dealing with liars: misbehavior identification via Rényi-Ulam games
- 2d random filter and analysis∗
- Estimating optimal parameters for parallel database hardware
- Random filter and its analysis*
- scientific article; zbMATH DE number 1256770 (Why is no real title available?)
- Dimensioning a multiple hashing scheme
- Cooperative private searching in clouds
- DNA-inspired information concealing: a survey
- Hashing of databases based on indirect observations of Hamming distances
- Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
- Secure deduplication storage systems supporting keyword search
- An exact cooperative method for the uncapacitated facility location problem
- Optimal hashing in external memory
- Buffered Count-Min Sketch on SSD: Theory and Experiments
- A theoretical perspective on hyperdimensional computing
- Verifiable Range Query Processing for Cloud Computing
- An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
- Binary fuse filters: fast and smaller than xor filters
- Computing treewidth on the GPU
- Deep Reinforcement Learning: A State-of-the-Art Walkthrough
- Dynamic behavior matching: a complexity analysis and new approximation algorithms
- Aggregate query processing in the presence of duplicates in wireless sensor networks
- Bloom filter trie -- a data structure for pan-genome storage
- Summary data structures for massive data
- Fast Evaluation of Union-Intersection Expressions
- Security and trust in sensor networks
- Model checking with bounded context switching
- Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
- DOUBLE HASHING WITH MULTIPLE PASSBITS
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- scientific article; zbMATH DE number 7651219 (Why is no real title available?)
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange
- Tight bounds for sliding Bloom filters
- Minimum-latency aggregation scheduling in wireless sensor network
- Xor Filters
- Adaptive Cuckoo Filters
- Multi-party updatable delegated private set intersection
- Hiding the input-size in multi-party private set intersection
- scientific article; zbMATH DE number 7758315 (Why is no real title available?)
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable
- MDOPE: efficient multi-dimensional data order preserving encryption scheme
- An investigation to test spectral segments as bacterial biomarkers
- Private join and compute from PIR with default
- Faster Privacy-Preserving Location Proximity Schemes
- An Almost Non-interactive Order Preserving Encryption Scheme
- Bet-or-pass: adversarially robust Bloom filters
- Flash memory efficient LTL model checking
This page was built for publication: Space/time trade-offs in hash coding with allowable errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5591930)
