Fetching the paper…
Reading the bibliography…
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.
Quick approximation to matrices and applications
A. Frieze and R. Kannan · 1999
Earlier work this paper cites.
A simple algorithm for constructing Szemerédi’s regularity partition
Alan Frieze and Ravi Kannan · 1999
Earlier work this paper cites.
Practical privacy: the SuLQ framework
A. Blum, C. Dwork, F. McSherry, and K. Nissim · 2005
Earlier work this paper cites.
Toward privacy in public databases
S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee · 2005
Earlier work this paper cites.
Approximating the cut-norm via Grothendieck’s inequality
Noga Alon and Assaf 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
Earlier work this paper cites.
Mechanism design via differential privacy
F. McSherry and K. Talwar · 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.
What Can We Learn Privately?
S.P. Kasiviswanathan, H.K. Lee, K. Nissim, S. Raskhodnikova, and A. Smith · 2008
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.
Cut-norms and spectra of matrices
V. Nikiforov · 2009
Cited alongside, same era.
Regularity, boosting, and efficiently simulating every high-entropy distribution
Luca Trevisan, Madhur Tulsiani, and Salil P. Vadhan · 2009
A multiplicative weights mechanism for privacy-preserving data analysis
M. Hardt and G.N. Rothblum · 2010
Later among the works it cites.
On the Geometry of Differential Privacy
M. Hardt and K. Talwar · 2010
Later among the works it cites.
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
Closest in time.
A simple and practical algorithm for differentially private data release
M. Hardt, K. Ligett, and F. McSherry · 2011
Closest in time.
PCPs and the hardness of generating private synthetic data
Jonathan Ullman and Salil P. Vadhan · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Boosting and differential privacy
C. Dwork, G.N. Rothblum, and S. Vadhan · 2010
Cited alongside, same era.