Iterative Constructions and Private Data Release
From MaRDI portal
Abstract: In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of existing algorithms) in both the interactive and non-interactive settings. Our algorithms in the interactive setting are achieved by revisiting the problem of releasing differentially private, approximate answers to a large number of queries on a database. We show that several algorithms for this problem fall into the same basic framework, and are based on the existence of objects which we call iterative database construction algorithms. We give a new generic framework in which new (efficient) IDC algorithms give rise to new (efficient) interactive private query release mechanisms. Our modular analysis simplifies and tightens the analysis of previous algorithms, leading to improved bounds. We then give a new IDC algorithm (and therefore a new private, interactive query release mechanism) based on the Frieze/Kannan low-rank matrix decomposition. This new release mechanism gives an improvement on prior work in a range of parameters where the size of the database is comparable to the size of the data universe (such as releasing all cut queries on dense graphs). We also give a non-interactive algorithm for efficiently releasing private synthetic data for graph cuts with error O(|V|^{1.5}). Our algorithm is based on randomized response and a non-private implementation of the SDP-based, constant-factor approximation algorithm for cut-norm due to Alon and Naor. Finally, we give a reduction based on the IDC framework showing that an efficient, private algorithm for computing sufficiently accurate rank-1 matrix approximations would lead to an improved efficient algorithm for releasing private synthetic data for graph cuts. We leave finding such an algorithm as our main open problem.
Recommendations
- Concurrent composition of differential privacy
- General constructions for information-theoretic private information retrieval
- Privacy by diversity in sequential releases of databases
- Differentially private data releasing for smooth queries
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Distributed Private Data Analysis
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks
Cited in
(90)- Lower bounds on the error of query sets under the differentially-private matrix mechanism
- Order-revealing encryption and the hardness of private learning
- Answering n^2+o(1) counting queries with differential privacy is hard
- Random projections, graph sparsification, and differential privacy
- Mirror descent based database privacy
- Strong hardness of privacy from weak traitor tracing
- An improved private mechanism for small databases
- Fingerprinting codes and the price of approximate differential privacy
- Differential privacy on finite computers
- Fingerprinting codes and the price of approximate differential privacy
- Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
- Private matchings and allocations
- Rounding sum-of-squares relaxations
- Constant factor approximation for balanced cut in the PIE model
- Entropy, optimization and counting
- Polynomial bounds for the grid-minor theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- On derandomizing algorithms that err extremely rarely
- Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
- Lower bounds for depth 4 formulas computing iterated matrix multiplication
- The limits of depth reduction for arithmetic formulas
- A super-polynomial lower bound for regular arithmetic formulas
- A characterization of locally testable affine-invariant properties via decomposition theorems
- L_p-testing
- Turnstile streaming algorithms might as well be linear sketches
- Linear time construction of compressed text indices in compact space
- Formulas vs. circuits for small distance connectivity
- Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Economic efficiency requires interaction
- The sample complexity of revenue maximization
- Optimal competitive auctions
- Homological product codes
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Primal beats dual on online packing LPs in the random-order model
- Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
- Minimum bisection is fixed parameter tractable
- An efficient parallel solver for SDD linear systems
- Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
- From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
- Shortest paths on polyhedral surfaces and terrains
- Embedding and canonizing graphs of bounded genus in logspace
- Testing surface area with arbitrary accuracy
- Coin flipping of any constant bias implies one-way functions
- Infinite randomness expansion with a constant number of devices
- The average sensitivity of an intersection of half spaces
- From average case complexity to improper learning complexity
- Bandits with switching costs, \(T^{2/3}\) regret
- Online local learning via semidefinite programming
- How to use indistinguishability obfuscation
- How to delegate computations
- Circuits resilient to additive attacks with applications to secure computation
- On the existence of extractable one-way functions
- Black-box non-black-box zero knowledge
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- Query complexity of approximate nash equilibria
- Constant rank bimatrix games are PPAD-hard
- Approximation algorithms for bipartite matching with metric and geometric costs
- Distributed approximation algorithms for weighted shortest paths
- Parallel algorithms for geometric graph problems
- Fourier PCA and robust tensor decomposition
- Smoothed analysis of tensor decompositions
- Efficient density estimation via piecewise polynomial approximation
- Analytical approach to parallel repetition
- A characterization of strong approximation resistance
- A strongly polynomial algorithm for generalized flow maximization
- Approximate distance oracles with constant query time
- Faster all-pairs shortest paths via circuit complexity
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
- Zig-zag sort
- Community detection thresholds and the weak Ramanujan property
- Distributed computability in Byzantine asynchronous systems
- Multiway cut, pairwise realizable distributions, and descending thresholds
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Non-malleable codes from additive combinatorics (extended abstract)
- Breaking the quadratic barrier for 3-LCC's over the reals
- Optimal error rates for interactive coding. I: Adaptivity and other settings
- The asymptotic \(k\)-SAT threshold
- Satisfiability threshold for random regular NAE-SAT
- Efficient deterministic approximate counting for low-degree polynomial threshold functions
- Communication lower bounds via critical block sensitivity
- Computing with a full memory: catalytic space
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Differentially private range query on shortest paths
- How to DP-fy your data: a practical guide to generating synthetic data with differential privacy
This page was built for publication: Iterative Constructions and Private Data Release
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891493)
