Security of Sensor Networks
Papers:
Security protocols
1. Ross
Anderson, Haowen Chan, Adrian Perrig, “Key infection: smart trust for
smart dust,” 12th IEEE
International Conference on Network Protocols, October 2004. [PDF]
2. Q. Huang,
J. Cukier, H. Kobayashi, B. Liu, and J. Zhang, “Fast authenticated key
establishment protocols for self-organizing sensor networks,” Proceedings of the 2nd ACM
International Conference on Wireless Sensor Networks and Applications (WSNA),
pp. 141-150, 2003. [PDF]
3. Chris
Karlof, Naveen Sastry, David Wagner, “TinySec: a link layer security
architecture for wireless sensor networks,” SenSys’04, November 2004. [PDF]
4. Y. W.
Law, S. O. Dulman, S. Etalle, P. J. M. Havinga, “Assessing
security-critical energy-efficient sensor networks,” Proceedings on Security and Privacy in the Age of Uncertainty(SEC),
pp. 459-463, May 2003. [PDF]
5. Adrian
Perrig, Robert Szewczyk, J. D. Tygar, Victor Wen and David E. Culler,
“SPINS: security protocols for Sensor Networks,” Wireless Networks, No. 8, pp. 521-534,
2002. [PDF]
a.
This
paper presents a suite of security protocols optimized for sensor networks:
SPINS. SPINS has two secure building blocks: SNEP and uTESLA. SNEP provides the
confidentiality, authentication and evidence of data freshness for two parties.
uTESLA makes the authenticated broadcast possible in sensor networks.
1. S. Seys,
and B. Preneel, “Efficient cooperative signatures: a novel authentication
scheme for sensor networks,” Proceedings
of the 2nd International Conference on Security in Pervasive
Computing, Lecture Notes in Computer
Science, vol. 3450, pp. 86-100, April 2005. [PDF]
2. Sencun
Zhu, Sanjeev Setia, Sushil Jajodia, “LEAP: efficient security mechanisms
for large-scale distributed sensor networks,” Technique Report, August
2004. [PDF]
a.
In this
paper, the keys are classified into three different types: paired keys between
nodes, group keys and global keys shared by all nodes in the networks.
3. Fan Ye,
Haiyun Luo, Songwu Lu, Lixia Zhang, "Statistical en-route filtering of
injected false data in sensor networks," IEEE INFOCOM '04, 2004.
4. Wehsheng
Zhang, Guohong Cao, "Group rekeying for filtering false data in sensor
networks: a predistribution and local collaboration-based approach," IEEE
INFOCOM '05, 2005.
Cryptographic system
1.
W. Du, R. Wang, and P. Ning, “An
Efficient scheme for authenticating public keys in sensor networks,” Proceedings of the 6th ACM international
symposium on Mobile ad hoc networking and computing, pp. 58-67, 2005. [PDF]
2. G.
Gaubatz, J.-P. Kaps, and B. Sunar, “Public
key cryptography in sensor networks – revisited”, Proceedings of 1st European Workshop on
Security in Ad-Hoc and Sensor Networks (ESAS 2004), Lecture Notes in Computer Science, vol. 3313, Springer, Heidelberg,
pp. 2-18, August 2004. [PDF]
3. Yee Wei
Law, Jeroen Doumen, Pieter Hartel, “Benchmarking block ciphers for
wireless sensor networks,” IEEE
International Conference on Mobile Ad-hoc and
Sensor Systems, pp. 447-456, Oct. 2004. [PDF]
a.
The
performances of current mainstream symmetric block ciphers, including RC5, RC6,
Rijndael, MISTY1, KASUMI and Camellia, are examined in this paper. The
computational energy consumption is measured by means of CPU cycles executed
per byte of plaintext processed, while the energy per instruction cycle can be
theoretically derived from the current, power and clock frequency of the
microprocess.
Key distribution
1. W. Zhang,
M. Tran, S. Zhu, and G. Cao. “A Compromise-Resilient Scheme for Pairwise
Key Establishment in Dynamic Sensor Networks”. ACM Mobihoc 2007 [PDF] Final
version has different name.
2. Fang Liu,
Xiuzhen Cheng, "A Self-Configured Key Establishment Scheme for Large-Scale
Sensor Networks," in Proceedings of
The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems
(MASS 2006), the best paper, pp.447-456, Vancouver, Canada, October 9-12,
2006. [PDF]
3. Liran Ma,
Xiuzhen Cheng, Fang Liu, Jose Rivera, Fengguang An, "iPAK: An In-Situ
Pairwise Key Bootstrapping Scheme for Wireless Sensor Networks," to appear in IEEE Transactions on Parallel
and Distributed Systems, 2006. [PDF]
4. David J.
Malan, Matt Welsh, Michael D. Smith, “A public-key infrastructure for key
distribution in TinyOS based on elliptic curve cryptography,” First Annual IEEE Communications Society
Conference on Sensor and Ad Hoc Communications and Networks, pp. 71-80,
October 2004. [PDF]
5. S.
Wander, N. Gura, H. Eberle, V. Gupta, S. C. Shantz, “Energy analysis of
public-key cryptography for wireless sensor networks,” white papers,
December 2004. [PDF]
Technical reports:
1.
D. Malan, “Crypto for tiny objects,”
Computer Science Group, Harvard
University, TR-04-04,
2004. [PDF]
This work
presents the first known implementation of elliptic curve cryptography for
sensor networks. It concludes that the public-key infrastructure may also be
tractable in sensor networks.
Links:
·
WPI group on cryptography for ultra-low power
devices. [LINK]