| Secure outsourced aggregation via one-way chains |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 45, Downloads (12 Months): 154, Citation Count: 1
|
|
|
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
|
Feifei Li , Marios Hadjieleftheriou , George Kollios , Leonid Reyzin, Dynamic authenticated index structures for outsourced databases, Proceedings of the 2006 ACM SIGMOD international conference on Management of data, June 27-29, 2006, Chicago, IL, USA
[doi> 10.1145/1142473.1142488]
|
| |
14
|
Mykletun, E., Narasimha, M., and Tsudik, G. Signature bouquets: Immutability for aggregated/condensed signatures. In ESORICS (2004).
|
 |
15
|
|
 |
16
|
|
 |
17
|
|
 |
18
|
Suman Nath , Phillip B. Gibbons , Srinivasan Seshan , Zachary R. Anderson, Synopsis diffusion for robust aggregation in sensor networks, Proceedings of the 2nd international conference on Embedded networked sensor systems, November 03-05, 2004, Baltimore, MD, USA
[doi> 10.1145/1031495.1031525]
|
| |
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
|
|
|