Renyi Differential Privacy

A. Rényi, “On measures of entropy and information,” in Proceedings of the fourth Berkeley symposium on mathematical statistics and probability , vol. 1, 1961, pp. 547–561

1961

Earlier work this paper cites.

F. Liese and I. Vajda, Convex Statistical Distances . Teubner, 1987

1987

Earlier work this paper cites.

C. Dwork, F. McSherry, K. Nissim, and A. D. Smith, “Calibrating noise to sensitivity in private data analysis,” in Third Theory of Cryptography Conference, TCC 2006 , S. Halevi and T. Rabin, Eds. Springer, 2006, 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 Advances in Cryptography—Eurocrypt ’06 . Springer, 2006, pp. 486–503

2006

Earlier work this paper cites.

I. Mironov, O. Pandey, O. Reingold, and S. P. Vadhan, “Computational differential privacy,” in Advances in Cryptology—CRYPTO 2009 , S. Halevi, Ed., 2009, pp. 126–142

2009

Earlier work this paper cites.

F. D. McSherry, “Privacy integrated queries: an extensible platform for privacy-preserving data analysis,” in Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data , C. Binnig and B. Dageville, Eds., 2009, pp. 19–30

2009

Earlier work this paper cites.

Y. Mansour, M. Mohri, and A. Rostamizadeh, “Multiple source adaptation and the Rényi divergence,” in UAI ’09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence . AUAI Press, Jun. 2009, pp. 367–374

2009

Earlier work this paper cites.

C. Dwork, G. N. Rothblum, and S. Vadhan, “Boosting and differential privacy,” in 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS) , L. Trevisan, Ed. IEEE, Oct. 2010, pp. 51–60

2010

Earlier work this paper cites.

A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. Vadhan, “The limits of two-party differential privacy,” in 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS) , L. Trevisan, Ed. IEEE, 2010, pp. 81–90

2010

Earlier work this paper cites.

A. Groce, J. Katz, and A. Yerukhimovich, “Limits of computational differential privacy in the client/server setting,” in Theory of Cryptography—8th Theory of Cryptography Conference, TCC 2011 , Y. Ishai, Ed., 2011, pp. 417–431

2011

Cited alongside, same era.

O. Shayevitz, “On Rényi measures and hypothesis testing,” in 2011 IEEE International Symposium on Information Theory Proceedings . IEEE, Jul. 2011, pp. 894–898

2011

Cited alongside, same era.

A. De, “Lower bounds in differential privacy,” in Theory of Cryptography—9th Theory of Cryptography Conference, TCC 2012 , R. Cramer, Ed., 2012, pp. 321–338

2012

Cited alongside, same era.

R. Bassily, A. Groce, J. Katz, and A. D. Smith, “Coupled-worlds privacy: Exploiting adversarial uncertainty in statistical data privacy,” in 54th Annual IEEE Symposium on Foundations of Computer Science , 2013, pp. 439–448

2013

Cited alongside, same era.

A. Langlois, D. Stehlé, and R. Steinfeld, “GGHLite: More efficient multilinear maps from ideal lattices,” in Advances in Cryptology—EUROCRYPT 2014 , P. Q. Nguyen and E. Oswald, Eds. Springer Berlin Heidelberg, 2014, pp. 239–256

2014

Later among the works it cites.

P. Kairouz, S. Oh, and P. Viswanath, “The composition theorem for differential privacy,” in Proceedings of the 32nd International Conference on Machine Learning (ICML) , 2015, pp. 1376–1385

2015

Later among the works it cites.

J. Murtagh and S. Vadhan, “The complexity of computing the optimal composition of differential privacy,” in Theory of Cryptography—13th International Conference, TCC 2016-A, Part I , E. Kushilevitz and T. Malkin, Eds., 2016, pp. 157–175

2016

Later among the works it cites.

C. Dwork and G. N. Rothblum, “Concentrated differential privacy,” CoRR , vol. abs/1603.01887, 2016

Original

2016

Later among the works it cites.