Fetching the paper…
Reading the bibliography…
We derive the optimal $\epsilon$-differentially private mechanism for single real-valued query function under a very general utility-maximization (or cost-minimization) framework.
S. Shamai and S. Verdu, “Worst-case power-constrained noise for binary-input channels,” Information Theory, IEEE Transactions on , vol. 38, no. 5, pp. 1494–1511, 1992
1992
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Theory of Cryptography , ser. Lecture Notes in Computer Science, S. Halevi and T. Rabin, Eds. Springer Berlin / Heidelberg, 2006, vol. 3876, pp. 265–284
2006
Earlier work this paper cites.
C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor, “Our data, ourselves: privacy via distributed noise generation,” in Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques , ser. EUROCRYPT’06. Berlin, Heidelberg: Springer-Verlag, 2006, pp. 486–503. [Online]. Available: http://dx.doi.org/10.1007/11761679_29
2006
Earlier work this paper cites.
B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar, “Privacy, accuracy, and consistency too: a holistic solution to contingency table release,” in Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , ser. PODS ’07. New York, NY, USA: ACM, 2007, pp. 273–282. [Online]. Available: http://doi.acm.org/10.1145/1265530.1265569
2007
Earlier work this paper cites.
K. Nissim, S. Raskhodnikova, and A. Smith, “Smooth sensitivity and sampling in private data analysis,” in Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , ser. STOC ’07. New York, NY, USA: ACM, 2007, pp. 75–84. [Online]. Available: http://doi.acm.org/10.1145/1250790.1250803
2007
Earlier work this paper cites.
F. McSherry and K. Talwar, “Mechanism design via differential privacy,” in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science , ser. FOCS ’07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 94–103. [Online]. Available: http://dx.doi.org/10.1109/FOCS.2007.41
2007
Earlier work this paper cites.
C. Dwork, “Differential Privacy: A Survey of Results,” in Theory and Applications of Models of Computation , vol. 4978, 2008, pp. 1–19
2008
Earlier work this paper cites.
K. Chaudhuri and C. Monteleoni, “Privacy-preserving logistic regression,” in Neural Information Processing Systems , 2008, pp. 289–296
2008
Earlier work this paper cites.
A. Ghosh, T. Roughgarden, and M. Sundararajan, “Universally utility-maximizing privacy mechanisms,” in Proceedings of the 41st annual ACM symposium on Theory of computing , ser. STOC ’09. New York, NY, USA: ACM, 2009, pp. 351–360. [Online]. Available: http://doi.acm.org/10.1145/1536414.1536464
2009
Earlier work this paper cites.
L. Wasserman and S. Zhou, “A statistical framework for differential privacy,” Journal of the American Statistical Association , vol. 105, no. 489, pp. 375–389, 2010. [Online]. Available: http://amstat.tandfonline.com/doi/abs/10.1198/jasa.2009.tm08651
2009
Earlier work this paper cites.
F. McSherry and I. Mironov, “Differentially private recommender systems: building privacy into the net,” in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining , ser. KDD ’09. New York, NY, USA: ACM, 2009, pp. 627–636. [Online]. Available: http://doi.acm.org/10.1145/1557019.1557090
2009
Earlier work this paper cites.
C. Dwork and J. Lei, “Differential privacy and robust statistics,” in Proceedings of the 41st annual ACM symposium on Theory of computing , ser. STOC ’09. New York, NY, USA: ACM, 2009, pp. 371–380. [Online]. Available: http://doi.acm.org/10.1145/1536414.1536466
2009
Earlier work this paper cites.
M. Hardt and K. Talwar, “On the geometry of differential privacy,” in Proceedings of the 42nd ACM symposium on Theory of computing , ser. STOC ’10. New York, NY, USA: ACM, 2010, pp. 705–714. [Online]. Available: http://doi.acm.org/10.1145/1806689.1806786
2010
Earlier work this paper cites.
C. Li, M. Hay, V. Rastogi, G. Miklau, and A. McGregor, “Optimizing linear counting queries under differential privacy,” in Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , ser. PODS ’10. New York, NY, USA: ACM, 2010, pp. 123–134. [Online]. Available: http://doi.acm.org/10.1145/1807085.1807104
2010
Earlier work this paper cites.
H. Brenner and K. Nissim, “Impossibility of differentially private universally optimal mechanisms,” in Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on , oct. 2010, pp. 71 –80
2010
Earlier work this paper cites.
M. Gupte and M. Sundararajan, “Universally optimal privacy mechanisms for minimax agents,” in Symposium on Principles of Database Systems , 2010, pp. 135–146
2010
Earlier work this paper cites.
F. McSherry, “Privacy integrated queries: an extensible platform for privacy-preserving data analysis,” Commun. ACM , vol. 53, no. 9, pp. 89–97, Sep. 2010. [Online]. Available: http://doi.acm.org/10.1145/1810891.1810916
2010
Earlier work this paper cites.
A. Roth and T. Roughgarden, “Interactive privacy via the median mechanism,” in Proceedings of the 42nd ACM symposium on Theory of computing , ser. STOC ’10. New York, NY, USA: ACM, 2010, pp. 765–774. [Online]. Available: http://doi.acm.org/10.1145/1806689.1806794
2010
Cited alongside, same era.
C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum, “Differential privacy under continual observation,” in Proceedings of the 42nd ACM symposium on Theory of computing , ser. STOC ’10. New York, NY, USA: ACM, 2010, pp. 715–724. [Online]. Available: http://doi.acm.org/10.1145/1806689.1806787
2010
Cited alongside, same era.
M. Hardt and G. N. Rothblum, “A multiplicative weights mechanism for privacy-preserving data analysis,” in Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , ser. FOCS ’10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 61–70. [Online]. Available: http://dx.doi.org/10.1109/FOCS.2010.85
2010
Cited alongside, same era.
V. Karwa, S. Raskhodnikova, A. Smith, and G. Yaroslavtsev, “Private analysis of graph structure,” in Proc. vldb , vol. 11, 2011
2011
Later among the works it cites.
J. Soria-Comas and J. Domingo-Ferrer, “On differential privacy and data utility in sdc,” slides in UNECE/Eurostat Work Session on Statistical Data Confidentiality, 2011. [Online]. Available: http://www.unece.org/fileadmin/DAM/stats/documents/ece/ces/ge.46/2011/presentations/Topic_4__24__Soria-Comas_Domingo.pdf
2011
Later among the works it cites.
2012
Closest in time.
M. Hardt, K. Ligett, and F. McSherry, “A simple and practical algorithm for differentially private data release,” in Advances in Neural Information Processing Systems , P. Bartlett, F. Pereira, C. Burges, L. Bottou, and K. Weinberger, Eds., 2012, pp. 2348–2356. [Online]. Available: http://books.nips.cc/papers/files/nips25/NIPS2012_1143.pdf
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Friedman and A. Schuster, “Data mining with differential privacy,” in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , ser. KDD ’10. New York, NY, USA: ACM, 2010, pp. 493–502. [Online]. Available: http://doi.acm.org/10.1145/1835804.1835868
2010
Cited alongside, same era.
L. Wasserman and S. Zhou, “A statistical framework for differential privacy,” Journal of the American Statistical Association , vol. 105, no. 489, pp. 375–389, 2010
2010
Cited alongside, same era.
C. Dwork, M. Naor, T. Pitassi, G. N. Rothblum, and S. Yekhanin, “Pan-private streaming algorithms,” in In Proceedings of ICS , 2010
2010
Cited alongside, same era.
A. Gupta, K. Ligett, F. McSherry, A. Roth, and K. Talwar, “Differentially private combinatorial optimization,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms , ser. SODA ’10. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2010, pp. 1106–1125. [Online]. Available: http://dl.acm.org/citation.cfm?id=1873601.1873691
2010
Cited alongside, same era.
M. Hay, V. Rastogi, G. Miklau, and D. Suciu, “Boosting the accuracy of differentially private histograms through consistency,” Proc. VLDB Endow. , vol. 3, no. 1-2, pp. 1021–1032, Sep. 2010. [Online]. Available: http://dl.acm.org/citation.cfm?id=1920841.1920970
2010
Cited alongside, same era.
X. Xiao, G. Wang, and J. Gehrke, “Differential privacy via wavelet transforms,” IEEE Transactions on Knowledge and Data Engineering , vol. 23, no. 8, pp. 1200–1214, 2011
2011
Cited alongside, same era.
Y. Lindell and E. Omri, “A practical application of differential privacy to personalized online advertising.” IACR Cryptology ePrint Archive , vol. 2011, p. 152, 2011. [Online]. Available: http://dblp.uni-trier.de/db/journals/iacr/iacr2011.html\#LindellO11
2011
Cited alongside, same era.
A. Smith, “Privacy-preserving statistical estimation with optimal convergence rates,” in Proceedings of the 43rd annual ACM symposium on Theory of computing , ser. STOC ’11. New York, NY, USA: ACM, 2011, pp. 813–822. [Online]. Available: http://doi.acm.org/10.1145/1993636.1993743
2011
Cited alongside, same era.
B. Ding, M. Winslett, J. Han, and Z. Li, “Differentially private data cubes: optimizing noise sources and consistency,” in Proceedings of the 2011 ACM SIGMOD International Conference on Management of data , ser. SIGMOD ’11. New York, NY, USA: ACM, 2011, pp. 217–228. [Online]. Available: http://doi.acm.org/10.1145/1989323.1989347
2011
Cited alongside, same era.
2012
Closest in time.
Z. Huang, S. Mitra, and G. Dullerud, “Differentially private iterative synchronous consensus,” in Proceedings of the 2012 ACM workshop on Privacy in the electronic society , ser. WPES ’12. New York, NY, USA: ACM, 2012, pp. 81–90. [Online]. Available: http://doi.acm.org/10.1145/2381966.2381978
2012
Closest in time.
M. E. Andrés, N. E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, “Geo-Indistinguishability: Differential Privacy for Location-Based Systems,” ArXiv e-prints , December 2012
2012
Closest in time.
I. Mironov, “On significance of the least significant bits for differential privacy,” in Proceedings of the 2012 ACM conference on Computer and communications security , ser. CCS ’12. New York, NY, USA: ACM, 2012, pp. 650–661. [Online]. Available: http://doi.acm.org/10.1145/2382196.2382264
2012
Closest in time.
F. K. Dankar and K. El Emam, “The application of differential privacy to health data,” in Proceedings of the 2012 Joint EDBT/ICDT Workshops , ser. EDBT-ICDT ’12. New York, NY, USA: ACM, 2012, pp. 158–166. [Online]. Available: http://doi.acm.org/10.1145/2320765.2320816
2012
Closest in time.
J. Zhang, Z. Zhang, X. Xiao, Y. Yang, and M. Winslett, “Functional mechanism: regression analysis under differential privacy,” Proceedings of the VLDB Endowment , vol. 5, no. 11, pp. 1364–1375, 2012
2012
Closest in time.
J. Hsu, S. Khanna, and A. Roth, “Distributed private heavy hitters,” Automata, Languages, and Programming , pp. 461–472, 2012
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
M. Hardt, G. N. Rothblum, and R. A. Servedio, “Private data release via learning thresholds,” in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms . SIAM, 2012, pp. 168–187
2012
Closest in time.
A. Gupta, A. Roth, and J. Ullman, “Iterative constructions and private data release,” Theory of Cryptography , pp. 339–356, 2012
2012
Closest in time.
G. Cormode, C. Procopiuc, D. Srivastava, E. Shen, and T. Yu, “Differentially private spatial decompositions,” in Data Engineering (ICDE), 2012 IEEE 28th International Conference on . IEEE, 2012, pp. 20–31
2012
Closest in time.
S. P. Kasiviswanathan, K. Nissim, S. Raskhodnikova, and A. Smith, “Analyzing graphs with node differential privacy,” in Theory of Cryptography . Springer, 2013, pp. 457–476
2013
Closest in time.