Non-repudiable authentication and billing architecture for wireless mesh networks

Wireless mesh networks (WMNs) are a kind of wireless ad hoc networks that are multi-hop where packets are forwarded from source to destination by intermediate notes as well as routers that form a kind of network infrastructure backbone. We investigate the security of the recently proposed first known secure authentication and billing architecture for WMNs which eliminates the need for bilateral roaming agreements and that for traditional home-foreign domains. We show that this architecture does not securely provide incontestable billing contrary to designer claims and furthermore it does not achieve entity authentication. We then present an enhanced scheme that achieves entity authentication and nonrepudiable billing

Key Management in Static and Mobile Sensor Networks

Wireless sensor networks consist of sensor nodes with limited computational and communication capabilities. These networks are dynamic in nature that they allow addition of nodes to the network thus increasing the size of the network over time. The nodes communicate with each other in a secure manner and send processed data to the base station. This thesis concerns Key management in static and mobile sensor nodes. The network of sensor nodes is divided into clusters based on their physical locations in both cases. In addition, efficient ways of key distribution among the nodes within the cluster and among heads of clusters are discussed. The security of the network is considered through efficient key management by taking into consideration the network's power capabilities is discussed.Computer Science Departmen

Key Management and Encryption in Wireless Sensor Networks Using Hadamard Transforms

This thesis deals with key management in wireless sensor networks. The shortcomings of existing schemes include poor resilience against node capture, low secure connectivity and memory overhead. After analyzing the problems in existing key management schemes, a modified model of the Blom's scheme is proposed in this thesis. The new model helps to overcome the prominent problems such as memory cost and computation overhead. The modified key management scheme not only enhances the efficiency of the existing Blom's scheme but also provides a new way of generating keys in wireless sensor networks. In our work, we also propose a new encryption technique which can be used in wireless sensor networks to provide security to the data. The encryption technique can be used either on binary or non-binary data and the chaining strategy used in this scheme makes it difficult for intruders to break the message.Computer Science Departmen

A Two-Layer Key Establishment Scheme for Wireless Sensor Networks

In a large scale sensor network, it is infeasible to assign a unique Transport Layer Key (TLK) for each pair of nodes to provide the end-to-end security due to the huge memory cost per node. Thus, conventional key establishment schemes follow a key predistribution approach to establish a Link Layer Key (LLK) infrastructure between neighboring nodes and rely on multihop paths to provide the end-to-end security. Their drawbacks include vulnerability to the node compromise attack, large memory cost, and energy inefficiency in the key establishment between neighboring nodes. In this paper, we propose a novel key establishment scheme, called LAKE, for sensor networks. LAKE uses a t-degree trivariate symmetric polynomial to facilitate the establishment of both TLKs and LLKs between sensor nodes in a two-dimensional space, where each node can calculate direct TLKs and LLKs with some logically neighboring nodes and rely on those nodes to negotiate indirect TLKs and LLKs with other nodes. Any two end nodes can negotiate a TLK on demand directly or with the help of only one intermediate node, which can be determined in advance. As for the LLK establishment, LAKE is more secure under the node compromise attack with much less memory cost than conventional solutions. Due to the location-based deployment, LAKE is also energy efficient in that each node has direct LLKs with most neighbors without spending too much energy on the establishment of indirect LLKs with neighbors through multihop routing