Local, private, efficient protocols for succinct histograms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 14-17-June-2015, Issue , 2015, Pages 127-135

  Bassily, Raef ^a   Smith, Adam ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EFFICIENCY; ERRORS; FREQUENCY ESTIMATION; GRAPHIC METHODS;

DIFFERENTIAL PRIVACIES; EFFICIENT PROTOCOLS; HEAVY-HITTER; HIGH PROBABILITY; LOCAL MODEL; LOWER BOUNDS; TIME POLYNOMIALS; UNTRUSTED SERVER;

COMPUTATIONAL EFFICIENCY;

EID: 84958771236     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2746539.2746632     Document Type: Conference Paper

References (22)

1. S. Agrawal and J. R. Haritsa. A framework for high-accuracy privacy-preserving mining. In ICDE, pages 193-204. IEEE Computer Society, 2005.
2. R. Bassily and A. Smith. Local, private, efficient protocols for succinct histograms. arXiv, April 2015.
3. J. Blocki, A. Blum, A. Datta, and O. Sheffet. The johnson-lindenstrauss transform itself preserves differential privacy. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 410-419, 2012.
4. J. C. Duchi, M. I. Jordan, and M. J. Wainwright. Local privacy and statistical minimax rates. In IEEE Symp. on Foundations of Computer Science (FOCS), 2013.
5. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In CRYPTO, LNCS, pages 528-544. Springer, 2004.
6. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography Conference, pages 265-284. Springer, 2006.
7. C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum. Differential privacy under continual observation. STOC '10, pages 715-724. ACM, 2010.
8. C. Dwork, M. Noar, T. Pitassi, G. Rothblum, and S. Yekhanin. Pan-private streaming algorithms. In Symposium on Innovations in Computer Science (ICS), 2010.
9. Ú. Erlingsson, A. Korolova, and V. Pihur. RAPPOR: randomized aggregatable privacy-preserving ordinal response. ACM Symposium on Computer and Communications Security (CCS), 2014.
10. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In PODS, pages 211-222. ACM, 2003.
11. G. Fanti, V. Pihur, and Ú. Erlingsson. Building a rappor with the unknown: Privacy-preserving learning of associations and data dictionaries. In arXiv:1503.01214 [cs.CR], 2015.
12. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. Strauss. Near-optimal sparse fourier representations via sampling. STOC 2002, pages 152-161. ACM, 2002.
13. V. Guruswami. List Decoding of Error-Correcting Codes. PhD thesis, 2002.
14. J. Hsu, S. Khanna, and A. Roth. Distributed private heavy hitters. In ICALP (1), pages 461-472, 2012.
15. S. P. Kasiviswanathan, H. K. Lee, K. Nissim, S. Raskhod-nikova, and A. Smith. What can we learn privately? In FOCS, 2008.
16. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998. ISSN 0004-5411. Preliminary version in proceedings of STOC'93.
17. K. Kenthapadi, A. Korolova, I. Mironov, and N. Mishra. Privacy via the johnson-lindenstrauss transform. CoRR, abs/1204.2606, 2012.
18. E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. STOC'91, pages 455-464. ACM, 1991.
19. C. McDiarmid. On the method of bounded differences. In In Surveys in Combinatorics, pages 148-188. Cambridge University Press, 1989.
20. A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. P. Vadhan. The limits of two-party differential privacy. In FOCS, pages 81-90, 2010.
21. N. Mishra and M. Sandler. Privacy via pseudorandom sketches. In PODS, pages 143-152. ACM, 2006.
22. J. Upadhyay. Random projections, graph sparsification, and differential privacy. In Advances in Cryptology - ASIACRYPT, pages 276-295, 2013.