Publication:3549600

Kunal Talwar, Cynthia Dwork, Frank McSherry

Publication date: 5 January 2009

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

Mathematics Subject Classification ID

68P15: Database theory

90C05: Linear programming

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

94B35: Decoding

94B70: Error probability in coding theory

Related Items

New algorithms and lower bounds for circuits with linear threshold gates, Deciding First-Order Properties of Nowhere Dense Graphs, The Matching Polytope has Exponential Extension Complexity, The average sensitivity of an intersection of half spaces, Economic efficiency requires interaction, Fingerprinting codes and the price of approximate differential privacy, Analyze gauss, 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, 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, Breaking the minsky-papert barrier for constant-depth circuits, 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, 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, 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, From average case complexity to improper learning complexity, Bandits with switching costs, 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, 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, Attacks on statistical databases: the highly noisy case, Optimal data-independent noise for differential privacy, Efficient money burning in general domains, Truthful Mechanisms with Implicit Payment Computation, The Geometry of Differential Privacy: The Small Database and Approximate Cases, Computing (and Life) Is All about Tradeoffs, Pufferfish, SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY, A Survey on Approximation Mechanism Design Without Money for Facility Games, Buying Data from Privacy-Aware Individuals: The Effect of Negative Payments, The Core of the Participatory Budgeting Problem, Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes, An Almost-Optimally Fair Three-Party Coin-Flipping Protocol, Optimal CUR Matrix Decompositions, EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS, What Can We Learn Privately?, Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region, Communication is Bounded by Root of Rank, Are Lock-Free Concurrent Algorithms Practically Wait-Free?, Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices, The Power of Localization for Efficiently Learning Linear Separators with Noise, Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds, Bounds on the Sample Complexity for Private Learning and Private Data Release, An Improved Private Mechanism for Small Databases, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Privacy and Truthful Equilibrium Selection for Aggregative Games, Distributed Private Data Analysis: Simultaneously Solving How and What, Non-malleable codes from additive combinatorics, Breaking the quadratic barrier for 3-LCC's over the reals, Optimal error rates for interactive coding I, 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, Hitting sets for multilinear read-once algebraic branching programs, in any order, Probability comprehension of differential privacy for privacy protection algorithms: A new measure, Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)