Bartosz Przydatek
Adrian Perrig
ABSTRACT
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sensor nodes often have limited computation and communication resources and battery power. Moreover, in many applications sensors are deployed in open environments, and hence are vulnerable to physical attacks, potentially compromising the sensor's cryptographic keys.One of the basic and indispensable functionalities of sensor networks is the ability to answer queries over the data acquired by the sensors. The resource constraints and security issues make designing mechanisms for information aggregation in large sensor networks particularly challenging.In this paper, we propose a novel framework for secure information aggregation in large sensor networks. In our framework certain nodes in the sensor network, called aggregators, help aggregating information requested by a query, which substantially reduces the communication overhead. By constructing efficient random sampling mechanisms and interactive proofs, we enable the user 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 the average of the measurements, for the estimation of the network size, and for finding the minimum and maximum sensor reading. Our protocols require only sublinear communication between the aggregator and the user. To the best of our knowledge, this paper is the first on secure information aggregation in sensor networks that can handle a malicious aggregator and sensor nodes.
- Noga Alon, Yossi Matias, and Mario Szegedy. The space complexity of approximating the frequency moments. In Proc. 28th STOC, pages 20--29, 1996.]] Google Scholar
Digital Library
- László Babai, Lance Fortnow, Leonid A. Levin, and Mario Szegedy. Checking computations in polylogarithmic time. In Proc. 23rd ACM STOC, pages 21--32, 1991.]] Google ScholarDigital Library
- Ziv Bar-Yossef, S. Ravi Kumar, and D. Sivakumar. Sampling algorithms: lower bounds and applications. In Proc. 33rd STOC, pages 266--275, 2001.]] Google ScholarDigital Library
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. Counting distinct elements in a data stream. In Proc. RANDOM 2002, pages 1--10, 2002.]] Google ScholarDigital Library
- Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology -- CRYPTO '96, pages 1--15, 1996.]] Google Scholar
- Mihir Bellare and Bennet Yee. Forward security in private key cryptography. Report 2001035, Cryptology ePrint Archive, 2001.]]Google Scholar
- Christian Cachin, Silvio Micali, and Markus Stadler. Computationally private information retrieval with polylogarithmic communication. In Proc. Eurocrypt'99, pages 402--414, 1999.]]Google ScholarCross Ref
- Ran Canetti, Guy Even, and Oded Goldreich. Lower bounds for sampling algorithms for estimating the average. Information Processing Letters, 53(1):17--25, 1995.]] Google ScholarDigital Library
- Moses Charikar, Surajit Chaudhuri, Rajeev Motwani, and Vivek Narasayya. Towards estimation error guarantees for distinct values. In Proc. 19th PODS, pages 268--279, 2000.]] Google ScholarDigital Library
- Amol Deshpande, Suman Nath, Phillip B. Gibbons, and Srinivasan Seshan. Cache-and-query for wide area sensor databases. In SIGMOD 2003, 2003.]] Google ScholarDigital Library
- Funda Ergün, Sampath Kannan, S. Ravi Kumar, Ronitt Rubinfeld, and Mahesh Viswanathan. Spot-checkers. JCSS, 60:717--751, 2000. preliminary version in Proc. STOC'98.]] Google ScholarDigital Library
- Funda Ergün, Ravi Kumar, and Ronitt Rubinfeld. Fast approximate PCPs. In Proc. 31st STOC, pages 41--50, 1999.]] Google ScholarDigital Library
- Deborah Estrin, Ramesh Govindan, John Heidemann, and Satish Kumar. Next century challenges: Scalable coordination in sensor networks. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom 99, August 1999.]] Google ScholarDigital Library
- P. Flajolet and G. N. Martin. Probabilistic counting. In Proc. FOCS'83, pages 76--82, 1983.]]Google ScholarDigital Library
- Lingxuan Hu and David Evans. Secure aggregation for wireless networks. In Workshop on Security and Assurance in Ad hoc Networks, January 2003.]]Google ScholarDigital Library
- C. Intanagonwiwat, D. Estrin, R. Govindan, and J. Heidemann. Impact of network density on data aggregation in wireless sensor networks. In Proceedings of International Conference on Distributed Computing Systems, November 2001.]]Google Scholar
- J. M. Kahn, R. H. Katz, and K. S. Pister. Mobile networking for smart dust. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, MobiCom 99, Seattle, WA, August 1999.]] Google ScholarDigital Library
- Aggelos Kiayias and Moti Yung. Secure games with polynomial expressions. In Proc. 28th ICALP, pages 939--950, 2001.]] Google ScholarDigital Library
- Joe Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In Proc. 24th ACM STOC, pages 723--732, 1992.]] Google ScholarDigital Library
- L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382--401, July 1982.]] Google ScholarDigital Library
- Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. TAG: a Tiny AGgregation service for ad-hoc sensor networks. In Proceedings of the Fith Annual Symposium on Operating Systems Design and Implementation (OSDI), December 2002.]] Google ScholarDigital Library
- Ralph C. Merkle. Protocols for public key cryptosystems. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 122--134, April 1980.]]Google ScholarCross Ref
- Ralph C. Merkle. A certified digital signature. In Proc. Crypto'89, pages 218--238, 1989.]] Google ScholarDigital Library
- Adrian Perrig, Ran Canetti, J. D. Tygar, and Dawn Song. The TESLA broadcast authentication protocol. RSA CryptoBytes, 5(Summer), 2002.]]Google Scholar
- Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, and J. D. Tygar. SPINS: Security protocols for sensor networks. Wireless Networks Journal (WINET), 8(5):521--534, September 2002.]] Google ScholarDigital Library
- Mark N. Wegman and J. Lawrence Carter. New hash functions and their use in authentication and set equality. JCSS, 22:265--279, 1981.]]Google ScholarCross Ref
- Jerry Zhao, Ramesh Govindan, and Deborah Estrin. Computing aggregates for monitoring wireless sensor networks. In First IEEE International Workshop on Sensor Network Protocols and Applications, May 2003.]]Google ScholarCross Ref
Index Terms
- SIA: secure information aggregation in sensor networks
Recommendations
SIA: Secure information aggregation in sensor networks
Special Issue on Security of Ad-hoc and Sensor NetworksIn 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 ...
Key establishment and management for WSNs
Wireless Sensor Networks (WSNs) are composed of a large number of low-cost, low-power, and multi-functional sensor nodes that communicate at short distances through wireless links. Those networks could be deployed in an open and hostile environment ...
Group-based key predistribution for wireless sensor networks
Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected ...
Comments