A Cost-Efficient Counter-Intrusion Scheme for One-time Sensor Networks

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

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 2005 Intelligent Sensors, Sensor Networks and Information Processing Conference
PublisherIEEE
Pages45-50
Number of pages6
Volume2005
ISBN (Print)0780393996, 9780780393998
Publication statusPublished - 2005
Event2005 Intelligent Sensors, Sensor Networks and Information Processing Conference - Melbourne, Australia
Duration: 5 Dec 20058 Dec 2005

Conference

Conference2005 Intelligent Sensors, Sensor Networks and Information Processing Conference
CountryAustralia
CityMelbourne
Period5/12/058/12/05

Keywords

  • Bloom filters
  • Hash functions
  • Intrusion resistance
  • One-time sensors
  • Sensor network security

Fingerprint

Dive into the research topics of 'A Cost-Efficient Counter-Intrusion Scheme for One-time Sensor Networks'. Together they form a unique fingerprint.

Cite this