Chaotic Map-based Authentication Research Articles

PUF and Chaotic Map-Based Authentication Protocol for Underwater Acoustic Networks

A secure and effective authentication and communication scheme between users and underwater sensors plays an important role in improving the detection and utilization of marine resources in underwater acoustic networks (UANs). However, due to the energy limitations and susceptibility to capture of underwater sensors and gateways, it is necessary to design a lightweight authentication protocol that can resist capture of sensors and gateways during attacks. In this paper, a lightweight authentication protocol for UANs based on the Physical Unclonable Function (PUF) and chaotic map is proposed. We used the advantages of PUF to resist sensors and gateways being captured in attacks and the chaotic map to achieve lightweight authentication because the computational cost of the chaotic map is almost one-third that of Elliptic Curve Cryptography (ECC). Additionally, we used the formal security proof in the random oracle model to prove the security of the proposed scheme. Our scheme was more secure and efficient compared with some other related schemes in terms of security and performance requirements, and the proposed scheme is suitable for UANs.

Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

CMAF-IIoT: Chaotic map-based authentication framework for Industrial Internet of Things

The Industrial Internet of Things (IIoT) revolutionizes industrial production using smart devices (SMDs) deployed in IIoT environments. These SMDs collect and transmit information from target fields for analysis and can be controlled remotely. In emergency situations, real-time access to specific SMD information is crucial for prompt actions. However, ensuring secure and reliable communication between users and SMDs in untrusted channels is a significant challenge. Privacy concerns and the limitations of existing authentication frameworks further exacerbate this challenge, necessitating a lightweight cryptography-based authentication framework. This framework is essential to enable secure and reliable communication in the diverse IIoT environment while addressing privacy leakage threats and the computational constraints of IoT devices. Recently, various lightweight cryptography-based authenticated encryption (AE) schemes have been proposed to enable encryption and decryption services for resource-constrained IIoT devices. ASCON, an efficient AE scheme, offers confidentiality, integrity, and authenticity in a single encryption and decryption operation, reducing the number of cryptographic operations required for authentication framework design. This paper presents CMAF-IIoT, a chaotic map and resource-efficient AE scheme (ASCON)-based authentication framework for IIoT, addressing the aforementioned challenges. CMAF-IIoT ensures reliable communication between SMDs and users. The framework begins with user-performed local authentication on their smart devices, followed by the establishment of a session key with the SMD after mutual authentication with the gateway. Using the session key, users securely access real-time information from SMDs deployed in the IIoT environment. The security of CMAF-IIoT is validated through formal and informal security analyses. Additionally, the efficiency of CMAF-IIoT is evaluated in terms of communication, computational, and storage costs. The results indicate that CMAF-IIoT requires [6.67% to 53.33%] low storage cost, [45.13% to 65.87%] low computational cost, and [16.46% to 83.29%] low communication cost compared to contrasted authentication frameworks. These findings highlight the viability of CMAF-IIoT for the IIoT environment, as it provides resource efficiency and enhanced security features.

Chaotic Map-Based Authentication Scheme Using Physical Unclonable Function for Internet of Autonomous Vehicle

Autonomous Vehicles (AVs) are a highly discussed topic owing to their great performance and convenience. However, some requirements limit their wider deployment. Specifically, AV should be controlled by remote users during emergencies. It may lead to AV’s system facing the risk of being intruded on by a malicious party, resulting in unreasonable decisions. We, therefore, design the Internet of autonomous vehicle (IoAV) model to mitigate the problems arising from these limitations. To promote a secure remote control of the AV, a reliable authentication scheme, which can be used in IoAV, must be performed. Our proposed chaotic map-based authenticated key agreement (CMAKA) method provides secure remote control features for AVs. In this method, users, data centers, and AV establish a secure communication channel through the negotiation of three independent session keys. Furthermore, a physical unclonable function (PUF) is employed to produce a trusted private key during the authentication. The security of our scheme is evaluated using game hopping through the widespread Real-or-Random (ROR) model. Compared with other existing three-factor authentication schemes, the performance of our protocol is higher in both security requirements and total cost.

Construction of a Chaotic Map-Based Authentication Protocol for TMIS.

Upgraded network technology presents an advanced technological platform for telecare medicine information systems (TMIS) for patients. However, TMIS generally suffers various attacks since the information being shared through the insecure channel. Recently, many authentication techniques have been proposed relying on the chaotic map. However, many of these designs are not secure against the known attacks. In spite of the fact that some of the constructions attain low computation overhead, they cannot establish an anonymous communication and many of them fail to ensure forward secrecy. In this work, our aim is to present authentication and key agreement protocol for TMIS utilizing a chaotic map to achieve both security and efficiency. The underlying security assumptions are chaotic theory assumptions. This scheme supports forward secrecy and a secure session is established with just two messages of exchange. Moreover, we present a comparative analysis of related authentication techniques.

An Extended Chaotic Map-Based Authentication and Key Agreement Scheme for Multi-Server Environment

With the increasing number of users and the emergence of different types of network services, a multi-server architecture has emerged in recent years. In order to ensure the secure communication of Internet participants in an open network environment, the authentication and key agreement protocol for multi-server architectures were proposed in the past. In 2018, Chatterjee et al. put forward a lightweight three-factor authentication and key agreement protocol for a multi-server environment, and they claimed that all known security features with satisfactory performance could be realized in their protocol. However, it is found that their scheme is vulnerable to user impersonation attacks and cannot achieve user un-traceability and three-factor security through our cryptanalysis. In order to solve these shortcomings, we propose a new lightweight and anonymous three-factor authentication scheme for the multi-server environment in this article. Furthermore, the proposed protocol is proved to be AKE secure theoretically, and we use BAN-logic to prove that our protocol realizes mutual authentication between communication participants. Finally, we show that our proposed scheme is practical and efficient through the comparison of security features and performance.

Closed-loop and open-loop authentication protocols for blockchain-based IoT systems

Designers of smart environments based on radio frequency identification devices have a challenging task to build secure mutual authentication protocols. These systems are classified into two major factions which are traditional closed-loop systems, and open-loop systems. To the best of our knowledge, all of the mutual authentication protocols previously introduced for these two categories rely on a centralized database but they fail to address decentralized mutual authentication and their related attacks. Thanks to the blockchain technology, which is a novel distributed technology, in this paper, we propose two decentralized mutual authentication protocols for IoT systems. Our first scheme is utilized for traditional closed-loop RFID systems (called CLAB), and the second one applies to open-loop RFID systems (called OLAB). Meanwhile, we examine the security of the Chebyshev chaotic map-based authentication algorithm and confirm that this algorithm is unprotected against tag and reader impersonation attacks. Likewise, we present a denial of service (DoS), tag impersonation, and reader impersonation attacks against the Chebyshev chaotic-map based protocol when employed in open-loop IoT networks. Moreover, we discover a full secret recovery attack against a recent RFID mutual authentication protocol which is based on blockchain. Finally, we use the BAN-logic method to approve the security characteristics of our CLAB and OLAB proposals.

An enhanced mutual authentication and key establishment protocol for TMIS using chaotic map

Telecare Medical Information System (TMIS) is a platform for the patients and the medical server to communicate and exchange data through the Internet. As the Internet is an insecure medium, the shared sensitive data is at troublesome situation. To protect sensitive data over the public network, it is essential to have secure communication. The authentication and key establishment protocol supports building a secure communication between the patients and the medical server. Recently, Madhusudhan-Nayak proposed an enhanced chaotic map-based authentication and key establishment protocol for TMIS. In this work, we demonstrate that the Madhusudhan-Nayak scheme does not provide user anonymity, fails to achieve mutual authentication and susceptible to traceability attack, insider attack, server impersonation attack and replay attack. To overcome the weaknesses found in Madhusudhan-Nayak protocol, we propose an improved mutual authentication scheme suitable for TMIS with key establishment technique. The proposed protocol is analyzed against many security threats informally and using the formal method BAN logic, the protocol is proven to be mutually authenticated. As there are numerous authentication protocols for TMIS have been put forward in the literature, we compared the proposed scheme with the related existing schemes in several security aspects. The comparison results illustrate that the proposed protocol surpasses these competing schemes.

Construction of a chaotic map-based authentication protocol for online telemedicine services

Construction of a chaotic map-based authentication protocol for online telemedicine services

Security analysis and application of Chebyshev Chaotic map in the authentication protocols

ABSTRACT Due to the quick expansion and fast growth of computer networks, remote user's authentication and key agreement protocol is required. Chaotic maps play a very important role in the construction of authentication and key agreement protocol. Recently, many of the key agreement protocols are proposed based on chaotic maps and it can generate secure session key as well as resist known-key attacks. In this paper, it has been illustrated that most of the existing schemes cannot establish secure communication. Moreover, chaotic map-based authentications schemes have been found vulnerable to identity guessing, password guessing, impersonation, stolen smart card, and violation of session key attacks. Although some of the protocol has advantages of low computation cost but they lacks to attain security attributes. Moreover, these schemes do not support verified session key security with a minimum number of messages exchanged. Therefore, a chaotic map-based authentication scheme is essential to overcome existing weaknesses.

Chaotic Map-Based Authentication Protocol for Multiple Servers Architecture

Multiple servers collaboration technology is the foundation to realize cloud computing deployed in the distributed environments. Service providers could supply massive data and service to authorized users on the cloud infrastructure, instead of maintaining them in the local servers. It is essential for cloud platforms to develop a uniform authentication system, which manages users’ access control and authorization. Recently, Irshad et al. presented a chaotic map-based authentication protocol for the multiple servers architecture, which is recognized susceptible to session key recovery attack and identity theft attack. There is an inherent vulnerability in the session key negotiation based on Chebyshev chaotic map-based public key system and the attacker could retrieve cleartext from a given ciphertext. It is the most crippling issue to result the aforementioned susceptibilities. In this paper, we illustrate the faults in Irshad et al.’s proposal and devise a solution with a tripartite authentication strategy, in which we replace the constant $T_{p}(x)$ with a disparate value for each users. Both the formal security analysis validated by BAN-logic focused on the tripartite authentication protocol and the heuristic analysis demonstrate the security reliability of the proposed protocol. Compare to the previous related solutions with the tripartite authentication strategy, our proposal possesses a superior security property and the better scalability with considerable efficiency.

Security Attacks and Enhancements to Chaotic Map-Based RFID Authentication Protocols

Radio frequency identification (RFID) technology has been increasingly integrated into numerous applications for authentication of objects or individuals. However, because of its limited computation power, RFID technology may cause several security and privacy issues such as tracking the owner of the tag, cloning of the tags and etc. Recently, two chaotic map-based authentication protocols have been proposed for low-cost RFID tags in order to eliminate these issues. In this paper, we give the security analysis of these protocols and uncover their weaknesses. We prove that these protocols are vulnerable to tag tracing, tag impersonation and de-synchronization attacks. The attack complexity of an adversary is polynomial and the success probability of these attacks are substantial. Moreover, we also propose an improved RFID authentication protocol that employs Chebyshev chaotic maps and complies with the EPC global Class 1 Generation 2 standard. Finally, we show that our protocol is resistant against those security issues.

An Efficient Chaotic Map-Based Authentication Scheme with Mutual Anonymity

A chaotic map-based mutual authentication scheme with strong anonymity is proposed in this paper, in which the real identity of the user is encrypted with a shared key between the user and the trusted server. Only the trusted server can determine the real identity of a user during the authentication, and any other entities including other users of the system get nothing about the user’s real identity. In addition, the shared key of encryption can be easily computed by the user and trusted server using the Chebyshev map without additional burdensome key management. Once the partnered two users are authenticated by the trusted server, they can easily proceed with the agreement of the session key. Formal security analysis demonstrates that the proposed scheme is secure under the random oracle model.

C2MP: Chebyshev chaotic map-based authentication protocol for RFID applications

Radio frequency identification (RFID) is a promising wireless sensor technology in the Internet of Things and can be applied for object identification. However, the security issues are still open challenges and should be addressed to achieve enhanced safeguard. Existing security solutions mainly apply logical operators, hash function, and other cryptographic primitives to design authentication schemes. In this paper, we propose a Chebyshev chaotic map-based authentication protocol (C2MP) for the RFID applications. Thereinto, Chebyshev polynomial's semigroup and chaotic properties are introduced for identity authentication and anonymous data transmission. The proposed C2MP owns the security properties including data integrity, authentication, anonymity, and session freshness. According to the BAN logic, security formal analysis is performed based on the messages formalization, initial assumptions, anticipant goals, and logic verification. It indicates that the proposed C2MP is suitable for universal RFID applications.

Robust Chaotic Map-based Authentication and Key Agreement Scheme with Strong Anonymity for Telecare Medicine Information Systems

To ensure only authorized access to medical services, several authentication schemes for telecare medicine information systems (TMIS) have been proposed in the literature. Due to its better performance than traditional cryptography, Hao et al. proposed an authentication scheme for TMIS using chaotic map based cryptography. They claimed that their scheme could resist various attacks, including the smart card stolen attack. However, we identify that their scheme is vulnerable to the stolen smart card attack. The reason causing the stolen smart card attack is that the scheme is designed based on the assumption that the scheme itself achieves user untraceability. Then, we propose a robust authentication and key agreement scheme. Compared with the previous schemes, our scheme not only enjoys more security features, but also has better efficiency. Our analysis indicates that designing a two-factor authentication scheme based on the assumption that privacy protection is achieved in the scheme itself may pose potential security risks. The lesson learned is that, we should avoid this situation in the future design of two-factor authentication schemes.

Security Analysis of a Chaotic Map-based Authentication Scheme for Telecare Medicine Information Systems

Many authentication schemes have been proposed for telecare medicine information systems (TMIS) to ensure the privacy, integrity, and availability of patient records. These schemes are crucial for TMIS systems because otherwise patients' medical records become susceptible to tampering thus hampering diagnosis or private medical conditions of patients could be disclosed to parties who do not have a right to access such information. Very recently, Hao et al. proposed a chaotic map-based authentication scheme for telecare medicine information systems in a recent issue of Journal of Medical Systems. They claimed that the authentication scheme can withstand various attacks and it is secure to be used in TMIS. In this paper, we show that this authentication scheme is vulnerable to key-compromise impersonation attacks, off-line password guessing attacks upon compromising of a smart card, and parallel session attacks. We also exploit weaknesses in the password change phase of the scheme to mount a denial-of-service attack. Our results show that this scheme cannot be used to provide security in a telecare medicine information system.

A Chaotic Map-based Authentication Scheme for Telecare Medicine Information Systems

With the development of Internet, patients could enjoy health-care delivery services through telecare medicine information systems (TMIS) in their home. To control the access to remote medical servers' resources, many authentication schemes using smart cards have been proposed. However, the performance of these schemes is not satisfactory since modular exponential operations are used in these schemes. In the paper, we propose a chaotic map-based authentication scheme for telecare medicine information systems. The security and performance analysis shows our scheme is more suitable for TMIS.