Ecient and Private Distance Approximation in the Communication and Streaming Models

[1]  David P. Woodruff.  Optimal space lower bounds for all frequency moments , 2004, SODA '04.

[2]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[4]  Yehuda Lindell,et al.  Universally composable two-party and multi-party secure computation , 2002, STOC '02.

[5]  Moni Naor,et al.  Communication preserving protocols for secure function evaluation , 2001, STOC '01.

[6]  Joe Kilian,et al.  One-Round Secure Computation and Secure Autonomous Mobile Agents , 2000, ICALP.

[7]  Robert Krauthgamer,et al.  Private approximation of NP-hard functions , 2001, STOC '01.

[8]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[9]  C. Papadimitriou,et al.  The complexity of massive data set computations , 2002 .

[10]  Ziv Bar-Yossef,et al.  Information theory methods in communication complexity , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[11]  Wenliang Du,et al.  Protocols for Secure Remote Database Access with Approximate Matching , 2001, E-Commerce Security and Privacy.

[12]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[13]  Piotr Indyk,et al.  A small approximately min-wise independent family of hash functions , 1999, SODA '99.

[14]  I. Good.  C332. Surprise indexes and p-values , 1989 .

[15]  Subhash Khot,et al.  Near-optimal lower bounds on the multi-party communication complexity of set disjointness , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[16]  Andrew Chi-Chih Yao,et al.  Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.

[17]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[18]  Andrew Chi-Chih Yao,et al.  Lower Bounds by Probabilistic Arguments (Extended Abstract) , 1983, FOCS 1983.

[19]  Xuan Zheng,et al.  Private Approximate Heavy Hitters , 2006, ArXiv.

[20]  Andrei Z. Broder,et al.  A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines , 1998, Comput. Networks.

[21]  Russell Impagliazzo,et al.  One-way functions are essential for complexity based cryptography , 1989, 30th Annual Symposium on Foundations of Computer Science.

[22]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[23]  Noam Nisan,et al.  Errata for: "On randomized one-round communication complexity" , 2001, computational complexity.

[24]  Jacques Stern,et al.  A New Public-Key Cryptosystem , 1997, EUROCRYPT.

[25]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[26]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[27]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2000, Journal of Cryptology.

[28]  Sumit Ganguly,et al.  Estimating Entropy over Data Streams , 2006, ESA.

[29]  Ravi Kumar,et al.  An improved data stream algorithm for frequency moments , 2004, SODA '04.

[30]  Alexandr Andoni,et al.  On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[31]  Graham Cormode,et al.  Summarizing and Mining Skewed Data Streams , 2005, SDM.

[32]  David P. Woodruff,et al.  Tight lower bounds for the distinct elements problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[33]  Rafail Ostrovsky,et al.  Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.

[34]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[35]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[36]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[37]  David P. Woodruff,et al.  Optimal approximations of the frequency moments of data streams , 2005, STOC '05.

[38]  Yuval Ishai,et al.  Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing , 2000, CRYPTO.

[39]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

[40]  Graham Cormode,et al.  A near-optimal algorithm for computing the entropy of a stream , 2007, SODA '07.

[41]  Moses Charikar,et al.  Finding frequent items in data streams , 2004, Theor. Comput. Sci..

[42]  Piotr Indyk,et al.  Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.

[43]  Michael E. Saks,et al.  Space lower bounds for distance approximation in the data stream model , 2002, STOC '02.

[44]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[45]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[46]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[47]  Christopher M. Jones,et al.  An introduction to coding theory. , 2001 .

[48]  Joan Feigenbaum,et al.  Secure multiparty computation of approximations , 2001, TALG.

[49]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[50]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[51]  Yuval Ishai,et al.  Protecting data privacy in private information retrieval schemes , 1998, STOC '98.

[52]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[53]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[54]  Philippe Flajolet,et al.  Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..

[55]  Sumit Ganguly,et al.  Estimating Frequency Moments of Data Streams Using Random Linear Combinations , 2004, APPROX-RANDOM.

[56]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[57]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[58]  Sumit Ganguly,et al.  Simpler algorithm for estimating frequency moments of data streams , 2006, SODA '06.

[59]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[60]  R. Motwani,et al.  High-Dimensional Computational Geometry , 2000 .

[61]  Luca Trevisan,et al.  Counting Distinct Elements in a Data Stream , 2002, RANDOM.

[62]  Amos Beimel,et al.  Private Approximation of Clustering and Vertex Cover , 2007, TCC.