Secure Communication In Wireless Networks Research Articles

Intelligent intrusion detection techniques for secure communications in wireless networks: a survey

Intelligent intrusion detection techniques for secure communications in wireless networks: a survey

Intelligent Intrusion Detection Techniques for Secure Communications in Wireless Networks: A Survey

Communication is the heart of the day to day activity in the current world. Since the world has practiced with electronic devices for carrying out all the daily activities, electronic and wireless communication along with internet plays a major role in the success of providing a sophisticated life. Moreover, the internet users are also gradually increasing in the recent two decades for making their life easy through fast communication. In such a scenario, the numbers of intruders are increasing in the internet dramatically. In this paper, we provide a survey on the use of machine learning algorithms for developing intelligent intrusion detection systems which are most useful for providing secure communication in wireless networks. Moreover, we compare all the important intelligent intrusion detection systems based on their performance and also suggest some new ideas for improving the decision accuracy of current intelligent intrusion detection systems.

Optimized Minimum Spanning Tree for Secure Routing in MANET

Secure group communication transfers message from one member to another confidentially. Key management for secure communication in wireless networks is primitive based on cryptographic techniques. Intercluster routing was used to improve wireless networks security. In the new scheme, Minimum Spanning Tree (MST) and GBest-BAT algorithm are computed to identify Cluster Heads (CH) with a concept of backup nodes being introduced for effective key management. This study proposes MST formation for inter-cluster routing and it is optimized with GBEST- BAT algorithm.

Energy Efficiency of Cooperative Jamming Strategies in Secure Wireless Networks

Energy efficient secure communication in wireless networks in the presence of eavesdroppers is considered. For a secure transmission to the destination, a set of intermediate "jammer" nodes are chosen to generate artificial noise that confuses the eavesdropper. We consider two jamming strategies: beamforming and cooperative diversity. Previous research has focused largely on cooperative beamforming strategies, but we demonstrate a number of scenarios where a cooperative diversity strategy is desirable. This motivates approaches which selectively switch between the two strategies, from which significant energy savings can often be realized. In our simulations, energy savings of up to 60% are observed in the simulated networks.

Timestamp-Based Digital Envelope for Secure Communication Using HECC

ABSTRACT Secure communication in wireless network is necessary to access remote resources in a controlled and efficient way. For validation and authentication in e-banking and e-commerce transactions, digital signatures using public key cryptography is extensively employed. To maintain confidentiality, Digital Envelope, which is the combination of the encrypted message and signature with the encrypted symmetric key, is also used. In this paper we propose a timestamp-based authentication scheme with a modified Digital Envelope using hyperelliptic curve cryptosystem. HECC have advantages over the existing public key cryptosystems for its small key size and high security in wireless networks where resources are constrained. We have compared the performance of the proposed scheme with that of ECC and present a security analysis to show that our scheme can resist various attacks related to wireless networks.

An Anonymous and Self-Verified Mobile Authentication with Authenticated Key Agreement for Large-Scale Wireless Networks

Increasing numbers of mobile users are being allowed to use wireless networks, and universal access is being promoted. In the absent of a single, trusted authentication server, it is a great challenge to ensure the inter-domain security, which makes it feasible for users to migrate into foreign domains. Thus, an authentication mechanism is needed between mobile users and foreign servers, and an authenticated key also is highly desirable to support secure communications in wireless networks. In addition, maintaining the anonymity of users is an important security requirement, such as the information about customers's behaviors. Recent research has focused on these issues and has provided definitions and some constructions. Importantly, Tang and Wu proposed an efficient mobile authentication scheme, which they called `'Efficient Mobilization Authentication Scheme (EMAS), which enjoys both computational efficiency and communication efficiency that exceed the efficiencies of other recent mobile authentication schemes. Unfortunately, we found out that Tang and Wu's scheme does not meet the basic security requirements. Therefore, to develop a more acceptable mobile authentication scheme, we propose a self-verified mobile authentication scheme that has a novel architecture. To provide the better computation efficiency and storage efficiency, our scheme does not require of long-term secret keys on the servers.

On Self-Healing Key Distribution Schemes

Self-healing key distribution schemes allow group managers to broadcast session keys to large and dynamic groups of users over unreliable channels. Roughly speaking, even if during a certain session some broadcast messages are lost due to network faults, the self-healing property of the scheme enables each group member to recover the key from the broadcast messages he has received before and after that session. Such schemes are quite suitable in supporting secure communication in wireless networks and mobile wireless ad-hoc networks. Recent papers have focused on self-healing key distribution, and have provided definitions, stated in terms of the entropy function, and some constructions. The contribution of this paper is the following: We analyze current definitions of self-healing key distribution and, for two of them, we show that no protocol can achieve the definition. We show that a lower bound on the size of the broadcast message, previously derived, does not hold. We propose a new definition of self-healing key distribution, and we show that it can be achieved by concrete schemes. We give some lower bounds on the resources required for implementing such schemes, i.e., user memory storage and communication complexity. We prove that the bounds are tight