Cover Image

Invertible Bloom Lookup Tables with Less Memory and Randomness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fleischhacker, Nils, Larsen, Kasper Green, Obremski, Maciej, Simkin, Mark
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adversary Resilient Learned Bloom Filters
by: Almashaqbeh, Ghada, et al.
Published: (2024)

A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
by: Shishir, Fairuz Shadmani, et al.
Published: (2024)

Private Synthetic Data Generation in Bounded Memory
by: Holland, Rayne, et al.
Published: (2024)

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
by: Dolev, Shlomi
Published: (2025)

Separating Oblivious and Adaptive Differential Privacy under Continual Observation
by: Bun, Mark, et al.
Published: (2026)

Counting Distinct Elements in the Turnstile Model with Differential Privacy under Continual Observation
by: Jain, Palak, et al.
Published: (2023)

Triangle Counting with Local Edge Differential Privacy
by: Eden, Talya, et al.
Published: (2023)

Differentially Private Continual Release of Histograms and Related Queries
by: Henzinger, Monika, et al.
Published: (2023)

Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
by: Dong, Wei, et al.
Published: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
by: Goodrich, Michael T., et al.
Published: (2024)

Private Lossless Multiple Release
by: Andersson, Joel Daniel, et al.
Published: (2025)

Space-Efficient Private Estimation of Quantiles
by: Cafaro, Massimo, et al.
Published: (2025)

Fast and Optimal Differentially Private Frequent-Substring Mining
by: Guo, Peaker, et al.
Published: (2026)

Differentially Private Matchings
by: Dinitz, Michael, et al.
Published: (2025)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
by: Ghazi, Badih, et al.
Published: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
by: Chandra, Rishi, et al.
Published: (2024)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
by: Aggarwal, Divesh, et al.
Published: (2020)

Private Hyperparameter Tuning with Ex-Post Guarantee
by: Ghazi, Badih, et al.
Published: (2025)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
by: Cummings, Rachel, et al.
Published: (2025)

It is high time we let go of the Mersenne Twister
by: Vigna, Sebastiano
Published: (2019)

On Learning Parities with Dependent Noise
by: Golowich, Noah, et al.
Published: (2024)

Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)

Local Node Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2026)

On Wagner's k-Tree Algorithm Over Integers
by: Lin, Haoxing, et al.
Published: (2024)

Differentially Private Set Representations
by: Patel, Sarvar, et al.
Published: (2025)

Scalable Private Partition Selection via Adaptive Weighting
by: Chen, Justin Y., et al.
Published: (2025)

Fine-Grained Privacy Guarantees for Coverage Problems
by: Dhulipala, Laxman, et al.
Published: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
by: Hladík, Richard, et al.
Published: (2024)

The Price of Privacy For Approximating Max-CSP
by: Dharangutte, Prathamesh, et al.
Published: (2026)

Sublinear Space Graph Algorithms in the Continual Release Model
by: Epasto, Alessandro, et al.
Published: (2024)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
by: Dhulipala, Laxman, et al.
Published: (2025)

Improved Lower Bound for Differentially Private Facility Location
by: Manurangsi, Pasin
Published: (2024)

Profile Reconstruction from Private Sketches
by: Wu, Hao, et al.
Published: (2024)

Continual Counting with Gradual Privacy Expiration
by: Andersson, Joel Daniel, et al.
Published: (2024)

Count on Your Elders: Laplace vs Gaussian Noise
by: Andersson, Joel Daniel, et al.
Published: (2024)

Data Structures Meet Cryptography: 3SUM with Preprocessing
by: Golovnev, Alexander, et al.
Published: (2019)

Hardening Confidential Federated Compute against Side-channel Attacks
by: Bell-Clark, James, et al.
Published: (2026)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
by: Thießen, Thore, et al.
Published: (2024)

Differential privacy and Sublinear time are incompatible sometimes
by: Blocki, Jeremiah, et al.
Published: (2024)