Image de couverture de livre

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Epasto, Alessandro, Lyu, Xin, Manurangsi, Pasin
Format:	Preprint
Publié:	2026
Sujets:	Cryptography and Security Computational Complexity Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improved Lower Bound for Differentially Private Facility Location
par: Manurangsi, Pasin
Publié: (2024)

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
par: Guruswami, Venkatesan, et autres
Publié: (2025)

Nearly-Optimal Private Selection via Gaussian Mechanism
par: Leeman, Ethan, et autres
Publié: (2025)

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
par: Harrison, Charlie, et autres
Publié: (2025)

Improved Differentially Private Algorithms for Rank Aggregation
par: Hillebrand, Quentin, et autres
Publié: (2025)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
par: Cummings, Rachel, et autres
Publié: (2025)

Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
par: Harrison, Charlie, et autres
Publié: (2025)

Computational Hardness of Private Coreset
par: Ghazi, Badih, et autres
Publié: (2026)

Sublinear Space Graph Algorithms in the Continual Release Model
par: Epasto, Alessandro, et autres
Publié: (2024)

Private Hyperparameter Tuning with Ex-Post Guarantee
par: Ghazi, Badih, et autres
Publié: (2025)

Scalable Private Partition Selection via Adaptive Weighting
par: Chen, Justin Y., et autres
Publié: (2025)

Differentially Private Clustering in Data Streams
par: Epasto, Alessandro, et autres
Publié: (2023)

Differentially Private Ad Conversion Measurement
par: Delaney, John, et autres
Publié: (2024)

Privately Estimating Black-Box Statistics
par: Steinke, Günter F., et autres
Publié: (2025)

InstaHide's Sample Complexity When Mixing Two Private Images
par: Huang, Baihe, et autres
Publié: (2020)

Perfect Zero-Knowledge PCPs for #P
par: Gur, Tom, et autres
Publié: (2024)

Mind the Gap? Not for SVP Hardness under ETH!
par: Aggarwal, Divesh, et autres
Publié: (2025)

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

On the Maximum Distance Sublattice Problem and Closest Vector Problem
par: Kumar, Rajendra, et autres
Publié: (2018)

Improved Hardness of BDD and SVP Under Gap-(S)ETH
par: Bennett, Huck, et autres
Publié: (2021)

The Planted Orthogonal Vectors Problem
par: Kühnemann, David, et autres
Publié: (2025)

On the instance optimality of detecting collisions and subgraphs
par: Ben-Eliezer, Omri, et autres
Publié: (2023)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
par: Ghazi, Badih, et autres
Publié: (2024)

On Computing Pairwise Statistics with Local Differential Privacy
par: Ghazi, Badih, et autres
Publié: (2024)

Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
par: Lyu, Xin, et autres
Publié: (2024)

How Private are DP-SGD Implementations?
par: Chua, Lynn, et autres
Publié: (2024)

Private Synthetic Data Generation in Bounded Memory
par: Holland, Rayne, et autres
Publié: (2024)

The Price of Privacy For Approximating Max-CSP
par: Dharangutte, Prathamesh, et autres
Publié: (2026)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
par: Regehr, Matthew, et autres
Publié: (2026)

Multi-Pass Streaming Lower Bounds for Uniformity Testing
par: Li, Qian, et autres
Publié: (2025)

Linear-Time User-Level DP-SCO via Robust Statistics
par: Ghazi, Badih, et autres
Publié: (2025)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
par: Peter, Naty, et autres
Publié: (2023)

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
par: Golowich, Noah, et autres
Publié: (2024)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
par: Kothari, Robin, et autres
Publié: (2025)

Average-Case Complexity of Quantum Stabilizer Decoding
par: Khesin, Andrey Boris, et autres
Publié: (2025)

The NISQ Complexity of Collision Finding
par: Hamoudi, Yassine, et autres
Publié: (2022)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
par: Dvijotham, Krishnamurthy, et autres
Publié: (2024)