Fetching the paper…
Reading the bibliography…
Sequential querying of differentially private mechanisms degrades the overall privacy level.
David Blackwell, Equivalent comparisons of experiments , The Annals of Mathematical Statistics 24
1953
Earlier work this paper cites.
AJ Stam, Some inequalities satisfied by the quantities of information of fisher and shannon , Information and Control 2
1959
Earlier work this paper cites.
N Blachman, The convolution inequality for entropy powers , Information Theory, IEEE Transactions on 11
1965
Earlier work this paper cites.
S. L. Warner, Randomized response: A survey technique for eliminating evasive answer bias , Journal of the American Statistical Association 60
1965
Earlier work this paper cites.
Thomas M Cover and A Thomas, Determinant inequalities via information theory , SIAM journal on Matrix Analysis and Applications 9
1988
Earlier work this paper cites.
Amir Dembo, Thomas M Cover, and Joy A Thomas, Information theoretic inequalities , Information Theory, IEEE Transactions on 37
1991
Earlier work this paper cites.
S. L. Lauritzen, Graphical Models , Oxford University Press, 1996
1996
Earlier work this paper cites.
Ram Zamir, A proof of the fisher information inequality via a data processing argument , Information Theory, IEEE Transactions on 44
1998
Earlier work this paper cites.
Irit Dinur and Kobbi Nissim, Revealing information while preserving privacy , Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, ACM, 2003, pp. 202–210
2003
Earlier work this paper cites.
Noga Alon and Joel H Spencer, The probabilistic method , Wiley. com, 2004
2004
Earlier work this paper cites.
Cynthia Dwork and Kobbi Nissim, Privacy-preserving datamining on vertically partitioned databases , Advances in Cryptology–CRYPTO 2004, Springer, 2004, pp. 528–544
2004
Earlier work this paper cites.
Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim, Practical privacy: the SuLQ framework , Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, ACM, 2005, pp. 128–138
2005
Earlier work this paper cites.
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, and Moni Naor, Our data, ourselves: Privacy via distributed noise generation , Advances in Cryptology-EUROCRYPT 2006, Springer, 2006, pp. 486–503
2006
Earlier work this paper cites.
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith, Calibrating noise to sensitivity in private data analysis , Theory of Cryptography, Springer, 2006, pp. 265–284
2006
Cited alongside, same era.
Cynthia Dwork, Differential privacy , Automata, languages and programming, Springer, 2006, pp. 1–12
2006
Cited alongside, same era.
Sergio Verdú and Dongning Guo, A simple proof of the entropy-power inequality , IEEE Transactions on Information Theory 52
2006
Cited alongside, same era.
Tie Liu and Pramod Viswanath, An extremal inequality motivated by multiterminal information-theoretic problems , Information Theory, IEEE Transactions on 53
2007
Cited alongside, same era.
Frank McSherry and Kunal Talwar, Mechanism design via differential privacy , Foundations of Computer Science, 2007. FOCS’07. 48th Annual IEEE Symposium on, IEEE, 2007, pp. 94–103
2007
Larry Wasserman and Shuheng Zhou, A statistical framework for differential privacy , Journal of the American Statistical Association 105
2010
Later among the works it cites.
Jeremiah Blocki, Avrim Blum, Anupam Datta, and Or Sheffet, The johnson-lindenstrauss transform itself preserves differential privacy , Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on, IEEE, 2012, pp. 410–419
2012
Later among the works it cites.
Thomas M Cover and Joy A Thomas, Elements of information theory , John Wiley & Sons, 2012
2012
Later among the works it cites.
Arpita Ghosh, Tim Roughgarden, and Mukund Sundararajan, Universally utility-maximizing privacy mechanisms , SIAM Journal on Computing 41
2012
Later among the works it cites.
Anupam Gupta, Aaron Roth, and Jonathan Ullman, Iterative constructions and private data release , Theory of Cryptography, Springer, 2012, pp. 339–356
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Amos Beimel, Kobbi Nissim, and Eran Omri, Distributed private data analysis: Simultaneously solving how and what , Advances in Cryptology–CRYPTO 2008, Springer, 2008, pp. 451–468
2008
Cited alongside, same era.
C. Dwork and J. Lei, Differential privacy and robust statistics , Proceedings of the 41st annual ACM symposium on Theory of computing, ACM, 2009, pp. 371–380
2009
Cited alongside, same era.
Cynthia Dwork, Guy N Rothblum, and Salil Vadhan, Boosting and differential privacy , Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, IEEE, 2010, pp. 51–60
2010
Cited alongside, same era.
2010
Cited alongside, same era.
Moritz Hardt and Guy N Rothblum, A multiplicative weights mechanism for privacy-preserving data analysis , Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, IEEE, 2010, pp. 61–70
2010
Cited alongside, same era.
Moritz Hardt and Kunal Talwar, On the geometry of differential privacy , Proceedings of the 42nd ACM symposium on Theory of computing, ACM, 2010, pp. 705–714
2010
Cited alongside, same era.
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, and Salil Vadhan, The limits of two-party differential privacy , Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, IEEE, 2010, pp. 81–90
2010
Cited alongside, same era.
2012
Later among the works it cites.
2012
Later among the works it cites.
S Muthukrishnan and Aleksandar Nikolov, Optimal private halfspace counting via discrepancy , Proceedings of the 44th symposium on Theory of Computing, ACM, 2012, pp. 1285–1292
2012
Later among the works it cites.
Avrim Blum, Katrina Ligett, and Aaron Roth, A learning theory approach to noninteractive database privacy , Journal of the ACM (JACM) 60
2013
Closest in time.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, Local privacy and statistical minimax rates , Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, IEEE, 2013, pp. 429–438
2013
Closest in time.
Vipul Goyal, Ilya Mironov, Omkant Pandey, and Amit Sahai, Accuracy-privacy tradeoffs for two-party differentially private protocols , Advances in Cryptology–CRYPTO 2013, Springer, 2013, pp. 298–315
2013
Closest in time.
Moritz Hardt and Aaron Roth, Beyond worst-case analysis in private singular vector computation , Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, ACM, 2013, pp. 331–340
2013
Closest in time.
P. Kairouz, S. Oh, and P. Viswanath, The composition theorem for differential privacy , International Conference on Machine Learning, 2014
2014
Closest in time.