Sketching in adversarial environments

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 651-660

  Mironov, Ilya ^a   Naor, Moni ^b   Segev, Gil ^b  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Data stream model; Massive data sets; Sketch model

Indexed keywords

COMPUTATION THEORY; METADATA;

ADVERSARIAL ENVIRONMENTS; DATA STREAM MODEL; HOSTILE ENVIRONMENTS; MASSIVE DATA SETS; POLY-LOGARITHMIC COMMUNICATION; SKETCH MODEL; SYMMETRIC DIFFERENCE; TECHNICAL CONTRIBUTION;

INFORMATION DISSEMINATION;

EID: 57049113296     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374471     Document Type: Conference Paper

References (40)

1. J. Abello, P. M. Pardalos, and M. G. C. Resende, editors. Handbook of Massive Data Sets. Kluwer Academic Publishers, 2002.
2. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via, core sets. Combinatorial and Computational Geometry - MSRI Publications, pages 1-30, 2005.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comp."Syst. Sci., 58(1):137-147, 1999.
4. L. Babai and P. G. Kimmel. Randomized simultaneous messages: Solution of a problem of Yao in communication complexity. In 12th CCC, pages 239-246, 1997.
5. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In 21st PODS, pages 1-16, 2002.
6. M. Badoiu, S. Har-Peled. and P. Indyk. Approximate clustering via core-sets. In 34th STOC, pages 250-257, 2002.
7. Z. Bar-Yossef. The Complexity of Massive Data Set Computations. PhD thesis, UC Berkeley, 2002.
8. Z. Bar-Yossef, T. S. Jayram, R. Krauthgamer, and R. Kumar. Approximating edit distance efficiently. In 45th FOCS, pages 550-559, 2004.
9. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental cryptography: The case of hashing and signing. In CRYPTO '94, pages 216-233, 1994.
10. M. Bellare and D. Micciancio. A new paradigm for collision-free hashing: Incrementality at reduced cost. In EUROCRYPT '97, pages 163-192, 1997.
11. M. Blum, W. S. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. Algorithmica, 12(2/3):225-244, 1994.
12. D. Boneh and M. K. Franklin. An efficient public key traitor tracing scheme. In CRYPTO '99, pages 338-353, 1999.
13. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comp. Syst. Sci., 60(3):630-659, 2000.
14. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. Computer Networks, 29(8-13):1157-1166, 1997.
15. E. J. Candès and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. on Infor. Theory, 52(12):5406-5425, 2006.
16. M. Charikar. Similarity estimation techniques from rounding algorithms. In 34th STOC, pages 380-388, 2002.
17. G. Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. In SIROCCO, pages 280-294, 2006.
18. D. L. Donoho. Compressed sensing. IEEE Trans. on Infor. Theory, 52(4): 1289-1306, 2006.
19. T. Feder, E. Kushilevitz, M. Naor, and N. Nisan. Amortized communication complexity. SIAM J. Comput., 24(4):736-750, 1995.
20. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. J. Strauss, and R. N. Wright. Secure multiparty computation of approximations. ACM Trans. on Alg., 2(3):435-472, 2006.
21. 1 -difference algorithm for massive data streams. SIAM J. Comput., 32(1):131-151, 2002.
22. R. Gennaro, S. Halevi, and T. Rabin, Secure hash-and-sign signatures without the random oracle. In EUROCRYPT '99, pages 123-139, 1999.
23. P. B. Gibbons and Y. Matias. Synopsis data structures for massive data sets. In 10th SODA, pages 909-910, 1999.
24. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R, Vershynin. One sketch for all: fast algorithms for compressed sensing. In 39th STOC, pages 237-246, 2007.
25. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. J. of the ACM, 45(4):653-750, 1998.
26. M. R, Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In External memory algorithms, pages 107-118. American Mathematical Society, 1999.
27. P. Indyk. Explicit constructions for compressed sensing of sparse signals. In 19th SODA, pages 30-33, 2008.
28. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In 30th STOC, pages 604-613, 1998.
29. P. Indyk and D. P. Woodruff. Polylogarithmic private approximations and efficient matching. In 3rd TCC, pages 245-264, 2006.
30. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(l):21-49, 1999.
31. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput., 30(2):457-474, 2000.
32. T. Moran, M. Naor, and G. Segev. Deterministic history-independent strategies for storing information on write-once memories. In 34th ICALP, pages 303-315, 2007.
33. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993.
34. I. Newman and M. Szegedy. Public vs. private coin flips in one round communication games. In 28th STOC, pages 561-570, 1996.
35. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. J. Comp. Syst. Sci., 58(1):148-173, 1999.
36. R. R.ubinfeld and M. Sudan. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput., 25(2):252-271, 1996.
37. M. Sipser. Expanders, randomness, or time versus space. J. Comp. Syst. Sci., 36(3):379-383, 1988.
38. A. Ta-Shma, C. Umans, and D. Zuckerman. Lossless condensers, unbalanced expanders, and extractors. Combinatorica, 27(2):213-240, 2007.
39. H. S. Witsenhausen and A. D. Wyner. Interframe coder for video signals. U.S. patent 4,191,970, 1980.
40. A. C. Yao. Some complexity questions related to distributive computing. In 11th STOC, pages 209-213, 1979.