Group Key Agreement Protocol Research Articles

WITHDRAWN: Design of Group Key Agreement Method Based on Elliptic Curve Cryptography in New Energy Extensive Access Security Protection

Aiming at the security problem of power system communication network under the condition of extensive access of new energy, we design the group key agreement method based on elliptic curve cryptography in the security protection of new energy extensive access. Design the architecture of power system security protection network under the condition of extensive access to new energy. The network architecture adopts wireless communication technology to realize the transmission of new energy security monitoring information. For the data confidentiality problem in the wire communication technology, the group key agreement method based on elliptic curve cryptography is proposed, and the group key agreement model is constructed under the set conditions, and the group key is generated through the processes of main parameter selection, group composite public key distribution, group key agreement protocol design, group key update protocol for node joining event, and group key update protocol for members departure event, etc. The group key is utilized for the communication. The experimental results show that this method can generate the key with high randomness and excellent key sensitivity, which can effectively resist the attacks of character frequency statistics and information entropy and guarantee the security of communication information.

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

Lightweight ring-neighbor-based user authentication and group-key agreement for internet of drones

As mobile internet and Internet of Things technologies continue to advance, the application scenarios of peer-to-peer Internet of Drones (IoD) are becoming increasingly diverse. However, the development of IoD also faces significant challenges, such as security, privacy protection, and limited computing power, which require technological innovation to overcome. For group secure communication, it is necessary to provide two basic services, user authentication and group key agreement. Due to the limited storage of IoD devices, group key negotiation requires lightweight calculations, and conventional schemes cannot satisfy the requirements of group communication in the IoD. To this end, a new lightweight communication scheme based on ring neighbors is presented in this paper for IoD, which not only realizes the identity verification of user and group key negotiation, but also improves computational efficiency on each group member side. A detailed security analysis substantiates that the designed scheme is capable of withstanding attacks from both internal and external adversaries while satisfying all defined security requirements. More importantly, in our proposal, the computational cost on the user side remains unaffected by the variability of the number of members participating in group communication, as members communicate in a non-interactive manner through broadcasting. As a result, the protocol proposed in this article demonstrates lower computational and communication costs in comparison to other cryptographic schemes. Hence, this proposal presents a more appealing approach to lightweight group key agreement protocol with user authentication for application in the IoD.

A dynamic C-V2X anonymous authentication and group key agreement protocol

A dynamic C-V2X anonymous authentication and group key agreement protocol

A group key agreement protocol for Vanet based on Chinese remainder theorem and blockchain

AbstractVehicular ad hoc Network (VANET) is a wireless self‐organizing network for obtaining information about road conditions, vehicle speed, vehicle location and traffic congestion. Traditional key negotiation protocols create many problems when dealing with a group of vehicles that need to communicate over a public channel. For example, traditional key negotiation protocols rely too much on the participation of trusted institutions and suffer from a single point of failure. Meanwhile, group session key negotiation is usually inefficient with high computational cost and communication overhead. To solve these problems, this paper proposes a blockchain‐based Chinese Remainder Theorem (CRT) VANET group key agreement. In addition, the protocol supports dynamic management of vehicles, including joining and exit. Formal security proofs show that our solution satisfies basic security requirements. Experiments using ProVerif show that the protocol functions properly even under many active and passive attacks, such as eavesdropping attacks. Performance analysis shows that the protocol is more efficient in the face of multi‐vehicle communication, in particular by reducing the computational cost by up to 75% and the communication overhead by up to 66%.

An Efficient Technique for Secure Message Broadcasting

In contemporary cryptographic discourse, traditional broadcast encryption (BE) schemes have emerged as a robust method for secure broadcasting to specific subsets of members within a group. However, these schemes typically necessitate the involvement of a trusted entity for the distribution of decryption keys, which introduces vulnerabilities. Conversely, group key agreement (GKA) protocols offer a means of negotiating a shared encryption key among a group of members across open networks, thereby ensuring that only authorized group members possess the capability to decrypt ciphertexts encrypted under this key. Nonetheless, GKA protocols lack the flexibility to allow senders to selectively exclude specific members from decrypting ciphertexts. In response to this dichotomy, we present a pioneering hybrid cryptographic primitive termed Contributory Broadcast Encryption (ConBE), which ingeniously amalgamates the strengths of both BE and GKA paradigms. In this innovative approach, a cohesive group of members collaboratively negotiates a shared public encryption key, with each member possessing an associated decryption key. This setup empowers senders, upon accessing the public group encryption key, to exercise granular control over decryption, selectively restricting access to a subset of designated recipients. Expounding upon this foundational framework, we introduce a ConBE scheme distinguished by succinct ciphertexts, thus optimizing computational efficiency without compromising on security guarantees. Through rigorous analysis, our scheme is proven to be fully collusion-resistant under the decision n- Bilinear Diffie-Hellman Exponentiation (BDHE) assumption, thereby ensuring robust security within the standard cryptographic model. Furthermore, in a complementary contribution, we unveil a novel BE scheme endowed with aggregatable properties, which hold paramount significance in the construction of advanced cryptographic protocols. These properties facilitate the aggregation of decryption rights across multiple ciphertexts, thereby enhancing scalability and versatility in cryptographic applications. Our comprehensive exploration and formalization of ConBE, alongside the development of efficient cryptographic schemes, represent a significant stride forward in the realm of secure data transmission and access control mechanisms. This endeavor underscores our commitment to advancing cryptographic methodologies that reconcile security, efficiency, and flexibility in contemporary distributed computing environments

ER-CGKA: Efficient and robust continuous group key agreement scheme with post-compromise forward security for IoV.

The Internet of Vehicles (IoV) counts for much in advancing intelligent transportation by connecting people, vehicles, infrastructures, and cloud servers (CS). However, the open-access wireless channels within the IoV are susceptible to malicious attacks. Therefore, an authentication key agreement protocol becomes essential to ensure secure vehicular communications and protect vehicle privacy. Nevertheless, although the vehicles in the group are compromised, they can still update the group key and obtain the communication content in the existing group key agreement protocols. Therefore, it is still challenging to guarantee post-compromise forward security (PCFS). Dynamic key rotation is a common approach to realizing PCFS, which brings a heavy computation and communication burden. To address these issues, an efficient and robust continuous group key agreement (ER-CGKA) scheme with PCFS is designed for IoV. The propose-and-commit flow is employed to support asynchronous group key updates. Besides, the computation cost and communication overhead are significantly reduced based on the TreeKEM architecture. Furthermore, we adopt the threshold mechanism to resist the collusion attacks of malicious vehicles, which enhances the ER-CGKA scheme's robustness. Security analysis indicates that the proposed scheme satisfies all the fundamental security requirements of the IoV and achieves PCFS. The performance evaluation results show that our ER-CGKA scheme demonstrates a reduction in the computation cost of 18.82% (Client) and 33.18% (CS) approximately, and an increase in communication overhead of around 55.57% since pseudonyms are utilized to achieve conditional privacy-preserving. Therefore, our ER-CGKA scheme is secure and practical.

Blockchain-Based Partial Group Key Agreement Protocol for Intelligent Transportation Systems

Blockchain-Based Partial Group Key Agreement Protocol for Intelligent Transportation Systems

SED-SGC: A scalable, efficient, and distributed secure group communication scheme based on superlattice PUF

A critical challenge in group communication is to guarantee the authenticity, integrity, and confidentiality of sensitive data, especially in scenarios with potential and prospective massive device access, such as the Internet of Everything (IoE). This paper explores a scalable, efficient, distributed secure group communication (SED-SGC) scheme that employs superlattice Physical Unclonable Function (PUF), tree structure, and the Decision Diffie–Hellman Problem. In SED-SGC, superlattice PUF facilitates lightweight, high-security mutual authentication and key generation. The Decision Diffie–Hellman Problem and tree structure construct group key agreement and dynamic member management protocol with logarithmic complexity, achieving forward and backward secrecy. Also, we demonstrate that SED-SGC can effectively guarantee security against multiple attack methods such as collusion attacks, man-in-the-middle attacks (MITM), and impersonation attacks.

Flexible and secure continues data transmission among multiple users in cloud environment

Cloud computing is an internet based computing where the sharable information, software and resources are provided based on demand devices. Where, the rapid development and pervasive growth of unavoidable sending of message advances, there are expanding requests of adaptable cryptographic natives to protected group data transactions and computing platforms in cloud. Group key agreement (GKA) protocol enables a group to share a standard encryption key across an open network so that only members of the group may decode the ciphertexts encoded using the secret encryption key that has been released. However, a sender cannot deny any specific member from decryptions the ciphertexts in cloud. However, before sending a message to a group, a user must join the group and follow the GKA protocol to provide the intended members access to a secret key. To find a better solution for the above-mentioned issues, flexible and secure continues data transmission (FSCDT) algorithm is proposed to offer dynamic and secure data transfer broadcasting without full trust of key authority in unreliable cloud environment. It provides compete security proof, outlines the requirements of the aggregatability of the secret attribute based FSCDT building block. Based on experimental evaluations, FSCDT algorithm minimizes encryption time, decryption time and communication cost.

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.

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.

Authenticated Distributed Group Key Agreement Protocol Using Elliptic Curve Secret Sharing Scheme

Authenticated Distributed Group Key Agreement Protocol Using Elliptic Curve Secret Sharing Scheme

Secure group key agreement protocol with elliptic curve secret sharing for authentication in distributed environments

Secure communication is crucial in today’s increasingly interconnected world, especially in distributed contexts where several parties must cooperate while maintaining confidentiality and authenticity. In order to overcome these difficulties, this work introduces a novel Secure Group Key Agreement Protocol (SGKAP) strengthened with Elliptic Curve Secret Sharing (ECSS).The proposed SGKAP uses the strength of elliptic curve cryptography to provide a shared secret key across participants, assuring data transmission confidentiality. Contrary to conventional methods, SGKAP integrates ECSS as a second layer of security to verify participant identity, thus boosting the protocol’s resistance to malevolent adversaries.To create a shared group key, members exchange their elliptic curve public keys at the start of the protocol. During this stage, ECSS is used, and participants create distinctive authentication tokens using their personal secrets. Participants exchange and verify these tokens among themselves, ensuring that only those with the proper permissions have access to the group key.In addition to guaranteeing data confidentiality, SGKAP also verifies the group members’ participation. Furthermore, by mandating secret-sharing-based authentication, ECSS strengthens the protocol’s resistance to insider attacks.We carried out a comprehensive set of simulations and experiments in various distributed contexts to assess the performance and security of SGKAP with ECSS.

A group key agreement protocol based on ECDH and short signature

A group key agreement protocol allows a set of users to establish a common session key over an open network. A dynamic contributory group key agreement (DCGKA) protocol generates a session key based on contributions of all group members and allows a member to dynamically join or leave this group. Although current DCGKA can resist passive attacks, it cannot resist positive attacks like the man-in-the-middle (MITM) attack. In this paper, we propose a dynamic contributory Group Key Agreement protocol by using Short Signature (called GKA-SS) which uses bilinear map to accomplish the signature and the verification processes. The formal security proof shows that our protocol can resist both active and passive attacks under random oracle model. The informal security analysis indicates that our protocol can obtain backward secrecy, forward secrecy, etc. Besides, we analyze the communication and computation cost of our protocol and simulate it with pypbc library. As compared with TGECDH, our protocol is 2.4 times faster in join phase and 29 times faster in leave phase, when p is 512 bits, q is 160 bits and group size is 256.

Asymmetric Group Key Agreement Protocol Based on Blockchain and Attribute for Industrial Internet of Things

In the era of Industry 4.0, the Industrial Internet of Things (IIoT) has been applied to help physical entities to access real-time data in the network and share critical information. However, both the decentralization of IIoT and the heterogeneity of different devices constituting IIoT also pose a serious threat to secure communication between entities. Although the encryption technologies can ensure the confidentiality of communication data, the security of key becomes more important for devices in IIoT. Recently, some asymmetric group key agreement (AGKA) protocols have been proposed to negotiate a common encryption key for group members, and each group member holds its decryption key. However, the existing AGKA protocols fail to effectively control the access of agreement participants in IIoT. To solve this problem, in this article, we propose an AGKA protocol based on blockchain and attribute for IIoT. The proposed protocol not only realizes the access control of agreement participants but also realizes the automation of access control, the tamper resistance, and the nonrepudiation of the agreement process. The security and performance analysis of the proposed protocol show that it is more secure and effective compared with the existing AGKA protocols.

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.

Public Key Protocols over Skew Dihedral Group Rings

This paper introduces skew dihedral group rings and their applications for public-key cryptography. We present a specific skew group ring that is the underlying algebraic platform for our cryptographic constructions. We then build a two-party key exchange protocol and present an analysis of its security. We then exploit it to derive a group key agreement protocol, a probabilistic public-key scheme, and a key encapsulation mechanism. In addition to the security analysis of our cryptographic constructions, we present a proof-of-concept implementation.

Anonymous Dynamic Group Authenticated Key Agreements Using Physical Unclonable Functions for Internet of Medical Things

Group authenticated key agreements (GAKAs) for an Internet of Medical Things (IoMT) enable medical sensor devices to authenticate each other and agree upon a common session key. These medical sensor devices can then establish a secure channel using this session key and exchange information securely. Owing to hardware limitations, sensors do not have sufficient computing power, energy, and storage resources to implement burdensome protocols. Moreover, sensors are easily damaged, causing the number of members of the group to change. Therefore, a group key agreement (GKA) protocol is required to consider dynamic groups and reduce the computational cost of an IoMT. The physical unclonable function (PUF) uses the uniqueness and randomness of its circuit to perform calculations. It has message fingerprints so that the user is not necessary to store a private key. The PUF is less computationally burdensome than the more common modular exponentiation and can be applied in an IoMT environment with limited resources. This article develops lightweight anonymous dynamic GAKA (DGAKA) that uses the PUF to solve the problems of data storage, transmission security, and computing efficiency that are faced by the IoMT. The proposed protocol has higher security and efficiency in computation and storage than those previously developed.

Efficient sharing of privacy-preserving sensing data on consortium blockchain via group key agreement

Due to the self-organizing and distributed nature of Wireless Sensor Networks (WSN), valuable data in sensor networks faces security and privacy risks. A blockchain-based approach enables secure and convenient sharing of sensor information among different users. Compared to public and private blockchains, consortium blockchain is widely used across different industries and use cases in WSN due to its auditability and high transaction rate. However, sensing data sharing via consortium blockchain raises the privacy issue. Therefore, the data from the sensor node is encrypted by the key (named sensorkey) shared by the sensor node and the sink node and then sent to the blockchain network to not reveal the privacy of the sensing data. Since the infrastructure in large-scale WSN is usually owned and managed by multiple organizations, encrypted sensing data needs to be authorized by these multiple organizations for computation. Organizations requesting privacy-preserving data are referred to as data sharers. Distributing the sensorkey to each data sharer requires separate encryption of the key using the data sharer’s public key. The sink node needs to be online when each data sharer asks for the sensorkey, and one encryption of the sensorkey for each data sharer consumes precious resources. This work proposes GSChain for efficient privacy-preserving sensing data sharing on consortium blockchain. Multiple data sharers resort to asymmetric group key agreement protocol to maintain a shared group encryption key and their respective group decryption keys, enabling efficient sensorkey retrieval from the consortium blockchain. The sensorkey is encrypted only once by the group encryption key and stored on the consortium blockchain along with the privacy-preserving sensing data. Our scheme improves the efficiency of privacy-preserving data sharing among multiple data sharers while reducing the online demand for sink nodes. Although the data-sharing group should remain stable for a long time, we design the group key update scheme. We also discuss how old and new data sharers access different ranges of privacy-preserving sensing data as the data-sharing group changes. We build a complete implementation of GSChain based on the Hyperledger Fabric framework and conduct a comprehensive set of experimental studies. Our experimental results demonstrate that GSChain improves the privacy-preserving sensing data sharing efficiency with tolerable time and storage overhead. In addition, the time overhead caused by the recovery of the GSChain system is tolerable when the membership of the data-sharing group changes.