SIA: Secure information aggregation in sensor networks

作者: Haowen Chan , Adrian Perrig , Bartosz Przydatek , Dawn Song

DOI: 10.3233/JCS-2007-15104

关键词:

摘要: In sensor networks, data aggregation is a vital primitive enabling efficient queries. An on-site aggregator device collects from nodes and produces condensed summary which forwarded to the off-site querier, thus reducing communication cost of query. Since on-site, it vulnerable physical compromise attacks. A compromised may report false results. Hence, essential that techniques are available allow querier verify integrity result returned by node. We propose novel framework for secure information in networks. By constructing random sampling mechanisms interactive proofs, we enable answer given good approximation true value, even when fraction corrupted. particular, present protocols computation median average measurements, estimation network size, finding minimum maximum reading, leader election. Our require only sublinear between user.

参考文章(37)
Pawan Jadia, Anish Mathuria, Efficient secure aggregation in sensor networks ieee international conference on high performance computing data and analytics. pp. 40- 49 ,(2004) , 10.1007/978-3-540-30474-6_10
Helger Lipmaa, An oblivious transfer protocol with log-squared communication international conference on information security. pp. 314- 328 ,(2005) , 10.1007/11556992_23
S.-J. Lee, M. Gerla, Split multipath routing with maximally disjoint paths in ad hoc networks international conference on communications. ,vol. 10, pp. 3201- 3205 ,(2001) , 10.1109/ICC.2001.937262
Ralph C. Merkle, A Certified Digital Signature international cryptology conference. pp. 218- 238 ,(1989) , 10.1007/0-387-34805-0_21
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan, Counting Distinct Elements in a Data Stream randomization and approximation techniques in computer science. pp. 1- 10 ,(2002) , 10.1007/3-540-45726-7_1
Christian Cachin, Silvio Micali, Markus Stadler, None, Computationally private information retrieval with polylogarithmic communication theory and application of cryptographic techniques. pp. 402- 414 ,(1999) , 10.1007/3-540-48910-X_28
Shafi Goldwasser, Silvio Micali, Charles Rackoff, The knowledge complexity of interactive proof systems SIAM Journal on Computing. ,vol. 18, pp. 186- 208 ,(1989) , 10.1137/0218012
Mark N. Wegman, J.Lawrence Carter, New hash functions and their use in authentication and set equality Journal of Computer and System Sciences. ,vol. 22, pp. 265- 279 ,(1981) , 10.1016/0022-0000(81)90033-7
Ran Canetti, Guy Even, Oded Goldreich, Lower bounds for sampling algorithms for estimating the average Information Processing Letters. ,vol. 53, pp. 17- 25 ,(1995) , 10.1016/0020-0190(94)00171-T
Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar, Sampling algorithms Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01. pp. 266- 275 ,(2001) , 10.1145/380752.380810