Proof sketches: Verifiable in-network aggregation

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 996-1005

  Garofalakis, Minos ^a   Hellerstein, Joseph M ^b   Maniatis, Petros ^a  

^a INTEL CORPORATION   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA REDUCTION; DISTRIBUTED COMPUTER SYSTEMS; ERROR DETECTION; MATHEMATICAL MODELS; PROBABILITY; QUERY PROCESSING; VERIFICATION;

ADVERSARIAL SETTINGS; FLAJOLET MARTIN SKETCHES; HEAVY HITTERS; MALICIOUS PARTICIPANTS; PROOF SKETCHES;

COMPUTER NETWORKS;

EID: 34548791705     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.368958     Document Type: Conference Paper

References (18)

1. R. Agrawal, P. J. Haas, and J. Kiernan. A system for watermarking relational databases. In SIGMOD, 2003.
2. R. Agrawal, R. Srikant, and D. Thomas. Privacy preserving OLAP. In SIGMOD, 2005.
3. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In Proceedings of RANDOM, 2002.
4. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Comm. of the ACM, 13(7), 1970.
5. J. Considine, F. Li, G. Kollios, and J. Byers. Approximate Aggregation Techniques for Sensor Databases. In ICDE, 2004.
6. P. Flajolet and G. N. Martin. Probabilistic Counting Algorithms for Data Base Applications. JCSS, 31(2), 1985.
7. S. Ganguly, M. Garofalakis, and R. Rastogi. Processing set expressions over continuous update streams. In SIGMOD, 2003.
8. P. B. Gibbons. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, 2001.
9. P. B. Gibbons and S. Tirthapura. Estimating simple functions on the union of data streams. In SPAA, 2001.
10. R. Huebsch, B. N. Chun, J. M. Hellerstein, B. T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. R. Yumerefendi. The architecture of PIER: an Internet-scale query processor. In CIDR, 2005.
11. S. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong. TAG: A Tiny AGgregation service for ad-hoc sensor networks. In OSDI, 2002.
12. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay-A Secure Two-Party Computation System. In USENIX Security, 2004.
13. A. Manjhi, S. Nath, and P. B. Gibbons. Tributaries and deltas: efficient and robust aggregation in sensor network streams. In SIGMOD, 2005.
14. G. S. Manku and R. Motwani. Approximate Frequency Counts over Data Streams. In VLDB, 2002.
15. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. In SIGMOD, 1999.
16. B. Przydatek, D. Song, and A. Perrig. SIA: Secure Information Aggregation in Sensor Networks. In SenSys, 2004.
17. J. S. Vitter. Random sampling with a reservoir. ACM Transactions on Mathematical Software, 11(1), 1985.
18. D. Wagner. Resilient aggregation in sensor networks. In ACM SASN, 2004.