Skip to main content

One-Time Sensors: A Novel Concept to Mitigate Node-Capture Attacks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3813))

Abstract

Dealing with captured nodes is generally accepted as the most difficult challenge to wireless sensor network security. By utilizing the low-cost property of sensor nodes, we introduce the novel concept of one-time sensors to mitigate node-capture attacks. The basic idea is to load each sensor with only one cryptographic token so that the captured node can inject only a single malicious message into the network. In addition, sybil attacks are avoided and explicit revocation is not necessary using one-time sensors. By using public key techniques, one-way hash functions and Merkle’s hash tree, we also show efficient implementations and interesting tradeoffs for one-time sensors.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.gpoabs.com.mx/cricher/history.htm

  2. CONSESSUS Project, http://www.aramis-research.ch/d/7082.html

  3. http://fox5atlanta.com/iteam/911.html

  4. http://www.ci.baltimore.md.us/news/crime/calls.html

  5. Hartung, C., Balasalle, J., Han, R.: Node Compromise in Sensor Networks: The Need for Secure Systems, Technical Report CU-CS-990-05, Department of Computer Science, University of Colorado (January 2005)

    Google Scholar 

  6. Douceur, J.R.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Gaubatz, G., Kaps, J., Sunar, B.: Public Key Cryptography in Sensor Networks - Revisited. In: Castelluccia, C., Hartenstein, H., Paar, C., Westhoff, D. (eds.) ESAS 2004. LNCS, vol. 3313, pp. 2–18. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Merkle, R.C.: A Digital Signature Based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)

    Google Scholar 

  9. Karlof, C., Sastry, N., Wagner, D.: TinySec: A Link Layer Security Architecture for Wireless Sensor Networks. In: Proc. 2nd ACM Conference on Embedded Networked Sensor Systems, SenSys 2004, November 2004, pp. 162–175 (2004)

    Google Scholar 

  10. Shi, E., Perrig, A.: Designing Secure Sensor Networks. IEEE Wireless Communication Magazine 11(6), 38–43 (2004)

    Article  Google Scholar 

  11. Perrig, A., Stankovic, J., Wagner, D.: Security in Wireless Sensor Networks. Communications of the ACM 47(6), 53–57 (2004)

    Article  Google Scholar 

  12. Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: Proc. 9th ACM Conference on Computer and Communications Security, pp. 41–47. ACM, New York (2002)

    Chapter  Google Scholar 

  13. Chan, H., Perrig, A., Song, D.X.: Random Key Predistribution Schemes for Sensor Networks. In: Proc. IEEE Symposium on Security and Privacy, pp. 197–213. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  14. Deng, J., Han, R., Mishra, S.: A Performance Evaluation of Intrusion-Tolerant Routing in Wireless Sensor Networks. In: Zhao, F., Guibas, L.J. (eds.) IPSN 2003. LNCS, vol. 2634, pp. 349–364. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle Tree Representation and Traveral. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 314–326. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Szydlo, M.: Merkle Tree Traversal in Log Space and Time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 541–554. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bicakci, K., Gamage, C., Crispo, B., Tanenbaum, A.S. (2005). One-Time Sensors: A Novel Concept to Mitigate Node-Capture Attacks. In: Molva, R., Tsudik, G., Westhoff, D. (eds) Security and Privacy in Ad-hoc and Sensor Networks. ESAS 2005. Lecture Notes in Computer Science, vol 3813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601494_7

Download citation

  • DOI: https://doi.org/10.1007/11601494_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30912-3

  • Online ISBN: 978-3-540-31615-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics