Abstract

Due to the nature of wireless transmission, communication in wireless mesh networks (WMNs) is vulnerable to many adversarial activities including eavesdropping. Pairwise key establishment is one of the fundamental issues in securing WMNs. This paper presents a new matrix based pairwise key establishment scheme. Mesh client in our scheme only needs to prestore a key seed, which can be used to generate a column of secret matrix. It can establish pairwise keys with other clients after mesh routers broadcast public matrices. Our scheme is motivated by the fact that in WMNs, mesh routers are more powerful than mesh clients, both in computation and communication. Besides, we employ the pre deployment knowledge to reduce the computational cost of mesh clients. Security and complexity analysis show that the new scheme possesses several desirable features: 1) neighbor mesh clients can directly establish pairwise keys; 2) the new scheme is updatable, scalable, and robust against node capture attacks; and 3) communication and storage costs at mesh clients are significantly reduced.

Highlights

  • Cyber-Physical Systems (CPS), which bridge the cyber-world of computing and communications with the physical world, are expected to change the way of interacting with and controlling the physical world around us

  • We propose a new matrix-based pairwise key establishment scheme to meet the need of such applications

  • The major contribution of this paper is a new design of pairwise key establishment for network type of CPS: WMNs

Read more

Summary

INTRODUCTION

Cyber-Physical Systems (CPS), which bridge the cyber-world of computing and communications with the physical world, are expected to change the way of interacting with and controlling the physical world around us. The major contribution of this paper is a new design of pairwise key establishment for network type of CPS: WMNs. In WMNs, sensor nodes are power-constrained but mesh routers are much more powerful, both in computation and communication. RELATED WORK A widely accepted requirement of robust KPS is that an adversary, after capturing several nodes, should be difficult to derive the communication keys of other nodes or disrupt the entire networks. For this purpose, a pairwise key between two nodes is necessary. Such a mechanism provides a high level of robustness but a low level of scalability: the performance of key distribution phase will be time, computation and storage consuming when N is large, and pairwise key establishment between any current node and newly added one needs a system-wide update

CLASSICAL KEY PRE-DISTRIBUTION SCHEMES
MATRIX-BASED SCHEMES
ANALYSIS
SECURITY ANALYSIS
OVERHEAD ANALYSIS
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.