Cover Image

InstaHide's Sample Complexity When Mixing Two Private Images

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Baihe, Song, Zhao, Tao, Runzhou, Yin, Junze, Zhang, Ruizhe, Zhuo, Danyang
Format:	Preprint
Published:	2020
Subjects:	Machine Learning Computational Complexity Cryptography and Security Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms
by: Epasto, Alessandro, et al.
Published: (2026)

Privately Estimating Black-Box Statistics
by: Steinke, Günter F., et al.
Published: (2025)

Perfect Zero-Knowledge PCPs for #P
by: Gur, Tom, et al.
Published: (2024)

Mind the Gap? Not for SVP Hardness under ETH!
by: Aggarwal, Divesh, et al.
Published: (2025)

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

On the Maximum Distance Sublattice Problem and Closest Vector Problem
by: Kumar, Rajendra, et al.
Published: (2018)

Improved Hardness of BDD and SVP Under Gap-(S)ETH
by: Bennett, Huck, et al.
Published: (2021)

The Planted Orthogonal Vectors Problem
by: Kühnemann, David, et al.
Published: (2025)

Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case
by: Guruswami, Venkatesan, et al.
Published: (2025)

On the instance optimality of detecting collisions and subgraphs
by: Ben-Eliezer, Omri, et al.
Published: (2023)

The NISQ Complexity of Collision Finding
by: Hamoudi, Yassine, et al.
Published: (2022)

Average-Case Complexity of Quantum Stabilizer Decoding
by: Khesin, Andrey Boris, et al.
Published: (2025)

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
by: Golowich, Noah, et al.
Published: (2024)

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
by: Kothari, Robin, et al.
Published: (2025)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
by: Dvijotham, Krishnamurthy, et al.
Published: (2024)

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

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

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

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

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

Differentially Private Ad Conversion Measurement
by: Delaney, John, et al.
Published: (2024)

Near-Optimal Generalized Private Testing
by: Chaturvedi, Anamay, et al.
Published: (2026)

Differentially Private Gomory-Hu Trees
by: Aamand, Anders, et al.
Published: (2024)

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

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

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

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

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

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

Skirting Additive Error Barriers for Private Turnstile Streams
by: Aamand, Anders, et al.
Published: (2026)

Nearly-Optimal Private Selection via Gaussian Mechanism
by: Leeman, Ethan, et al.
Published: (2025)

Differentially Private Algorithms for Graphs Under Continual Observation
by: Fichtenberger, Hendrik, et al.
Published: (2021)

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

Private Counting of Distinct Elements in the Turnstile Model and Extensions
by: Henzinger, Monika, et al.
Published: (2024)

Differentially Private Multi-Sampling from Distributions
by: Cheu, Albert, et al.
Published: (2024)

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

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

Exact zCDP Characterizations for Fundamental Differentially Private Mechanisms
by: Harrison, Charlie, et al.
Published: (2025)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
by: Kerschbaum, Florian, et al.
Published: (2025)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
by: Henzinger, Monika, et al.
Published: (2024)