A cost-efficient counter-intrusion scheme for one-time sensor networks

Gamage C., Leiwo J., Bicakci K., Crispo B., Tanenbaum A. S.

2005 Intelligent Sensors, Sensor Networks and Information Processing Conference, Melbourne, Australia, 5 - 08 December 2005, vol.2005, pp.45-50 identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 2005
  • Doi Number: 10.1109/issnip.2005.1595554
  • City: Melbourne
  • Country: Australia
  • Page Numbers: pp.45-50
  • Keywords: Bloom filters, Hash functions, Intrusion resistance, One-time sensors, Sensor network security
  • Istanbul Technical University Affiliated: No


We propose a secure one-time sensor scheme that is highly resistant to forged messages and replay message attacks. A sensor in a one-time sensor network transmits only a single message in its life time but retransmits messages from other sensors to provide message routing. The only security-specific computational capability required from a one-time sensor in our scheme is a hash function. The bulk of security related data in our scheme is static and therefore can be stored in non-volatile memory. This is an important design criteria as energy is the most critical resource in commonly used lowcost battery-powered wireless sensors. We further improve the storage efficiency of the proposed solution using Bloom filters. © 2005 IEEE.