A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography
David J. Malan,Matt Welsh,Michael D. Smith +2 more
- pp 71-80
Reads0
Chats0
TLDR
It is demonstrated that public keys can be generated within 34 seconds, and that shared secrets can be distributed among nodes in a sensor network within the same, using just over 1 kilobyte of SRAM and 34 kilobytes of ROM.Abstract:
We present the first known implementation of elliptic curve cryptography over F/sub 2p/ for sensor networks based on the 8-bit, 7.3828-MHz MICA2 mote. Through instrumentation of UC Berkeley's TinySec module, we argue that, although secret-key cryptography has been tractable in this domain for some time, there has remained a need for an efficient, secure mechanism for distribution of secret keys among nodes. Although public-key infrastructure has been thought impractical, we argue, through analysis of our own implementation for TinyOS of multiplication of points on elliptic curves, that public-key infrastructure is, in fact, viable for TinySec keys' distribution, even on the MICA2. We demonstrate that public keys can be generated within 34 seconds, and that shared secrets can be distributed among nodes in a sensor network within the same, using just over 1 kilobyte of SRAM and 34 kilobytes of ROM.read more
Citations
More filters
Proceedings ArticleDOI
Defending against path-based DoS attacks in wireless sensor networks
TL;DR: A solution using one-way hash chains to protect end-to-end communications in WSNs against PDoS attacks is proposed, which is lightweight, tolerates bursty packet losses, and can easily be implemented in modern W SNs.
Journal ArticleDOI
The price of security in wireless sensor networks
TL;DR: Three aspects of WSNs security are studied: encryption algorithms, modes of operation for block ciphers, and message authentication algorithms: memory and energy consumption and insight into the suitability of different security algorithms for use in WSN environments are provided.
Proceedings ArticleDOI
Securing the deluge Network programming system
TL;DR: The solution to the secure programming problem leverages authenticated streams, is consistent with the limited resources of a typical sensor node, and can be used to secure existing network programming systems.
Node Compromise in Sensor Networks: The Need for Secure Systems
TL;DR: The ease with which nodes can be compromised is demonstrated as well as exactly what information can be obtained and how it can be used to disrupt, falsify data within, or eavesdrop on sensor networks.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
Elliptic curve cryptosystems
TL;DR: The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
Book ChapterDOI
Use of Elliptic Curves in Cryptography
TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Proceedings ArticleDOI
SPINS: security protocols for sensor networks
TL;DR: A suite of security building blocks optimized for resource-constrained environments and wireless communication, and shows that they are practical even on minimal hardware: the performance of the protocol suite easily matches the data rate of the network.