Authentication In Wireless Networks Research Articles

Implementation of a RADIUS server for access control through authentication in wireless networks

In this study, a remote authentication dial in user service (RADIUS) server was implemented, which offers a wireless security method based on registering users authorized to use the network. For this, a computer with 4GB of RAM and a fourth-generation i3 processor was used, mounted on the Ubuntu Server 18.04 operating system and using the free RADIUS open-source software. This server was connected to the network through the TL-WR940N router using the AES encryption method and the WPA2 – Enterprise wireless security protocol, which allows a RADIUS server to authenticate wireless users. Evaluating this method with three registered users, two of them administrators, and one guest, and a total of 8 wireless devices, the experimental results showed that, for the five failed attempts to enter the network, the RADIUS server was able to identify them with an accuracy of 100% in real-time. In addition, the two administrators' correct identification and subsequent access were achieved; one used the same credential to have another device connected to the network, so an identified user can connect to more than one device without creating other credentials. Finally, this security method was compared to WPA2 Personal for 4 hours, where it was verified that the RADIUS server maintains a maximum of 3 devices connected, while the second method allowed the entry of any device, whether or not it was foreign to the network, showing that the RADIUS server is a robust method with great potential to protect wireless networks.

Multiple Correlated Attributes Based Physical Layer Authentication in Wireless Networks

Physical (PHY) layer authentication has been a significant trend towards ensuring the identity security of terminals in wireless networks due to the high security and low complexity. However, the independence assumption of existing literature ignores the inherent correlation of the PHY-layer attributes, which limits its generality. In this paper, we propose a multi-attribute-based PHY-layer authentication scheme by taking the correlation into account. To cope with the exponential growth of computational complexity in correlated analysis, this paper studies the reconstruction and heuristic algorithm to find a suboptimal authentication solution with low complexity. Specific to the inherent volatility nature of the PHY-layer attributes, we propose an unsupervised machine learning (ML) based non-parametric clustering algorithm to enhance the reliability of PHY-layer authentication. Unlike existing PHY-layer authentication schemes based on ML, the proposed PHY-layer authentication scheme does not require any prior information or the training set, which has a more potent universality. Extensive simulations are performed under both synthetic and real data sets, and the figures verify that the proposed authentication scheme can achieve a reliable and robust performance with low complexity.

Design and Realization of Wireless System of National Engineering and Technology Library

Based on the needs of the wireless system of the National Engineering and Technology Library, according to the latest requirements of the Cyber Security Law of the People's Republic of China, and combined with the latest achievements of wireless technology development, the wireless network of the National Engineering and Technology Library has been redesigned and constructed. The new wireless network has greatly improved the transmission rate, security, unified management convenience and wireless network authentication access convenience, which provides a guarantee for providing better network service.

Robust Spectrum-Based Comparison of Multivariate Complex Random Signals

We consider the problem of comparing two complex multivariate random signal realizations, possibly contaminated with additive outliers, to ascertain whether they have identical power spectral densities. For clean data (i.e., known to be outlier free), a binary hypothesis testing formulation in frequency-domain, utilizing the estimated power spectral density matrices, has been proposed in the literature, and it results in a generalized likelihood ratio test (GLRT). In this paper, we first present an alternative, principled derivation of the existing GLRT using the asymptotic distribution of a frequency-domain sufficient statistic, based on the discrete Fourier transform of the two signal realizations. In order to robustify this GLRT in the presence of additive outliers, we first exploit an existing robust estimator of multivariate scatter to detect the outliers, and subsequently, to clean the data. The existing GLRT is then applied to the cleaned signal realizations. The approach is illustrated through simulations. The considered problem has applications in diverse areas, including user authentication in wireless networks with multi-antenna receivers.

Channel Precoding Based Message Authentication in Wireless Networks: Challenges and Solutions

Due to the broadcast characteristic of the wireless medium, message impersonation and substitution attacks can possibly be launched by an adversary with low cost in wireless communication networks. As an ingenious solution, physical layer based message authentication can achieve perfect security by leveraging channel precoding techniques to meet high level security requirements. In this article, we focus on channel-precoding- based message authentication (CPC-based authentication) over a binary-input wiretap channel (BIWC). Specifically, message authentication with physical layer techniques is first reviewed. Then, a CPC-based authentication framework and its security requirements are presented. Based on the proposed framework, an authentication scheme with polar codes over a binary symmetric wiretap channel (BSWC) is developed. Moreover, a case study is provided as an example of message authentication with polar codes over BSWC. Finally, open research topics essential to CPC-based authentication are discussed.

Design of Wireless Network Authentication System Based on Cloud

Design of Wireless Network Authentication System Based on Cloud

Simultaneous and Anonymous Mobile Network Authentication Scheme Based on Chaotic Maps

Wireless network authentication schemes have been researched forabout a decade, and associated security problems explored by manyresearchers. In 2004, Zhu and Ma proposed an authentication schemefor wireless environments. Afterwards other researchers proposedimprovements according to Zhu-Ma scheme. Mutual authentication isone of the most important issues. To the best of our knowledge,there is no scheme that allows a foreign agent to authenticate thehome agent and mobile user at the same time. Towards this purpose,we propose a simultaneous authentication scheme based on chaoticmaps, and describe how our proposed scheme addresses varioussecurity problems while maintain anonymity. DOI: http://dx.doi.org/10.5755/j01.itc.45.2.8875

Modeling of Wireless Network Security Authentication Protocol Based on SPIN

It’s important to insure wireless network authentication security. Via model checking tool SPIN modeling 802.1x EAP-TLS authentication protocol, communication parts are defined with model checking language PROMELA, security properties are expressed by LTL formula, and the model is verified. With the attack track given by SPIN, the security vulnerabilities caused by the improper configuration is pointed out, meanwhile the new tunnel authentication protocol is proposed to reduce the occurrence of attack and to improve the agreement.

Efficient and robust identity‐based handoff authentication for EAP‐based wireless networks

SUMMARYThe Extensible Authentication Protocol (EAP) framework aims to realize a flexible authentication for wireless networks. However, a full EAP authentication needs several round trips between a mobile node and the EAP server, and hence is unacceptable in a process of handoff authentication because of inefficient performance. Considering the advantage of the identity‐based cryptography, it is attractive to realize handoff authentication efficiently in the identity‐based setting. In this work, we propose a new identity‐based handoff authentication scheme in which a special double‐trapdoor chameleon hash function is used. Compared with the existing identity‐based handoff authentication construction, the main advantage of the proposed scheme eliminates the assumption that the private key generator is fully trusted. Besides, the detailed security analysis shows that the proposed scheme not only satisfies robust security properties but also enjoys desirable efficiency for the real‐world applications. Copyright © 2013 John Wiley & Sons, Ltd.

A wide-adapted bantam protocol for roaming across wireless areas

To guarantee stable convenience and feasibility of the widely applied wireless network, the handover technique is playing an important role nowadays to meet the epidemic mobile device usage. As is known, the wireless network authentication protocol can decide security for whole operating scheme and help protect rights of legal users, while there are still some flaws that prevent entire architecture from working favorably. Considering such flaws including computation overload as well as the key management burden, we propose a brand new authentication protocol to ensure secure message transmission and reduce computation overload. The proposed mechanism can be used both in the intra-domain and inter-domain, catering to the aim of decreasing management burden for the key distribution center and expediting the validation process efficiently. Furthermore, we provide the formal security analysis of BAN logic to demonstrate the applicability of the protocol.

Fast and Secure Authentication Using Double Token based Scheme for WLANs

Authentication can provide security by preventing unauthorized usage and negotiating the credentials for secure communication. Nevertheless, it induces heavy overhead to communications, further deteriorating the quality of service (QoS). Analyzing QoS and security impact of authentication, therefore, becomes critical to developing efficient authentication schemes. In this paper, we propose a system model for the analysis of challenge/response authentication in wireless networks. In the proposed double token based fast authentication scheme, one token is generated in the registration phase and second in the authentication phase which provides another layer of security to the authentication scheme. All the keys are exchanged during the registration phase. This makes the security parameters known only to the mobile client (MC), authenticator and authentication server (AS). Attackers would be unable to know the token and other secret keys because they are shared only during the registration phase. This makes the authentication scheme highly secure. The number of key exchanges that takes place during authentication phase is less, which makes the authentication fast as compared to Extensible Authentication Protocol (EAP) authentication where all messages are exchanged during the authentication phase. The proposed scheme results in fast authentication without compromising the security of wireless networks. General Terms Authentication, Encryption, Wireless network security.

Wireless Network Security: The Mobile Agent Approach

The broadcast nature of wireless network makes traditional link-layer attacks readily available to anyone within the range of the network. User authentication is best safeguard against the risk of unauthorized access to the wireless networks. The present 802.1× authentication scheme has some flaws, making mutual authentication impossible and open to man-in-the-middle attacks. These characteristics make traditional cryptographic mechanism provide weak security for the wireless environment. We have proposed the use of mobile agents to provide dependable Internet services delivery to users, this will guarantee secure authentication in wireless networks and we examine the feasibility of our solution and propose a model for wireless network security.

Analysis and Improvement of a Secure and Efficient Handover Authentication for Wireless Networks

A handover authentication protocol in mobile networks enables mobile nodes to securely and seamlessly roam over multiple access points. Many such protocols have been proposed but shown to be either insecure or inefficient. Very recently, a novel handover authentication protocol named PairHand was proposed, which has been shown to outperform all other protocols in terms of security and efficiency. However, we identify an inherent design weakness in the handover authentication phase of PairHand, and demonstrate that under certain circumstances it is vulnerable to a session key compromised problem. Further, we propose a simple modification to fix the identified security problem without losing any features (such as high efficiency and robust security) of PairHand. Experiments using our implementation on Laptop PCs show that the suggested modification is applicable in real world applications.

CRAW: Combination of Re-Keying and Authentication in Wireless Networks for Secure Multicast Increasing Efficiency of Member Join/Leave and Movement

Recently, the number of requests for multicast services through the wireless networks has been increased. However, for successful deployment, security and efficiency of content delivery must be provided at first. This paper presents a new approach for secure multicast in wireless networks. This approach, CRAW (Combination of Re-keying and Authentication in Wireless networks) combines member authentication procedure with group key management protocol to provide an efficient group re-keying process. One-time password is proposed for member authentication and CKC (Code for Key Calculation) is suggested for group key management in wireless networks. In fact, the combination of authentication with group key management in wireless networks results in a simple and secure mechanism both for authentication and group key management while mobile members join/leave a group or move inter-area. Simulation results show that CRAW reduces re-keying overhead at join from O(log2 n+1) to O(1) while security requirements are saved. Also, CRAW introduces storing a main list to manage mobile members' location while they move intra-group inter-area.

Enhanced Chinese Remainder Theorem based Broadcast Authentication in Wireless Networks

Wireless networks make extensive use of broadcast messages. Many routing activities and network management activities needed in wireless networks must rely on broadcast authentication mechanisms to ensure that data is being originated from a valid source. Without an efficient broadcast authentication algorithm, the transmitting node would have to resort to per-node unicast messages, which does not scale to large networks and is easy to compromise also. The goal of this work is to provide an efficient scheme for sensor network broadcast authentication by considering different properties of broadcast authentication. Here, a protocol is proposed Enhanced Chinese Remainder Theorem based Broadcast Authentication (ECRTBA), for wireless sensor networks. ECRTBA uses Chinese Remainder Theorem to associate the authenticating procedure of the authentication key and the Message Authentication Code of broadcast messages together. The important feature the scheme is having is that it uses the concept of independent keys which support infinite rounds of broadcasts. The scheme also provides instant authentication with no need of buffering.

A Reconfigurable Antenna-Based Solution for Stationary Device Authentication in Wireless Networks

Applying channel information for user authentication is gaining attention in the area of wireless network security. Similarly, reconfigurable antennas capable of generating multiple decorrelated channel realizations have become increasingly popular in wireless systems. In this paper we propose and evaluate a channel-based authentication scheme that applies the capabilities of a pattern reconfigurable antenna for improved performance in user authentication. Field measurements of the channel frequency response employing such an antenna were performed to quantify the performance of the proposed scheme. Based on these measurements, we show the effect of correlation that exists between the different modes on the authentication performance. Furthermore, the performance gain that can be achieved by the scheme is studied as a function of the number of antenna modes. Offline mode analysis is performed to give a loose upper bound on performance while online mode analysis results are presented to quantify achievable authentication performance in realtime. A general guideline on how to choose the different elements of the decision metric in order to realize better performance for physical layer-based authentication schemes based on any diversity scheme is also developed.

Key agreement protocol for Web service authentication in wireless environment

The paper put forward a new key agreement protocol for Web service authentication in wireless networks,which provided privacy password,secure mutual authentication and key secret.The protocol combined techniques of challenge response protocols with SEKE protocols,and used the Diffie-Hellman protocol in the process of key agreement.At last,this paper analyzed some properties of this protocol including the secure property,the cost of computation,the cost of communication and so on.

Integrity Regions: Authentication through Presence in Wireless Networks

Despite years of intensive research, the main deterrents of widely deploying secure communication between wireless nodes remains the cumbersome key setup process. In this paper, we address this problem and we introduce Integrity (I) regions, a novel security primitive that enables message authentication in wireless networks without the use of preestablished or precertified keys. Integrity regions are based on the verification of entity proximity through time-of-arrival ranging techniques. IRegions can be efficiently implemented with ultrasonic ranging, in spite of the fact that ultrasound ranging techniques are vulnerable to distance enlargement and reduction attacks. We further show how IRegions can be used for key establishment in mobile peer-to-peer wireless networks and we propose a novel automatic key establishment approach, largely transparent to users, by leveraging on IRegions and nodes' mobility. We analyze our proposals against a multitude of security threats and we validate our findings via extensive simulations.

Flexible, extensible, and efficient VANET authentication

Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small delay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.

Improving WAPI protocol based on dual strategy

WAPI protocol serves as the infrastructure of wireless network authentication and privacy.Its secure authentication is the premise to ensure wireless network security.The theory of WAPI authentication protocol was discussed,and the security flaws existing in WAPI authentication,which made the protocol prone to be attacked by Middle Man was analyzed.Furthermore,an improving dual strategy based on identification and signature was proposed.A double queue receiving and sending certification model was introduced and its validity was proved under the cable network environment.