scientific article; zbMATH DE number 5485440

zbMATH Open1232.68047MaRDI QIDQ3549600FDOQ3549600

Authors: Cynthia Dwork, Frank McSherry, Kunal Talwar

Publication date: 5 January 2009

Title of this publication is not available (Why is that?)

error rates privacy protection error-correcting codes statistical database polynomial-time decodable random linear codes

Mathematics Subject Classification ID

Linear programming (90C05) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35) Error probability in coding theory (94B70)

Cited In (only showing first 100 items - show all)

Sylvester-Gallai type theorems for approximate collinearity
Title not available (Why is that?)
Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments
Embedding and canonizing graphs of bounded genus in logspace
Homological product codes
Learning privately with labeled and unlabeled examples
Low rank matrix recovery with adversarial sparse noise*
Smoothed analysis of tensor decompositions
A differentially private hybrid approach to traffic monitoring
The Complexity of Differential Privacy
Discrete optimization methods for group model selection in compressed sensing
Fingerprinting codes and the price of approximate differential privacy
Perturbation Paradigms of Maintaining Privacy-Preserving Monotonicity for Differential Privacy
Fingerprinting Codes and the Price of Approximate Differential Privacy
Differentially private distance learning in categorical data
Federated personalized random forest for human activity recognition
Processing text for privacy: an information flow perspective
Algorithmic Stability for Adaptive Data Analysis
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
A characterization of locally testable affine-invariant properties via decomposition theorems
Turnstile streaming algorithms might as well be linear sketches
Testing surface area with arbitrary accuracy
Breaking the Minsky-Papert barrier for constant-depth circuits
Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
Constant rank bimatrix games are PPAD-hard
Measured continuous greedy with differential privacy
The backbone method for ultra-high dimensional sparse machine learning
The Core of the Participatory Budgeting Problem
Analyze Gauss: optimal bounds for privacy-preserving principal component analysis
A Survey on Approximation Mechanism Design Without Money for Facility Games
Efficient and secure outsourcing of differentially private data publication
The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy
On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
On derandomizing algorithms that err extremely rarely
Private matchings and allocations
Title not available (Why is that?)
Infinite randomness expansion with a constant number of devices
Probability comprehension of differential privacy for privacy protection algorithms: A new measure
An Improved Private Mechanism for Small Databases
Privacy and Truthful Equilibrium Selection for Aggregative Games
Zig-zag sort
Preserving differential privacy in deep neural networks with relevance-based adaptive noise imposition
Computing (and Life) Is All about Tradeoffs
From average case complexity to improper learning complexity
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
Fourier PCA and robust tensor decomposition
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
Deciding first-order properties of nowhere dense graphs
On the existence of extractable one-way functions
An almost-optimally fair three-party coin-flipping protocol
Attacks on statistical databases: the highly noisy case
Distributed approximation algorithms for weighted shortest paths
Formulas vs. circuits for small distance connectivity
The sample complexity of revenue maximization
The Matching Polytope has Exponential Extension Complexity
Differentially private nearest neighbor classification
Privacy in implementation
Query complexity of approximate nash equilibria
Efficient density estimation via piecewise polynomial approximation
Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
Hitting sets for multilinear read-once algebraic branching programs, in any order
Polynomial bounds for the grid-minor theorem
Approximate relational Hoare logic for continuous random samplings
Confidentiality and differential privacy in the dissemination of frequency tables
Distribution-invariant differential privacy
Approximate distance oracles with constant query time
Breaking the quadratic barrier for 3-LCC's over the reals
Communication lower bounds via critical block sensitivity
Primal beats dual on online packing LPs in the random-order model
Efficient money burning in general domains
Efficient deterministic approximate counting for low-degree polynomial threshold functions
Lower bounds for depth 4 formulas computing iterated matrix multiplication
Differentially private data release via statistical election to partition sequentially
A characterization of strong approximation resistance
Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
Entropy, optimization and counting
New algorithms and lower bounds for circuits with linear threshold gates
A super-polynomial lower bound for regular arithmetic formulas
How to delegate computations
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
Economic efficiency requires interaction
Comparative study of differentially private data synthesis methods
Solving SDD linear systems in nearly \(m \log^{1/2} n\) time
Privacy, patience, and protection
Secure sampling with sublinear communication
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
Optimal error rates for interactive coding. I: Adaptivity and other settings
A strongly polynomial algorithm for generalized flow maximization
Analytical approach to parallel repetition
Coin flipping of any constant bias implies one-way functions
The geometry of differential privacy: the sparse and approximate cases
Optimal CUR matrix decompositions
\(L_p\)-testing
Satisfiability threshold for random regular NAE-SAT

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549600)