ACM Home Page
Please provide us with feedback. Feedback
Secure outsourced aggregation via one-way chains
Full text PdfPdf (499 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Research session 1: security I table of contents
Pages 31-44  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Suman Nath  Microsoft Research, Redmond, WA, USA
Haifeng Yu  National University of Singapore, Singapore, Singapore
Haowen Chan  Carnegie Mellon University, Pittsburgh, PA, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 45,   Downloads (12 Months): 154,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559845.1559851
What is a DOI?

ABSTRACT

We consider the Outsourced Aggregation model, where sensing services outsource their sensor data collection and aggregation tasks to third-party service providers called aggregators. As aggregators can be untrusted or compromised, it is essential for a sensing service to be able to verify the correctness of aggregation results. This work presents SECOA, a framework with a family of novel and optimally-secure protocols for secure outsourced aggregation. Our framework is based on a unified use of one-way chains. It supports a large and diverse set of aggregate functions, can have multiple hierarchically organized aggregators, can deterministically detect any malicious aggregation behavior without communication with sensors, and incurs a small and workload-independent communication load on sensors. We also present extensive evaluation results to demonstrate the feasibility of our framework.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Speed comparison of popular crypto algorithms. http://www.cryptopp.com/benchmarks.html 2008.
 
2
 
3
 
4
Bellare, M., Garay, J., and Rabin, T. Fast batch verification for modular exponentiation and digital signatures. In Eurocrypt (1998).
 
5
6
 
7
 
8
Cormode, G., and Muthukrishnan, S. An improved data stream summary: The count-min sketch and its applications. LATIN 2004: Theoretical Informatics (2004), 29--38.
9
 
10
 
11
Garofalakis, M., Hellerstein, J., and Maniatis, P. Proof sketches: Verifiable in-network aggregation. In ICDE (2007).
 
12
13
 
14
Mykletun, E., Narasimha, M., and Tsudik, G. Signature bouquets: Immutability for aggregated/condensed signatures. In ESORICS (2004).
15
16
17
18
 
19
Nuckolls, G. Verified query results from hybrid authentication trees. In Data and Applications Security (DBSec) (2005).
20
21
 
22
23
 
24
Simmons, G. J. weak privacy protocol using the RSA crypto algorithm. Cryptologia 7 2 (1983), 180--182.
 
25
26
 
27


Collaborative Colleagues:
Suman Nath: colleagues
Haifeng Yu: colleagues
Haowen Chan: colleagues