Subscribe
Issue No.06 - November/December (2011 vol.8)
pp: 929-937
Jiang Wu , Queen's University of Belfast, Belfast
Douglas R. Stinson , University of Waterloo, Waterloo
ABSTRACT
In this paper, we propose a security model to capture active attacks against multipath key establishment (MPKE) in sensor networks. Our model strengthens previous models to capture more attacks and achieve essential security goals for multipath key establishment. In this model, we can apply protocols for perfectly secure message transmission to solve the multipath key establishment problem. We propose a simple new protocol for optimal one-round perfectly secure message transmission based on Reed-Solomon codes. Then, we use this protocol to obtain two new multipath key establishment schemes that can be applied provided that fewer than one-third of the paths are controlled by the adversary. Finally, we describe another MPKE scheme that tolerates a higher fraction (less than half) of paths controlled by the adversary. This scheme is based on a new protocol for a weakened version of message transmission, which is very simple and efficient. Our multipath key establishment schemes achieve improved security and lower communication complexity, as compared to previous schemes.
INDEX TERMS
Sensor network, key establishment, secure message transmission.
CITATION
Jiang Wu, Douglas R. Stinson, "Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission", IEEE Transactions on Dependable and Secure Computing, vol.8, no. 6, pp. 929-937, November/December 2011, doi:10.1109/TDSC.2010.48
REFERENCES
 [1] C.H. Bennett, G. Brassard, and J.-M. Robert, “Privacy Amplification by Public Discussion,” SIAM J. Computing, vol. 17, pp. 210-229, 1988. [2] S. Çamtepe and B. Yener, “Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks,” IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 346-358, Apr. 2007. [3] H. Chan, A. Perrig, and D. Song, “Random Key Predistribution Schemes for Sensor Networks,” Proc. IEEE Symp. Security and Privacy (SP '03), pp. 197-213, 2003. [4] B. Chor, O. Goldreich, J. Hasted, J. Friedman, S. Rudich, and R. Smolensky, “The Bit Extraction Problem or $t$ -Resilient Functions,” Proc. 26th Ann. Symp. Foundations of Computer Science (FOCS '85), pp. 396-407, 1985. [5] J. Deng and Y.S. Han, “Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission,” IEEE Trans. Dependable and Secure Computing, vol. 5, no. 3, pp. 177-190, July-Sept. 2008. [6] D. Dolev, C. Dwork, O. Waarts, and M. Yung, “Perfectly Secure Message Transmission,” J. ACM, vol. 40, pp. 17-47, 1993. [7] W. Du, J. Deng, Y. Han, P. Varshney, J. Katz, and A. Khalili, “A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks,” ACM Trans. Information System Security, vol. 8, pp. 228-258, 2005. [8] L. Eschenauer and V.D. Gligor, “A Key-Management Scheme for Distributed Sensor Networks,” Proc. Ninth ACM Conf. Computer and Comm. Security (CCS '02), pp. 41-47, 2002. [9] M. Fitzi, M. Franklin, J. Garay, and S.H. Vardhan, “Towards Optimal and Efficient Perfectly Secure Message Transmission,” Proc. Fourth Theory of Cryptography Conf. (TCC '07), pp. 311-322, 2007. [10] D. Huang and D. Medhi, “A Byzantine Resilient Multi-Path Key Establishment Scheme and Its Robustness Analysis for Sensor Networks,” Proc. 19th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), 2005. [11] W.C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge Univ. Press, 2003. [12] K. Kurosawa and K. Suzuki, “Almost Secure (1-Round, $n$ -Channel) Message Transmission Scheme,” Report 2007/076, Cryptology ePrint Archive 2007. [13] K. Kurosawa and K. Suzuki, “Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme,” Proc. 27th Ann. Int'l Conf. Advances in Cryptology (EUROCRYPT '08), pp. 324-340, 2008. [14] J. Lee and D.R. Stinson, “On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs,” ACM Trans. Information System Security, vol. 11, pp. 1-35, 2008. [15] D. Liu, P. Ning, and R. Li, “Establishing Pairwise Keys in Distributed Sensor Networks,” ACM Trans. Information System Security, vol. 8, pp. 41-77, 2005. [16] A. Patra, A. Choudhary, K. Srinathan, and C.P. Rangan, “Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality,” Report 2008/141, Cryptology ePrint Archive 2008. [17] R.D. Pietro, L.V. Mancini, and A. Mei, “Efficient and Resilient Key Discovery Based on Pseudo-Random Key Pre-Deployment,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS '04), pp. 217-224, 2004. [18] I.S. Reed and X. Chen, Error-Control Coding for Data Networks. Kluwer Academic Publishers, 1999. [19] H.M. Sayeeda and H. Abu-Amara, “Efficient Perfectly Secure Message Transmission in Synchronous Networks,” Information and Computation, vol. 126, pp. 53-61, 1996. [20] A. Shamir, “How to Share a Secret,” Comm. ACM, vol. 22, pp. 612-613, 1979. [21] D.R. Stinson and J.L. Massey, “An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions,” J. Cryptology, vol. 8, pp. 167-173, 1995. [22] Y. Wang, “Robust Key Establishment in Sensor Networks,” ACM SIGMOD Record, vol. 33, pp. 14-19, 2004. [23] J. Wu and D. Stinson, “Minimum Node Degree and $k$ -Connectivity for Key Predistribution Schemes and Distributed Sensor Networks,” Proc. ACM Conf. Wireless Network Security (WiSec '08), pp. 119-124, 2008. [24] S. Zhu, S. Xu, S. Setia, and S. Jajodia, “Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach,” Proc. IEEE Int'l Conf. Network Protocols (ICNP '03), pp. 326-335, 2003.