SIA: Secure information aggregation in sensor networks

被引:42
作者
Chan, Haowen [1 ]
Perrig, Adrian [1 ]
Przydatek, Bartosz [1 ,2 ]
Song, Dawn [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] ETH, Zurich, Switzerland
关键词
Sensor networks; information aggregation; security; approximate interactive proofs;
D O I
10.3233/JCS-2007-15104
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In sensor networks, data aggregation is a vital primitive enabling efficient data queries. An on-site aggregator device collects data from sensor nodes and produces a condensed summary which is forwarded to the off-site querier, thus reducing the communication cost of the query. Since the aggregator is on-site, it is vulnerable to physical compromise attacks. A compromised aggregator may report false aggregation results. Hence, it is essential that techniques are available to allow the querier to verify the integrity of the result returned by the aggregator node We propose a novel framework for secure information aggregation in sensor networks. By constructing efficient random sampling mechanisms and interactive proofs, we enable the querier to verify that the answer given by the aggregator is a good approximation of the true value, even when the aggregator and a fraction of the sensor nodes are corrupted. In particular, we present efficient protocols for secure computation of the median and average of the measurements, for the estimation of the network size, for finding the minimum and maximum sensor reading, and for random sampling and leader election. Our protocols require only sublinear communication between the aggregator and the user
引用
收藏
页码:69 / 102
页数:34
相关论文
共 38 条
  • [1] Alon N., 1996, P 28 S THEOR COMP
  • [2] Babai L., 1991, P 23 S THEOR COMP
  • [3] Balasubramanian C., 2004, P IEEE INT C MOB AD
  • [4] Bar-Yossef Z., 2001, P 33 S THEOR COMP
  • [5] Bellare M., 2001, IACR CRYPTOLOGY EPRI, V2001, P35
  • [6] Cachin C, 1999, LECT NOTES COMPUT SC, V1592, P402
  • [7] LOWER BOUNDS FOR SAMPLING ALGORITHMS FOR ESTIMATING THE AVERAGE
    CANETTI, R
    EVEN, G
    GOLDREICH, O
    [J]. INFORMATION PROCESSING LETTERS, 1995, 53 (01) : 17 - 25
  • [8] CHAN H, 2006, P 13 ACM C COMP COMM
  • [9] Charikar M., 2000, P 19 C PRINC DAT SYS
  • [10] Meshed multipath routing with selective forwarding: an efficient strategy in wireless sensor networks
    De, S
    Qiao, CM
    Wu, HY
    [J]. COMPUTER NETWORKS, 2003, 43 (04) : 481 - 497