An efficient key establishment scheme for secure aggregating sensor networks

ABSTRACT

Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up secret keys with his communication partners without the use of a central infrastructure. Most cited current research papers focus on a probabilistic distribution of sets of keys from larger key pools to new nodes. This results in unnecessary expensive communication and memory consumption, growing linearly with the size of the network, and guarantees secure connections only with a certain probability. This work presents a novel approach for efficient and secure key establishment of nodes joining the network by utilizing the fact that communication in sensor networks follows a paradigm called aggregation. Keys are split into shares and forwarded using disjoint paths in the network. The approach is self-organizing and minimizes memory consumption as well as radio transmissions efficiently -- down to logarithmic behavior.

REFERENCES

• 1: Ross Anderson , Haowen Chan , Adrian Perrig, Key Infection: Smart Trust for Smart Dust, Proceedings of the Network Protocols, 12th IEEE International Conference on (ICNP'04), p.206-215, October 05-08, 2004
• 2: D. Balfanz, D. Smetters, P. Stewart, and H. Wong. Talking to strangers: Authentication in ad-hoc wireless networks. In Symposium on Network and Distributed Systems Security, 2002.
• 3: E.-O. Blaß, M. Conrad, and M. Zitterbart. A tree-based approach for secure key distribution in wireless sensor networks. In Real World Sensor Networks, June 2005.
• 4: H. Chan and A. Perrig. PIKE: Peer intermediaries for key establishment in sensor networks. In INFOCOM, 2005.
• 5: Haowen Chan , Adrian Perrig , Dawn Song, Random Key Predistribution Schemes for Sensor Networks, Proceedings of the 2003 IEEE Symposium on Security and Privacy, p.197, May 11-14, 2003
• 6: Dallas Semiconductor Corp. The iButton, 2005. http://www.ibutton.com.
• 7: Laurent Eschenauer , Virgil D. Gligor, A key-management scheme for distributed sensor networks, Proceedings of the 9th ACM conference on Computer and communications security, November 18-22, 2002, Washington, DC, USA [doi>10.1145/586110.586117]
• 8: H.-J. Hof, E.-O. Blaß, T. Fuhrmann, and M. Zitterbart. Design of a secure distributed service directory for wireless sensornetworks. In European Workshop on Wireless Sensor Networks, 2004.
• 9: Y. Law, R. Corin, S. Etalle, and P. Hartel. A formally verified decentralized key management architecture for wireless sensor networks. In Personal Wireless Communication, 2003.
• 10: Y. Law, J. Doumen, and P. Hartel. Benchmarking block ciphers for wireless sensor network. In IEEE Mobile Ad-hoc and Sensor Systems, 2004.
• 11: S. Miller, B. C. Neuman, J. I. Schiller, and J. Saltzer. Kerberos authentication and authorization system. Project Athena Technical Plan, MIT Project Athena, 1998.
• 12: Adrian Perrig , Robert Szewczyk , Victor Wen , David Culler , J. D. Tygar, SPINS: security protocols for sensor netowrks, Proceedings of the 7th annual international conference on Mobile computing and networking, p.189-199, July 2001, Rome, Italy [doi>10.1145/381677.381696]
• 13: G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. Contemporary Cryptology. IEEE Press, 1992.
• 14: Security: for ubiquitous computing, John Wiley & Sons, Inc., New York, NY, 2002
• 15: Frank Stajano , Ross J. Anderson, The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks, Proceedings of the 7th International Workshop on Security Protocols, p.172-194, April 19-21, 1999

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

General Terms:
Algorithms, Security

Keywords:
aggregation, efficiency, key establishment, sensor networks