Optimal lower bound for differentially private multi-party aggregation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7501 LNCS, Issue , 2012, Pages 277-288

  Chan, T H Hubert ^a   Shi, Elaine ^b   Song, Dawn ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF MARYLAND   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE ERRORS; CLIENT-SERVER COMMUNICATION; COMMUNICATION GRAPHS; COMMUNICATION MODELS; DIFFERENTIAL PRIVACIES; LOWER BOUNDS; OPTIMAL LOWER BOUND; PRIVATE DATA ANALYSIS; SENSITIVE DATAS; SUMMATION PROBLEM; UNTRUSTED SERVER;

ALGORITHMS; INFORMATION THEORY;

COMMUNICATION;

EID: 84866647559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33090-2_25     Document Type: Conference Paper

References (15)

1. Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671-687 (2003)
2. Beimel, A., Nissim, K., Omri, E.: Distributed Private Data Analysis: Simultaneously Solving How and What. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451-468. Springer, Heidelberg (2008)
3. Chor, B., Kushilevitz, E.: A communication-privacy tradeoff for modular addition. Information Processing Letters 45, 205-210 (1993)
4. Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60-65 (2003)
5. Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our Data, Ourselves: Privacy Via Distributed Noise Generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486-503. Springer, Heidelberg (2006)
6. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating Noise to Sensitivity in Private Data Analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265-284. Springer, Heidelberg (2006)
7. Dwork, C.: Differential Privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1-12. Springer, Heidelberg (2006)
8. Dwork, C.: A firm foundation for private data analysis. In: Communications of the ACM (2010)
9. Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. In: STOC 2009 (2009)
10. Indyk, P., Naor, A.: Nearest-neighbor-preserving embeddings. ACM Transactions on Algorithms 3(3) (2007)
11. McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.: The limits of two-party differential privacy. In: FOCS (2010)
12. Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational Differential Privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126-142. Springer, Heidelberg (2009)
13. Przydatek, B., Song, D., Perrig, A.: Sia: secure information aggregation in sensor networks. In: ACM Sensys (2003)
14. Rastogi, V., Nath, S.: Differentially private aggregation of distributed time-series with transformation and encryption. In: SIGMOD 2010, pp. 735-746 (2010)
15. Shi, E., Chan, H., Rieffel, E., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: NDSS (2011)