Abstract
We propose a novel mechanism for authentication of queries in a sensor network in case these queries are flooded. In our protocol, the base station appends an authenticator to every query, such that each sensor can verify with certain probability that the query is sent by the base station. Implicit cooperation between sensor nodes during the flooding process ensures that legitimate queries propagate quickly in the network, whereas the propagation of illegitimate queries is limited to only a small part of the network.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
Alexander Becher, Zinaida Benenson, and Maximilian Dornseif. Tampering with motes: Real-world physical attacks on wireless sensor networks. In 3rd International Conference on Security in Pervasive Computing (SPC), April 2006.
M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62–73, 1993.
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, and Benny Pinkas. Multicast security: A taxonomy and some efficient constructions. In Proc. IEEE INFO-COM’99, volume 2, pages 708–716, New York, NY, March 1999. IEEE.
Crossbow, Inc. MICA2 data sheet. Available at http://www.xbow.com/Products/Product_pdf_files/Wireless_pdf/MICA2_Datasheet.pdf.
P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., pages 17–61, 1960.
Laurent Eschenauer and Virgil D. Gligor. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security, pages 41–47. ACM Press, 2002.
Saurabh Ganeriwal, Srdjan Capkun, Chih-Chieh Han, and Mani B. Srivastava. Secure time synchronization service for sensor networks. In WiSe’ 05: Proceedings of the 4th ACM workshop on Wireless security, pages 97–106, New York, NY, USA, 2005. ACM Press.
Vipul Gupta, Matthew Millard, Stephen Fung, Yu Zhu, Nils Gura, Hans Eberle, and Sheueling Chang Shantz. Sizzle: A standards-based end-to-end security architecture for the embedded internet. In Third IEEE International Conference on Pervasive Computing and Communication (PerCom 2005), Kauai, March 2005.
Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eberle, and Sheueling Chang Shantz. Comparing elliptic curve cryptography and rsa on 8-bit CPUs. In Cryptographic Hardware and Embedded Systems (CHES); 6th International Workshop, pages 119–132, August 2004.
Joengmin Hwang and Yongdae Kim. Revisiting random key pre-distribution schemes for wireless sensor networks. In SASN’ 04: Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks, pages 43–52. ACM Press, 2004.
Chalermek Intanagonwiwat, Ramesh Govindan, Deborah Estrin, John Heidemann, and Fabio Silva. Directed Diffusion for wireless sensor networking. IEEE/ACM Trans. Netw., 11(1):2–16, 2003.
Chris Karlof, Naveen Sastry, and David Wagner. TinySec: A link layer security architecture for wireless sensor networks. In Second ACM Conference on Embedded Networked Sensor Systems (SensSys 2004), November 2004.
A. Kröller, D. Pfisterer, C. Buschmann, S. P. Fekete, and S. Fischer. Shawn: A new approach to simulating wireless sensor networks. In Design, Analysis, and Simulation of Distributed Systems, SpringSim 2005, April 2005.
Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. The design of an acquisitional query processor for sensor networks. In SIGMOD’ 03: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pages 491–502, New York, NY, USA, 2003. ACM Press.
Alfred J. Menezes, Paul C. Van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1997.
moteiv Corp. Telos revision B datasheet. Available at http://www.moteiv.com/products/docs/telos-revb-datasheet.pdf.
J. Ni and S. Chandler. Connectivity properties of a random radio network. IEE Communications, 141:389–296, August 1994.
Adrian Perrig, Robert Szewczyk, J. D. Tygar, Victor Wen, and David E. Culler. SPINS: security protocols for sensor networks. Wireless Networks, 8(5):521–534, 2002.
Ronald L. Rivest. The RC5 encryption algorithm. In Fast Software Encryption, pages 86–96, 1994.
Stefaan Seys and Bart Preneel. Efficient cooperative signatures: A novel authentication scheme for sensor networks. In 2nd International Conference on Security in Pervasive Computing, number 3450 in LNCS, pages 86–100, April 2005.
Feng Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. Wirel Netw., 10(2): 169–181, 2004.
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, and Sushil Jajodia. Establishing pair-wise keys for secure communication in ad hoc networks: A probabilistic approach. In IEEE International Conference on Network Protocols, November 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Benenson, Z., Freiling, F.C., Hammerschmidt, E., Lucks, S., Pimenidis, L. (2006). Authenticated Query Flooding in Sensor Networks. In: Fischer-Hübner, S., Rannenberg, K., Yngström, L., Lindskog, S. (eds) Security and Privacy in Dynamic Environments. SEC 2006. IFIP International Federation for Information Processing, vol 201. Springer, Boston, MA. https://doi.org/10.1007/0-387-33406-8_4
Download citation
DOI: https://doi.org/10.1007/0-387-33406-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33405-9
Online ISBN: 978-0-387-33406-6
eBook Packages: Computer ScienceComputer Science (R0)