The Podium Mechanism: Improving on the Laplace and Staircase Mechanisms

S. L. Warner, “Randomized response: A survey technique for eliminating evasive answer bias,” Journal of the American Statistical Association , vol. 60, pp. 63–69, 1965

1965

Earlier work this paper cites.

G. Casella and R. Berger, Statistical Inference . Duxbury Resource Center, June 2001

2001

Earlier work this paper cites.

E. Lehmann, Elements of Large-Sample Theory , ser. Springer Texts in Statistics. Springer New York, 2004. [Online]. Available: https://books.google.com/books?id=geIoxvgTXlEC

2004

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 Conference (TCC) , 2006, pp. 265–284

2006

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.

K. Chaudhuri and C. Monteleoni, “Privacy-preserving logistic regression,” in Proceedings of the 21st International Conference on Neural Information Processing Systems , ser. NIPS’08. USA: Curran Associates Inc., 2008, pp. 289–296. [Online]. Available: http://dl.acm.org/citation.cfm?id=2981780.2981817

2008

Earlier work this paper cites.

F. McSherry, “Privacy integrated queries: an extensible platform for privacy-preserving data analysis.” in Communications of The ACM - CACM , vol. 53, 01 2009, pp. 19–30

2009

Earlier work this paper cites.

A. Ghosh, T. Roughgarden, and M. Sundararajan, “Universally utility-maximizing privacy mechanisms,” in Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing , ser. STOC ’09. New York, NY, USA: ACM, 2009, pp. 351–360

2009

Earlier work this paper cites.

A. Roth and T. Roughgarden, “Interactive privacy via the median mechanism,” in Proceedings of the Forty-second 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.

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.

C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum, “Differential privacy under continual observation,” in Proceedings of the Forty-second 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

Original

2010

Cited alongside, same era.

J. Hsu, S. Khanna, and A. Roth, “Distributed private heavy hitters,” in Proceedings of the 39th International Colloquium Conference on Automata, Languages, and Programming - Volume Part I , ser. ICALP’12. Berlin, Heidelberg: Springer-Verlag, 2012, pp. 461–472

2012

Later among the works it cites.

U. Erlingsson, V. Pihur, and A. Korolova, “Rappor: Randomized aggregatable privacy-preserving ordinal response,” in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’14. New York, NY, USA: ACM, 2014, pp. 1054–1067. [Online]. Available: http://doi.acm.org/10.1145/2660267.2660348

2014

Later among the works it cites.

C. Dwork and A. Roth, “The algorithmic foundations of differential privacy,” Found. Trends Theor. Comput. Sci. , vol. 9, no. 3, pp. 211–407, Aug. 2014. [Online]. Available: http://dx.doi.org/10.1561/0400000042

2014

Later among the works it cites.

V. Karwa, S. Raskhodnikova, A. D. Smith, and G. Yaroslavtsev, “Private analysis of graph structure,” ACM Trans. Database Syst. , vol. 39, no. 3, pp. 22:1–22:33, 2014