Authenticated Group Key Agreement Research Articles

An Anonymous Authenticated Group Key Agreement Scheme for Transfer Learning Edge Services Systems

The visual information processing technology based on deep learning (DL) can play many important yet assistant roles for unmanned aerial vehicles (UAV) navigation in complex environments. Traditional centralized architectures usually rely on a cloud server to perform model inference tasks, which can lead to long communication latency. Using transfer learning (TL) to unload deep neural networks (DNN) to the edge-fog collaborative networks has become a new paradigm for dealing with the conflicts between computing resources and communication latency. However, ensuring the security of edge-fog collaborative networks entity is still challenging. For such, we propose an anonymous authentication and group key agreement scheme for the UAV-enabled edge-fog collaborative networks, consisting of UAV authentication protocol and collaborative networks authentication protocol. Utilizing the AVISPA assessment tool and security analysis, the security requirements and functional features of the proposed scheme are demonstrated. From the performance results of the proposed scheme, we show that it is superior to existing authentication schemes and promising.

A Dynamic and Efficient Self-Certified Authenticated Group Key Agreement Protocol for VANET

A Dynamic and Efficient Self-Certified Authenticated Group Key Agreement Protocol for VANET

Secure and efficient authenticated group key agreement protocol for AI-based automation systems

Automation systems are soaring due to the innovation of artificial intelligence (AI) technologies. In this paper, we mainly concentrate on the security and efficiency of data transmission in AI-based automation systems, especially, for data sharing in a group manner in distributed networks. To this end, an authenticated group key agreement protocol is proposed for secure data transmission in AI-based automation systems. In order to release the computational overhead of distributed nodes, a semi-trusted authority (STA) is introduced to enable precomputation operations. Moreover, to overcome the predominantly distributed denial of service (DDoS) attack, a dynamic batch verification mechanism is devised. The presented dynamic batch verification mechanism guarantees that the proposed protocol can be run properly among legitimate nodes regardless of the existence of nodes who suffered from the DDoS attack. Finally, the session key security of the proposed protocol is proved and the performance is evaluated.

Fast and Lightweight Authenticated Group Key Agreement Realizing Privacy Protection for Resource-Constrained IoMT

Fast and Lightweight Authenticated Group Key Agreement Realizing Privacy Protection for Resource-Constrained IoMT

TAGKA: Threshold Authenticated Group Key Agreement Protocol Against Member Disconnect for UANET

The development of unmanned aerial vehicle (UAV) technology has been advancing rapidly and is widely applied in various domains. Compared to a single UAV, the multi-UAV system, known as the UAV Ad Hoc Network (UANET), can collaborate to accomplish complex tasks more efficiently. Due to the UAVs communicating through open wireless channels, they are vulnerable to various attacks. Group key agreement protocols are often used to guarantee the security of UANET communication. However, the high dynamics of UAVs and the instability of the wireless links often result in certain UAVs temporarily losing connection with the group, rendering them incapable of participating in the group key agreement process. Regrettably, existing literature on group key agreement does not consider this issue, which makes them not applicable to UANET. To address this issue, we propose a threshold authenticated group key agreement protocol (TAGKA) that can resist the disconnection of group members. Then, considering that the temporarily disconnected UAVs need to obtain the latest group key after the communication links are recovered, we design a group key recovery protocol. The security of the scheme is proved under the random oracle model. Moreover, formal security verification using the Tamarin and rigorous informal security analysis is also performed. Finally, we use NS-3 to simulate the protocol, and the experimental results show that our protocol can be effectively applied to UANET.

A two rounds dynamic authenticated group key agreement protocol based on LWE

The goal of a group key agreement (GKA) protocol is to enable multiple users to compute and share a same session key over an open channel. Some GKA protocols based on the discrete logarithm problem also consider the authentication, forward security and dynamic. However, these protocols cannot satisfy post-quantum security. The existing lattice-based post-quantum dynamic GKA protocols cannot resist the known session key attacking. In this paper, we propose a two-round lattice-based dynamic authenticated GKA protocol based on the learning with errors (LWE) problem. We use random oracle prove that our protocol is secure under the standard corruption model. Our protocol requires only two rounds of communication and does not limit the number of members involved.

A Certificateless-based One-Round Authenticated Group Key Agreement Protocol to Prevent Impersonation Attacks

A Certificateless-based One-Round Authenticated Group Key Agreement Protocol to Prevent Impersonation Attacks

A Lightweight Certificateless Group Key Agreement Method without Pairing Based on Blockchain for Smart Grid

In smart grids, the access verification of a large number of intelligent gateways and terminal devices has become one of the main concerns to ensure system security. This means that smart grids need a new key management method that is safe and efficient and has a low computational cost. Although a large number of scholars have conducted relevant research, most of these schemes cannot balance the computational overhead and security. Therefore, we propose a lightweight and secure key management method, having a low computational overhead, based on blockchain for smart grids. Firstly, we redesigned the architecture of the smart grid based on blockchain and completed the division of various entities. Furthermore, we designed a pairing-free certification authenticated group key agreement method based on blockchain under the architecture. Finally, we achieved higher security attributes, and lower authentication delay and computational overhead, compared to the traditional schemes, as shown in performance analysis and comparison.

A secure blockchain-based group key agreement protocol for IoT

Since most Internet of things (IoT) devices are energy-limited, increasingly more manufacturers have chosen to develop IoT applications based on group communication. For these applications, a secure and effective authenticated group secret key is fundamental to whole group communication. A large number of related protocols have been proposed to address this security problem. However, most of them have a centralized architecture, which is vulnerable to a single point of failure. Blockchain technology has the potential to address the challenges mentioned above because of its distributed, secure, and private property. Thus, this paper proposes a blockchain-based authenticated group key agreement protocol for IoT. The proposed protocol introduces a new entity called the device manager, who acts as an intermediary to connect IoT devices with blockchain networks. Security analysis demonstrates the robustness of the proposed protocol to various kinds of attacks. Besides, the simulation results further show that the time costs of protocol operations are reasonable and suitable for IoT environments.

Cross-domain certificateless authenticated group key agreement protocol for 5G network slicings

Network slicing technology is a core part of 5G network, which enables users to access the suitable network on demand and increases the flexibility of network resources through appropriate network configuration. However, the group users in dynamic 5G network slices face communication security threats (impersonation attack, network monitoring, identity leakage, etc.). Group key agreement (GKA) protocol can be used to ensure the security of communication for group users. However, most GKA protocols do not consider cross-domain environment, or use the same cryptographic system parameters between all communication nodes in cross-domain environment. This study presents a cross-domain certificateless authenticated GKA protocol for 5G network slicings supporting dynamic group users management. This new scheme only needs one-round communication and allows group users from different network domains with different cryptographic system parameters to agree on a group session key in common. The proposed scheme not only can provide authenticated key agreement security, mutual authentication, perfect forward secrecy, user anonymity and partial private key transmission security, but also is able to withstand the impersonation, replay and known temporary key attacks. As compared with existing three certificateless group key agreement protocols, our proposed scheme has less computation time, and the communication overhead of low-power group user in our proposed is reduced by at least 36%.

CL-AGKA: certificateless authenticated group key agreement protocol for mobile networks

Wireless group communication has gained much popularity recently due to the increase in portable, lightweight devices. These devices are capable of performing group communication by enabling every participant to agree upon a group key for secure communication in an insecure network. Many authenticated group key agreement schemes have been proposed, but most of the schemes lack the dynamic property of mobile node joining/leaving the group such that the session key is updated without affecting the protocol. In this paper, we propose a pairing-free certificateless authenticated group key agreement protocol based on elliptic curve cryptosystem for resource-constrained mobile nodes. The objective of the proposed key-agreement protocol is to ensure the un-deniability of any message exchanged between the sender and receiver, contributory property for group key agreement, and allowing mobile users to join or leave the group dynamically by enabling forward and backward secrecy. Through the rigorous security analysis, we show that the proposed scheme achieves the well-known security functionalities against various types of attacks using informal security analysis and rigorous formal analysis using the random oracle model. Moreover, the protocol validation result using broadly-accepted automated validation of internet security protocols and applications shows that the protocol is safe under OFMC and CL-AtSe back-ends. Furthermore, the result of performance analysis shows that our proposed scheme achieves desirable security properties as compared to the existing related schemes by reducing the overall computation and communication cost despite a gradual increase in the number of participating mobile nodes.

Authenticated Group Key Agreement Protocols for Error Detection and Correction

Group verification and essential deal represents an essential position in security. The important thing deal methods must promise confidentiality and reliability of message. Important Deal Process offers essential progress in safety to guard reliability, consumer namelessness and confidentiality of information. Tradi- tional essential administration options reported within the litera-ture absence each the flexibleness and hardiness required to cope with the powerful character of sudden networks. in this report, we are likely to propose 2 different n-party echt essential deal methods enabling certified nodes to gener-ate their particular treatment keys. the principal method presents a remedy reinforced heap methods befitting net-works with incomplete framework and consists of a large num- ber of nodes. one-to-many multicast circumstances because a positive 3rd party (TTP) (or an assortment thereof) located at, or very near to, the method of getting conversation, may help ongoing function among an ar-bitrary partition for as long since it provides the supply. this is often adequate because most one-to-many controls entirely try to present ongoing protected function among one partition comprising the supply.</p>

On the Security of Authenticated Group Key Agreement Protocols

The group key agreement protocol enables to derive a shared session key for the remote members to communicate securely. Recently, several attempts are made to utilize group key agreement protocols for secure multicasting in Internet of Things. This paper contributes to identify the security vulnerabilities in the existing protocols, to avoid them in future constructions. The protocols presented by Gupta and Biswas have been found insecure to ephemeral secret key leakage (ESL) attack and also, malicious insiders can impersonate an honest participant. Additionally, the protocol presented by Tan is also ESL-insecure. We also present a fix to the Tan's protocol to make it secure.

Authenticated Group Key Agreement Protocol Based on Twisted Conjugacy Root Extraction Problem in Near-Ring

Authenticated Group Key Agreement Protocol Based on Twisted Conjugacy Root Extraction Problem in Near-Ring

Anonymous group key agreement protocol for multi-server and mobile environments based on Chebyshev chaotic maps

A group key agreement protocol can establish a secret key shared among some participants for secure group-oriented applications. Many authenticated group key agreement protocols are proposed, but some of them cannot provide user anonymity. Xiao et al. (Inf Sci 177:1136–1142, 2007) proposed an improved key agreement protocol based on chaotic maps with only a predetermined long-term key to ensure security. Guo and Zhang (Inf Sci 180:4069–4074, 2010) proposed a group key agreement protocol based on chaotic hash function, but Yoon et al. recently pointed out that Guo et al.’s protocol is vulnerable to off-line password guessing attack, stolen-verifier attack, and reflection attack. In this paper, we will propose an authenticated group key agreement protocol with user anonymity based on Chebyshev chaotic maps to resist above pointed out attacks and achieve the following properties with better performance: (i) It is suitable for multi-server and mobile environments; (ii) it achieves contributory group key agreement with user authentication; (iii) it provides mutual authentication, explicit key authentication, key confirmation, forward secrecy, and group key updating; (iv) user anonymity can simultaneously be preserved in the group key agreement procedure, which implies that identities of all participants are anonymously to outsiders; (iv) no public key certificates are used, which implies that authenticity of public keys are implicitly verified; (vi) it can also resist password guessing and stolen-verifier attacks.

Authenticated group key agreement protocol based on twist conjugacy problem in near-rings

Nowadays some promising authenticated group key agreement protocols are constructed on braid groups, dynamic groups, pairings and bilinear pairings. Hence the non-abelian structure has attracted cryptographers to construct public-key cryptographic protocols. In this article, we propose a new authenticated group key agreement protocol which works in non-abelian near-rings. We have proved that our protocol meets the security attributes under the assumption that the twist conjugacy search problem (TCSP) is hard in near-ring.

A Provable Secure and Escrow-able Authenticated Group Key Agreement Protocol without NAXOS Trick

A Provable Secure and Escrow-able Authenticated Group Key Agreement Protocol without NAXOS Trick

Provably Authenticated Group Key Agreement based on Braid Groups - The Dynamic Case

Provably Authenticated Group Key Agreement based on Braid Groups - The Dynamic Case

A Pairing-free Certificateless Authenticated Group Key Agreement for Mobile Ad Hoc Network

The mobile Ad Hoc network is widely used in fields without communication infrastructure. To meet the demand for highly secure and efficient group communication in Ad Hoc network, many contributory group key agreement protocols have been proposed. But most of these proposed protocols focused on security with bilinear pairing calculation, which is a computational-heavy operation. In this paper, a pairing-free certificateless authenticated group key agreement is proposed. By using scalar multiplication of elliptic curves and a binary key tree structure, the proposed protocol reduces computation overhead and meanwhile provides secure services for dynamic groups. The result demonstrates that the protocol is secure, efficient and suitable for Ad Hoc network.

An Identity‐Based Group Key Agreement Protocol for Low‐Power Mobile Devices

In wireless mobile networks, group members join and leave the group frequently, a dynamic group key agreement protocol is required to provide a group of users with a shared secret key to achieve cryptographic goal. Most of previous group key agreement protocols for wireless mobile networks are static and employ traditional PKI. This paper presents an ID-based dynamic authenticated group key agreement protocol for wireless mobile networks. In Setup and Join algorithms, the protocol requires two rounds and each low-power node transmits constant size of messages. Furthermore, in Leave algorithm, only one round is required and none of low-power nodes is required to transmit any message, which improves the efficiency of the entire protocol. The protocol's AKE-security with forward secrecy is proved under Decisional bilinear inverse Diffie-Hellman (DBIDH) assumption. It is additionally proved to be contributory.