End-to-end pairwise key establishment using node disjoint secure paths in wireless sensor networks

International Journal of Security and Networks

Volumn 2, Issue 1-2, 2007, Pages 109-121

  Ling, Hui ^a   Znati, Taieb ^a  

^a University of Pittsburgh   (United States)

Author keywords

key pre distribution; node disjoint path; security; wireless sensor networks (WSNs)

Indexed keywords

EID: 79551646922     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/ijsn.2007.012829     Document Type: Article

References (33)

1. Bajaj, L., Takai, M., Ahuja, R., Tang, K., Bagrodia, R. and Gerla, M. (1999) ‘GloMoSim: a scalable network simulation environment’, Technical Report 990027, Department of Computer Sceince, UCLA.
2. Bhandari, R. (1999) Survivable Networks: Algorithms for Diverse Routing, Kluwer Academic Publisher.
3. Carman, W.D., Kruus, S.P. and Matt, J.B. (2000) ‘Constraints and approaches for distributed sensor network security’, Technical Report 00-010, NAI Labs, September.
4. Chan, H. and Perrig, A. (2005) ‘PIKE: peer intermediaries for key establishment in sensor networks’, IEEE INFOCOM 2005, Miami, March.
5. Chan, H., Perrig, A. and Song, D. (2003) ‘Random key predistribution schemes for sensor networks’, IEEE Symposium on Security and Privacy, Oakland, May.
6. Du, W., Deng, J., Han, S.Y., Chen, S. and Varshney, K.P. (2004) ‘A key management scheme for wireless sensor networks using deployment knowledge’, IEEE INFOCOM 2004, Hongkong, China, March.
7. Du, W., Deng, J., Han, S.Y. and Varshney, K.P. (2003) ‘A pairwise key pre-distribution scheme for wireless sensor networks’, The Tenth ACM Conference on Computer and Communication Security(CCS), Washington, DC, October.
8. Eschenauer, L. and Gligor, D.V. (2002) ‘A key-management scheme for distributed sensor networks’, The Ninth ACM Conference on Computer and Communication Security(CCS), Washington, DC, November.
9. Huang, D., Mehta, M., Medhi, D. and Harn, L. (2004) ‘Location-aware key management scheme for wireless sensor networks’, 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN’04), Washington, DC, October.
10. Hwang, J. and Kim, Y. (2004) ‘Revisiting random key pre-distribution schemes for wireless sensor networks’, 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN’04), Washington, DC, October.
11. Lee, P., Misra, V. and Rubenstein, D. (2005) ‘Distributed algorithms for secure multipath routing’, IEEE INFOCOM 2005, Miami, March.
12. Lee, S. and Gerla, M. (2001) ‘Split multipath routing with maximally disjoint paths in ad hoc networks’, IEEE International Conference on Communications (ICC’01), Helsinki, Finland, June.
13. Li, X. and Cuthbert, L. (2004) ‘Node-disjointness-based multipath routing for mobile ad hoc networks’, PE-WASUN ’04: The First ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, Venezia, Italy, October.
14. Ling, H. and Znati, T. (2005) ‘End-to-end pairwise key establishment using multi-path in wireless sensor network’, The 2005 IEEE Global Communications Conference(GLOBECOM 2005), St. Louis, MO, November.
15. Liu, D. and Ning, P. (2003a) ‘Establishing pairwise keys in distributed sensor networks’, The Tenth ACM Conference on Computer and Communication Security(CCS), Washington, DC, October.
16. Liu, D. and Ning, P. (2003b) ‘Location-based pairwise key establishments for static sensor networks’, The First ACM workshop on Security of Ad Hoc and sensor networks (SASN’03), Fairfax, VA, October.
17. Liu, D., Ning, P. and Du, W. (2005) ‘Group-based key pre-distribution in wireless sensor networks’, ACM Workshop on Wireless Security (Wise’05), Cologne, Germany, September.
18. Lou, W., Liu, W. and Fang, Y. (2004) ‘SPREAD: enhancing data confidentiality in mobile ad hoc networks’, IEEE INFOCOM 2004, Hongkong, China, March.
19. Nasipuri, A. and Castaneda, R. (2001) ‘Performance of multipath routing for on-demand protocols in mobile ad hoc networks’, Mobile Networks and Applications, Kluwer Academic Publisher.
20. Orda, A. and Sprintson, A. (2004) ‘Efficient algorithms for computing disjoint QoS paths’, IEEE INFOCOM 2004, Hongkong, China, March.
21. Papadimitratos, P., Haas, J.Z. and Sirer, E.G. (2002) ‘Path set selection in mobile ad hoc networks’, The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, June.
22. Pearlman, R.M. and Haas, J.Z. (1999) ‘Improving the performance of query-based routing protocols through “Diversity Injection”’, IEEE Wireless Communications and Networking Conference 99, New Orleans, LA, September.
23. Perkins, E.C. and Royer, M.E. (1999) ‘Ad hoc on-demand distance vector routing’, IEEE WMCSA’99, New Orleans, LA, February.
24. Pietro, D.R., Mancini, V.L. and Mei, A. (2003) ‘Random key assignment for secure wireless sensor networks’, The First ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN’03), Fairfax, VA, October.
25. Shamir, A. (1979) ‘How to share a secret’, Communications of ACM, November, Vol. 22, No. 11, pp.612–613.
26. Steiner, J., Neuman, C. and Schiller, J. (1988) ‘Kerberos: an authentication service for computer networks’, Usenix Winter Conference, Dallas, TX, January.
27. Yu, Z. and Guan, Y. (2005) ‘A robust group-based key management scheme for wireless sensor networks’, IEEE Wireless Communications and Networking Conference 2005, New Orleans, LA, March.
28. Zhang, Y., Liu, W., Lou, W. and Fang, Y. (2005) ‘Securing sensor networks with location-based keys’, IEEE Wireless Communications and Networking Conference 2005, New Orleans, LA, March.
29. Zhang, W. and Cao, G. (2005) ‘Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach’, IEEE INFOCOM 2005, Miami, March.
30. Zhu, S., Xu, S., Setia, S. and Jajodia, S. (2003) ‘Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach’, The Eleventh IEEE International Conference on Networking Protocols, Atlanta, GA, November.
31. Dividing a key into multiple fragments is only an example approach of splitting the key into fragments, the major property of the splitting method is that all key fragments are required in order to re-generate the secure key.
32. During the analysis, we assume that the source and destination node will not be compromised, thus they are not counted in the total number of nodes n.
33. s means there are s paths with the same hop count l in this set.