Efficient Algorithms for Privately Releasing Marginals via Convex Relaxations

Résumé de la théorie métrique des produits tensoriels topologiques

A. Grothendieck · 1953

Earlier work this paper cites.

An algorithm for quadratic programming

M. Frank and P. Wolfe · 1956

Earlier work this paper cites.

Absolutely summing operators in _ \_ { p p }-spaces and their applications

J. Lindenstrauss and A. Pełczyński · 1968

Earlier work this paper cites.

The ellipsoid method and its consequences in combinatorial optimization

M. Grötschel, L. Lovász, and A. Schrijver · 1981

Earlier work this paper cites.

An elementary proof of a theorem of Johnson and Lindenstrauss

S. Dasgupta and A. Gupta · 2003

Earlier work this paper cites.

Revealing information while preserving privacy

I. Dinur and K. Nissim · 2003

Earlier work this paper cites.

Approximating the cut-norm via Grothendieck’s inequality

N. Alon and A. Naor · 2004

Earlier work this paper cites.

Privacy-preserving datamining on vertically partitioned databases

C. Dwork and K. Nissim · 2004

Earlier work this paper cites.

Our data, ourselves: Privacy via distributed noise generation, 2006

C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor · 2006

Earlier work this paper cites.

Calibrating noise to sensitivity in private data analysis

C. Dwork, F. Mcsherry, K. Nissim, and A. Smith · 2006

Earlier work this paper cites.

Privacy, accuracy, and consistency too: a holistic solution to contingency table release

B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar · 2007

Cited alongside, same era.

Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies

S. Khot and A. Naor · 2007

Cited alongside, same era.

A learning theory approach to non-interactive database privacy

A. Blum, K. Ligett, and A. Roth · 2008

Cited alongside, same era.

Concentration of Measure for the Analysis of Randomized Algorithms

D. P. Dubhashi and A. Panconesi · 2009

Cited alongside, same era.

On the complexity of differentially private data release: efficient algorithms and hardness results

C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. Vadhan · 2009

Cited alongside, same era.

Coresets, sparse greedy approximation, and the frank-wolfe algorithm

Interactive privacy via the median mechanism

A. Roth and T. Roughgarden · 2010

Later among the works it cites.

Privately releasing conjunctions and the statistical query barrier

A. Gupta, M. Hardt, A. Roth, and J. Ullman · 2011

Later among the works it cites.

Pcps and the hardness of generating private synthetic data

J. Ullman and S. Vadhan · 2011

Later among the works it cites.

Unconditional differentially private mechanisms for linear queries

A. Bhaskara, D. Dadush, R. Krishnaswamy, and K. Talwar · 2012

Later among the works it cites.

Submodular functions are noise stable

M. Cheraghchi, A. Klivans, P. Kothari, and H. K. Lee · 2012

Later among the works it cites.

A simple and practical algorithm for differentially private data release

M. Hardt, K. Ligett, and F. McSherry · 2012

Later among the works it cites.