Key Agreement Technique Research Articles

DAC‐MD: A privacy preserving drone‐access control scheme for last mile delivery

AbstractThe service delivery has lately witnessed strides in the form of paradigm shifts from conventional logistics to drone‐oriented supply chain to conserve ecosystem. The use of drones or unmanned aerial vehicles (UAVs) for package deliveries offer enhanced accessibility, flexibility, efficiency, speed, safety, and even few environmental gains. However, the drones can come across various security hazards while communicating with ground installations on open channels including physical capture attack, privacy infringement, and so on. Thus, earnest endeavors are needed to fix those security challenges in applications related to drone communications. To address these problems, an efficient authenticated key agreement technique, drone access control scheme for last mile delivery (DAC‐MD) is suggested for user‐drone interactions in IoD environment that help the participating entities in developing a mutually agreed session key for securing subsequent communication interactions. The proposed scheme is proved using automated ProVerif tool as well as analyzed by using formal analysis based on RoR random oracle model. The comparative analysis against recently presented known studies reveals that our scheme not only carries comparable properties in terms of security and privacy, but also low computational and communication costs.

Lightweight secure authentication and key agreement technique for smart grid

Lightweight secure authentication and key agreement technique for smart grid

A probably secure biometric‐based authentication and key agreement scheme for Internet of Drones

AbstractThe Internet of Drones (IoD) is one of the world's most recent and innovative technology. Drones are most prominent IoT (Internet of Things) gadgets and their applications span from commercial to domestic. The sensitive data stored in drones has increased the demand for the security of communication in the IoD. As a result, numerous authentication and key agreement techniques have been developed to proffers secure communication among the entities of the IoD network. However, after scrutinizing the security of these protocols, many IoD protocols were observed to be susceptible to different cryptographic attacks. This has enhanced the necessity for an improved and efficient authentication scheme in IoD. In this article, we first investigate Zhang et al.'s approach and demonstrate that although it offers security verification, it has certain design problems. It is, furthermore, shown to be vulnerable to privileged insider, offline password guessing, and stolen smart device attacks. Second, we propose a novel biometric‐based scheme that includes countermeasures to protect against these flaws. The security of the mechanism is examined under real or random oracle model, informal security analysis and scyther simulation for numerous cryptographic assaults. Also, the performance analysis substantiates the competency of the proposed scheme corresponding to computation and communication cost with existing schemes.

AP-HBSG: Authentication protocol for heterogeneous blockchain-based smart grid environment

The smart grid (SG) is one of the largest Internet of Things (IoT) applications. Therefore, it encompasses a variety of smart objects, including smart appliances, smart meters, and sensors, among others. All of these devices are scattered throughout the SG to serve a variety of objectives. As a result, the SG network architecture is exposed to various security threats. Furthermore, numerous authentication and key agreement techniques have been developed throughout the years to protect the communication between entities. However, several of them are homogeneous protocols, which means that only entities running similar cryptographic schemes can communicate. In addition, the SG communication system is centralized and susceptible to a single point of failure and management. Moreover, the existing protocols involve extensive cryptographic elements that cannot be processed by a smart meter’s (SM) computing power. To address the aforementioned issues, an AP-HBSG: authentication protocol for heterogeneous blockchain-based smart grid environment is designed. The designed protocol operates in a decentralized environment, thus eliminating a single point of failure and management. Furthermore, a blind signature is applied to the blockchain network to add authentication security among blockchain nodes. In addition, AP-HBSG is lightweight and it fits the SM computing capability. Moreover, AP-HBSG can protect the communication of parties interacting in a heterogeneous environment. On the other hand, the security of the presented protocol is analyzed in the random oracle model (ROM) and proved under the elliptic curve discrete logarithm (ECDL) problem and the computational Diffie–Hellman (CDH) problem. The protocol’s performance analysis shows that, compared to the most recent protocols, ours has lower communication and computation costs. The computation cost (ms) is 122,68, 216.86, 391.34, and 92.01 for WHZS, KKN, WLCTA, and ours, respectively. On the other hand, the communication cost (bytes) is 344, 184, 568, and 182 for WHZS, KKN, WLCTA, and ours, respectively.

A group key exchange and secure data sharing based on privacy protection for federated learning in edge‐cloud collaborative computing environment

SummaryFederated learning (FL) is widely used in internet of things (IoT) scenarios such as health research, automotive autopilot, and smart home systems. In the process of model training of FL, each round of model training requires rigorous decryption training and encryption uploading steps. The efficiency of FL is seriously affected by frequent encryption and decryption operations. A scheme of key computation and key management with high efficiency is urgently needed. Therefore, we propose a group key agreement technique to keep private information and confidential data from being leaked, which is used to encrypt and decrypt the transmitted data among IoT terminals. The key agreement scheme includes hidden attribute authentication, multipolicy access, and ciphertext storage. Key agreement is designed with edge‐cloud collaborative network architecture. Firstly, the terminal generates its own public and private keys through the key algorithm then confirms the authenticity and mapping relationship of its private and public keys to the cloud server. Secondly, IoT terminals can confirm their cryptographic attributes to the cloud and obtain the permissions corresponding to each attribute by encrypting the attributes. The terminal uses these permissions to encrypt the FL model parameters and uploads the secret parameters to the edge server. Through the storage of the edge server, these ciphertext decryption parameters are shared with the other terminal models of FL. Finally, other terminal models are trained by downloading and decrypting the shared model parameters for the purpose of FL. The performance analysis shows that this model has a better performance in computational complexity and computational time compared with the cited literature.

A secure communication using multifactor authentication and key agreement techniques in internet of medical things for COVID‐19 patients

AbstractCurrently, Internet of Medical Things (IoMT) gained popularity because of an ongoing pandemic. A few developed countries plan to deploy the IoMT for improving the security and safety of frontline workers to decrease the mortality rates of COVID‐19 patients. However, IoMT devices share the information through an open network which leads to increased vulnerability to various attacks. Hence, electronic health management systems remain many security challenges, like recording sensitive patient data, secure communication, transferring patient information to other doctors, providing the data for future medical diagnosis, collecting data from WBAN, etc. In addition, the sensor devices attached to the human body are resource‐limited and have minimal power capacity. Hence, to protect the medical privacy of patients, confidentiality and reliability of the system, the register sensor, doctor and server need to authenticate each other. Therefore, rather than two factors, in this work, a multifactor authentication protocol has been proposed to provide more secure communication. The presented scheme uses biometric and fuzzy extractors for more security purposes. Furthermore, the scheme is proved using informal and formal security verification BAN logic, ProVerif and AVISPA tools. The ProVerif simulation result of the suggested scheme shows that the proposed protocol achieves session key secrecy and mutual authentication

Secure authentication protocol for IoT applications based on blockchain technology

The lack of security in Internet of Things (IoT) infrastructure across different applications has attracted the attention of researchers to work on IoT security issues. The paper presents a scenario where blockchain technology is combined with IoT to provide a decentralized security mechanism. Secure authentication and Key-Agreement technique are proposed for IoT nodes and peers to ensure proper authorization before communication can take place. The proposed protocol uses public key cryptography to generate a shared symmetric key for mutual authentication and two-party conversation. The protocol was tested using Scyther and was found to be robust enough to withstand all known authentication-related attacks, including replay, and typing attacks. Hyperledger, a blockchain technology, was employed to provide a more efficient IoT-enabled infrastructure for the scalability of IoT devices on the network. The proposed technique provides a secure and scalable system for device authentication in a blockchain-enabled IoT environment.

MSK‐PK: A Public‐Key Encryption Cryptosystem with Multiple Secret‐Keys

By allowing intermediate nodes to combine multiple packets before forwarding them, the concept of network coding in multi-cast networks can provide maximum possible information flow. However, this also means traditional encryption methods are less applicable, since the different public-keys of receivers imply different ciphertexts which cannot be easily combined by network coding. While network coding itself may provide confidentiality, its effectiveness heavily depends on the underlying network topology and ability of the eavesdroppers. Finally, broadcast encryption and group key agreement techniques both allow a sender to broadcast the same ciphertext to all the receivers, although they rely on the assumptions of trusted key servers or secure channels. In this paper, we propose a novel public-key encryption concept with a single public-key for encryption and multiple secret keys for decryption (MSK-PK), which has limited ciphertext expansion and does not require trusted key servers or secure channels. To demonstrate the feasibility of this concept, we construct a concrete scheme based on a class of lattice-based multi-trapdoor functions. We prove that those functions satisfy the one-wayness property and can resist the nearest plane algorithm.

An Efficient Three-Factor Authenticated Key Agreement Technique Using FCM Under HC-IoT Architectures

The Human-Centered Internet of Things (HC-IoT) is fast becoming a hotbed of security and privacy concerns. Two users can establish a common session key through a trusted server over an open communication channel using a three-party authenticated key agreement. Most of the early authenticated key agreement systems relied on pairing, hashing, or modular exponentiation processes that are computationally intensive and cost-prohibitive. In order to address this problem, this paper offers a new three-party authenticated key agreement technique based on fractional chaotic maps. The new scheme uses fractional chaotic maps and supports the dynamic sensing of HC-IoT devices in the network architecture without a password table. The projected security scheme utilized a hash function, which works well for the resource-limited HC-IoT architectures. Test results show that our new technique is resistant to password guessing attacks since it does not use a password. Furthermore, our approach provides users with comprehensive privacy protection, ensuring that a user forgery attack causes no harm. Finally, our new technique offers better security features than the techniques currently available in the literature.

SecureAuthKey: Design and Evaluation of a Lightweight Key Agreement technique for Smart Home Applications

SecureAuthKey: Design and Evaluation of a Lightweight Key Agreement technique for Smart Home Applications

SecureAuthKey: design and evaluation of a lightweight key agreement technique for smart home applications

Cyber physical systems (CPS) is a ubiquitous concept where objects are connected to the internet and equipped with an ability to sense physical medium and transmit data through network. In recent years, smart home applications have gained popularity due to their various benefits like time-saving, low cost, optimised electricity use. The main component of the CPS is a low-capacity sensor node. Due to resource limitations like low storage space and limited processing power, the well-known security mechanisms used in desktop devices fail to run on these systems. For secure smart home systems, this research paper proposes a lightweight key agreement and authentication mechanism. It protects against various cyberattacks. It also provides communication security, privacy protection for end-users, and a low-cost system for sustainable production. The system's proof-of-concept prototype has been implemented, demonstrating the system's feasibility. The real-world experiments show the system's effectiveness and efficiency in various scenarios.

An Edge Assisted Secure Lightweight Authentication Technique for Safe Communication on the Internet of Drones Network

Security and privacy are among the most critical challenges on the internet of drones (IoD) network. The communication entities of the IoD network can communicate securely with the use of authenticated key agreement (AKA) based techniques. However, the design of such techniques must balance the tradeoff between security and lightweight features. Recently, Chen et al. proposed an authentication and key sharing scheme for IoD deployment. It is, however, realized after scrutiny that the proposed technique is vulnerable to security attacks under the well-accepted Canetti-Krawczyk (CK) adversary model. Moreover, the scheme applies to the IoD network with only one drones' flying zone. To solve these challenges, this paper proposed a secure lightweight proven authenticated key agreement (SLPAKA) technique for IoD deployment. The technique is free from all the problems identified in the scheme of Chen et al. To ensure the reliability of the SLPAKA, the security of the technique has been assessed from a theoretical method and formal way using the ProVerif cryptographic protocol verification tool. Apart from comparing the performance of SLPAKA with the benchmarking schemes in terms of security, computational cost, and communication cost, the SLPAKA and the technique proposed by Chen et al. are implemented using a python programming language to evaluate and compare their performance in terms of energy consumption and computational time metrics. The results show that the SLPAKA outperforms the technique of Chen et al. and all the other benchmarking techniques in terms of security and lightweight features.

Manipulative Attack Against Physical Layer Key Agreement and Countermeasure

Physical layer key agreement techniques derive a symmetric cryptographic key from the wireless fading channel between two wireless devices by exploiting channel randomness and reciprocity. Current efforts have focused mainly on the security issue and protocol design of the techniques under passive attack and jamming attack. In this paper, we raise the subject of manipulative attack. The attacker wants the keying devices to actually agree on some valid, but manipulated bits. We discuss the feasibility and different means to launch manipulative attack. Aiming at a practical countermeasure, we further propose PHY-UIR (PHYsical layer key agreement with User Introduced Randomness). Both keying devices generate and use random voltage levels $\mathbf {X} = \lbrace x[1],x[2] \ldots x[N] \rbrace$ X = { x [ 1 ] , x [ 2 ] ... x [ N ] } and $\mathbf {Y} = \lbrace y[1],y[2] \ldots y[N] \rbrace$ Y = { y [ 1 ] , y [ 2 ] ... y [ N ] } to exchange probing frames over reciprocal random fading channels $\mathbf {H} = \lbrace h[1],h[2] \ldots h[N] \rbrace$ H = { h [ 1 ] , h [ 2 ] ... h [ N ] } . At receiving end, they multiply the received channel measurements ${\mathbf {XH}}$ XH and ${\mathbf {YH}}$ YH with the random sequences $\mathbf {Y}$ Y and $\mathbf {X}$ X to compose a common keying sequence $\mathbf {XYH}$ XYH . With this solution, the attacker can no longer manipulate the keying sequences established at legitimate sides and infer the subsequent key. We analyze the security strength of PHY-UIR and conduct extensive simulations to evaluate it. We also perform proof-of-concept experiments by using software defined radios in a real-world environment. Both simulations and experiments demonstrate the effectiveness of PHY-UIR.

Full Session Key Agreement Scheme Based on Chaotic Map in Vehicular Ad Hoc Networks

Vehicular ad hoc networks (VANETs) are wireless self-organizing networks, whose communication is conducted through open wireless channels, thus making it vulnerable to various attacks. It is therefore necessary to employ encryption technology to ensure secure communication. In view of the foregoing, key agreement techniques are introduced to VANET communications. The group key agreement (GKA) protocol allows a group of participants to establish a public session key for a secure communication channel over an insecure network. The traditional GKA protocol is inefficient, however, and consumes considerable amounts of resources. With the aim of resolving problems related to information security and privacy preservation in VANETs, this paper proposes a full session key agreement scheme based on chaos mapping. In this paper, the first phase describes the key agreement between the fog server and group administrator; the second phase describes the group key agreement for vehicle nodes in the group where the vehicle can only communicate with vehicles having the same group key without the aid of a trusted key center or centralized key distributor. The proposed scheme is based on Chebyshev chaotic mapping algorithm, in which a chaotic map is utilized to provide a one-way hash; Chebyshev polynomial is also employed to establish a public multi-party key; it avoids the modular multiplication index or scalar multiplication on the elliptic curve. The proposed scheme does not only satisfy the security requirements in VANETs but also performs detailed analysis.

SPSC: A secure and privacy‐preserving autonomous platoon setup and communication scheme

SummaryThe new driving model of autonomous platoon has outlined the blueprint for developing the intelligent transportation of system since it can improve safe driving, alleviate traffic congestion and bring more comfortable experience. Vehicles in the platoon can communicate and share driving data with each other through vehicular network for cooperatively driving. Therefore, it is crucial to avoid some misbehavior vehicles which can eavesdrop or even tamper important data. In this paper, we propose a secure and privacy‐preserving autonomous platoon setup and communication scheme, called SPSC, to help vehicles establish secure communication and avoid private information leakage. Specially, considering the dynamic and temporary characteristics of the autonomous platoon, the autonomous platoon communication can be divided into two scenarios, that is, intra‐platoon communication and inter‐platoon communication. In the intra‐platoon communication, the SPSC can securely set up platoon and dynamically manage the platoon members with privacy preservation by using private set intersection and group key agreement techniques, respectively. In the inter‐platoon communication, the SPSC can also achieve secure and anonymous communication by adopting certificateless ring signcyption technique. In addition, vehicle‐out‐platoon can trace the disputed or misbehavior platoon member with the assistance of Road Transportation Authority. The security analysis shows that SPSC can provide authentication, privacy protection, confidentiality and traceability. Finally, the performance of SPSC is comprehensively evaluated by simulation to demonstrate its efficiency in terms of the computation cost.

Toward Securing Cyber-Physical Systems Using Exact Cover Set

Cyber physical systems (CPS) are computer systems that integrate computing, coordination and communication systems in order to monitor physical entities in the physical world. As they interact with the critical systems and infrastructure that may impact real life. There are many issues in design and constructions of these types of systems. One of the key issue that receives so many attention is the security of such systems. Although security solutions for Information Systems handle the security issues associated with Traditional IT security, but the impact of a failure in a cyber-physical system demands a different approach to handle security issues related to the cyber world. In this work, we focus on using a key agreement technique known as Physical Signal Key Agreement (PSKA) technique using the Exact Cover method to generate the random key which will be embedded into an access control model known as the Modified Context-Aware Security The feasibility of our framework (MCASF) to handle both normal and critical situation on demand is demonstrated via a Pervasive Health Monitoring Systems (PHMS).

Mutually authenticated key agreement protocol based on chaos theory in integration of internet and MANET

Integrated Internet MANET (IIM) is a network which is formed by the interconnection of the internet and mobile ad hoc network. IIM suffers from many security issues due to open wireless medium and lack of mutual authentication. Mutual authenticated key agreement technique is used to securely agree on session key between communicating entities. In order to provide mutual authentication between mobile node and a fixed node in IIM, one must overcome two problems i.e. key management and computational cost. The strength of any security algorithm depends on its key management technique. We propose a method to provide mutual authentication between communicating entities using chaos theory. It overcomes the key management cost by avoiding modular exponentiation and scalar multiplications. Through extensive simulation analysis, we conclude that the proposed method provides a better approach towards security and protection of data from malicious nodes with minimum overhead in IIM.

Mutually authenticated key agreement protocol based on chaos theory in integration of internet and MANET

Integrated Internet MANET (IIM) is a network which is formed by the interconnection of the internet and mobile ad hoc network. IIM suffers from many security issues due to open wireless medium and lack of mutual authentication. Mutual authenticated key agreement technique is used to securely agree on session key between communicating entities. In order to provide mutual authentication between mobile node and a fixed node in IIM, one must overcome two problems i.e. key management and computational cost. The strength of any security algorithm depends on its key management technique. We propose a method to provide mutual authentication between communicating entities using chaos theory. It overcomes the key management cost by avoiding modular exponentiation and scalar multiplications. Through extensive simulation analysis, we conclude that the proposed method provides a better approach towards security and protection of data from malicious nodes with minimum overhead in IIM.

Design of an efficient and provably secure anonymity preserving three‐factor user authentication and key agreement scheme for TMIS

AbstractSeveral remote user authentication techniques for telecare medicine information system (TMIS) have been proposed in the literature. But most existing techniques have limitations such as vulnerable to various attacks, lack of functionalities, and inefficiency. Recently, Amin and Biswas proposed a three‐factor authentication and key agreement technique for TMIS. But their scheme is inefficient and has several security drawbacks. The attacks such as privileged‐insider, user impersonation, and strong reply attacks are possible on their scheme. It also has flaw in password update phase. In order to overcome drawbacks of their scheme, a new provably secure and efficient three‐factor remote user authentication scheme for TMIS is proposed in this paper. The proposed scheme overcomes all drawbacks of their scheme and also provides additional features such as user unlinkability, user anonymity, efficient password, and biometric update. The rigorous informal and formal security analysis using random oracle models and the mostly acceptable Automated Validation of Internet Security Protocols and Applications tool is also performed. During the experimentation, it has been observed that the proposed scheme is secure against various known attacks that include replay and man‐in‐the‐middle attacks. Furthermore, the analysis of computation and communication cost estimation of the proposed scheme depicts that our scheme is efficient as compared with other related exiting schemes. Copyright © 2016 John Wiley & Sons, Ltd.

Ad-hoc 망에서 이동 노드 간 상호 인증

It was diversified demand for a wireless network to the rapid growth of the Internet, the time and space that are not in the new level of Internet technology, limits the Ad-hoc networks are needed. Ad-hoc networks do not communicate with the central station, each of the mobile nodes included in the network communicate with each other by the relay role. In recent years, the Ad-hoc wireless networks in a variety of routing protocols and network security, research is actively underway for the authentication method, but the security of wireless Internet and Ad-hoc networks, certification is incomplete situation. This paper considers the authentication and key agreement technique applicability of the USIM card using the DSR routing protocol of the Java Card and Ad-hoc networks, we propose a secure authentication mechanism between the mobile node.