Near-optimal private approximation protocols via a black box transformation

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 735-744

  Woodruff, David P ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

approximation algorithms; communication complexity; cryptography; data stream algorithms

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATA STREAMS; IMPORTANCE SAMPLING; METADATA;

COMMUNICATION COMPLEXITY; COMPUTATIONALLY-PRIVATE INFORMATION RETRIEVAL; CRYPTOGRAPHIC ASSUMPTIONS; DATA STREAM ALGORITHMS; FULLY HOMOMORPHIC ENCRYPTION; POLY-LOGARITHMIC COMMUNICATION; POLY-LOGARITHMIC FACTORS; SECURE FUNCTION EVALUATION;

APPROXIMATION ALGORITHMS;

EID: 79959690390     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993733     Document Type: Conference Paper

References (59)

1. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. JCSS, 58(1):137-147, 1999.
2. A. Andoni, K. D. Ba, P. Indyk, and D. P. Woodruff. Efficient sketches for earth-mover distance, with applications. In FOCS, pages 324-330, 2009.
3. A. Andoni, R. Krauthgamer, and K. Onak. Streaming Algorithms via Precision Sampling. CoRR, abs/1011.1263, 2010.
4. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. JCSS, 68(4):702-732, 2004.
5. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In SODA, pages 623-632, 2002.
6. A. Beimel, P. Carmi, K. Nissim, and E. Weinreb. Private approximation of search problems. In STOC, pages 119-128, 2006.
7. A. Beimel, R. Hallak, and K. Nissim. Private approximation of clustering and vertex cover. Computational Complexity, 18(3):435-494, 2009.
8. L. Bhuvanagiri and S. Ganguly. Estimating entropy over data streams. In ESA, pages 148-159, 2006.
9. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithm for estimating frequency moments of data streams. In SODA, pages 708-713, 2006.
10. V. Braverman and R. Ostrovsky. Zero-one frequency laws. In STOC, 2010.
11. C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with polylogarithmic communication. In EUROCRYPT, pages 402-414, 1999.
12. A. R. Calderbank, A. C. Gilbert, K. Levchenko, S. Muthukrishnan, and M. Strauss. Improved range-summable random variable construction algorithms. In SODA, pages 840-849, 2005.
13. R. Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, 13(1):143-202, 2000.
14. A. Chakrabarti, G. Cormode, and A. McGregor. A near-optimal algorithm for computing the entropy of a stream. In SODA, pages 328-335, 2007.
15. A. Chakrabarti, K. Do Ba, and S. Muthukrishnan. Estimating Entropy and Entropy Norm on Data Streams. In STACS, pages 196-205, 2006.
16. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In ICALP, pages 693-703, 2002.
17. K. L. Clarkson, E. Hazan, and D. Woodruff. Sublinear optimization for machine learning. In FOCS, 2010.
18. G. Cormode, M. Datar, P. Indyk, and S. Muthukrishnan. Comparing data streams using hamming norms (how to zero in). IEEE Trans. Knowl. Data Eng., 15(3):529-540, 2003.
19. G. Cormode and S. Muthukrishnan. Estimating dominance norms of multiple data streams. In ESA, pages 148-160, 2003.
20. G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. J. Algorithms, 55(1):58-75, 2005. (Pubitemid 40357145)
21. G. Cormode, S. Muthukrishnan, and I. Rozenbaum. Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In VLDB, pages 25-36, 2005.
22. A. Deshpande and K. R. Varadarajan. Sampling-based dimension reduction for subspace approximation. In STOC, pages 641-650, 2007.
23. A. Deshpande, K. R. Varadarajan, M. Tulsiani, and N. K. Vishnoi. Algorithms and hardness for subspace approximation. CoRR, abs/0912.1403, 2009.
24. C. Dwork. Differential privacy. In ICALP, pages 1-12, 2006.
25. C. Dwork. Differential privacy: A survey of results. In TAMC, pages 1-19, 2008.
26. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. ACM Transactions on Algorithms, 2(3):435-472, 2006.
27. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. SIAM J. Comput., 32(1):131-151, 2002.
28. D. Feldman, A. Fiat, and M. Sharir. Coresets forweighted facilities and their applications. In FOCS, pages 315-324, 2006.
29. D. Feldman, M. Monemizadeh, C. Sohler, and D. P. Woodruff. Coresets and sketches for high dimensional subspace approximation problems. In SODA, pages 630-649, 2010.
30. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, 2009.
31. C. Gentry and Z. Ramzan. Single-database private information retrieval with constant communication rate. In ICALP, pages 803-815, 2005.
32. O. Goldreich. Secure multi-party computation. 2000.
33. S. Guha, A. McGregor, and S. Venkatasubramanian. Streaming and sublinear approximation of entropy and information distances. In SODA, pages 733-742, 2006.
34. S. Halevi, R. Krauthgamer, E. Kushilevitz, and K. Nissim. Private approximation of np-hard functions. In STOC, pages 550-559, 2001.
35. S. Har-Peled and S. Mazumdar. On coresets for k-means and k-median clustering. In STOC, pages 291-300, 2004.
36. N. J. A. Harvey, J. Nelson, and K. Onak. Sketching and streaming entropy via approximation theory. In FOCS, pages 489-498, 2008.
37. P. Indyk and A. McGregor. Declaring independence via the sketching of sketches. In SODA, 2008.
38. P. Indyk and D. P. Woodruff. Optimal approximations of the frequency moments of data streams. In STOC, 2005.
39. P. Indyk and D. P. Woodruff. Polylogarithmic private approximations and efficient matching. In TCC, pages 245-264, 2006.
40. Y. Ishai, T. Malkin, M. J. Strauss, and R. N. Wright. Private multiparty sampling and approximation of vector combinations. Theor. Comput. Sci., 410(18):1730-1745, 2009.
41. T. S. Jayram and D. P. Woodruff. The data stream space complexity of cascaded norms. In FOCS, 2009.
42. D. M. Kane, J. Nelson, E. Porat, and D. P. Woodruff. Fast moment estimation in data streams in optimal space. In STOC, 2011, to appear.
43. D. M. Kane, J. Nelson, and D. P. Woodruff. On the exact space complexity of sketching and streaming small norms. In SODA, pages 1161-1178, 2010.
44. J. Kilian, A. Madeira, M. J. Strauss, and X. Zheng. Fast private norm estimation and heavy hitters. In TCC, pages 176-193, 2008.
45. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
46. p (0 < p ≤ 2) using stable random projections. In SODA, pages 10-19, 2008.
47. A. Madeira and S. Muthukrishnan. Functionally private approximations of negligibly-biased estimators. In FSTTCS, pages 323-334, 2009.
48. M. Monemizadeh and D. P. Woodruff. 1-pass relative-error lp-sampling with applications. In SODA, 2010.
49. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, 2005.
50. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In STOC, pages 590-599, 2001.
51. M. Naor and B. Pinkas. Oblivious polynomial evaluation. SIAM J. Comput., 35(5):1254-1281, 2006. (Pubitemid 44599926)
52. J. Nelson and D. P. Woodruff. Fast manhattan sketches in data streams. In PODS, pages 99-110, 2010.
53. A. Pavan and S. Tirthapura. Range-efficient counting of distinct elements in a massive data stream. SIAM J. Comput., 37(2):359-379, 2007. (Pubitemid 351584848)
54. M. E. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In STOC, pages 360-369, 2002.
55. N. D. Shyamalkumar and K. R. Varadarajan. Efficient subspace approximation algorithms. In SODA, 2007.
56. S. Stoev, M. Hadjieleftheriou, G. Kollios, and M. S. Taqqu. Norm, point, and distance estimation over multiple signals using max-stable distributions. In ICDE, 2007.
57. S. Stoev and M. S. Taqqu. Max-stable sketches: estimation of lp-norms, dominance norms and point queries for non-negative signals. CoRR, abs/1005.4344, 2010.
58. H. Sun and C. K. Poon. Two improved range-efficient algorithms for f0 estimation. Theor. Comput. Sci., 410(11):1073-1080, 2009.
59. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In SODA, pages 615-624, 2004.