Asymmetric Group Key Agreement Research Articles

Dynamic Authenticated Asymmetric Group Key Agreement With Sender Non-Repudiation and Privacy for Group-Oriented Applications

Group-oriented applications generally support communications for multiple entities (e.g., users and/or devices) through open networks. Typical requirements of group communications include secrecy, authentication, sender non-repudiation, and sender privacy. However, conventional approaches such as group key agreement and broadcast encryption are generally not designed to achieve all these requirements simultaneously or efficiently. In this article, we propose a one-round dynamic authenticated asymmetric group key agreement with sender non-repudiation and privacy (DAAGKAwSNP) protocol. A key building block of our DAAGKAwSNP protocol is our proposed batch multi-signature scheme with strong unforgeability. We prove that the DAAGKAwSNP protocol achieves secrecy under chosen ciphertext attacks – CCA, assuming the intractability of the computational Diffie-Hellman and k-Bilinear Diffie-Hellman exponent problem. We also evaluate DAAGKAwSNP’s performance to demonstrate its utility.

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.

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.

Pairing free asymmetric group key agreement protocol

More and more applications are nowadays distributed and rely on collaborative input. Group key protocols, enabling the construction of a common shared key, are the most evident primitive to efficiently provide the required authentication and confidentiality in the group. Asymmetric group key agreement (AGKA) protocols allow the construction of a common shared public key, where only the participants in the group possessing different private keys are able to decrypt messages encrypted by means of this group public key. Up to now, all the proposed AGKA protocols in literature rely on compute intensive pairing operations, which are too highly demanding for resource constrained devices. We propose in this paper a one-round lightweight elliptic curve based alternative, being able to offer in addition also self-certification to the members of the group due to the usage of Elliptic Curve Qu Vanstone certificates. We show drastic improvements with respect to both communication and computation costs, compared to the pairing based approaches.

Pairing Free Certified Common Asymmetric Group Key Agreement Protocol for Data Sharing Among Users with Different Access Rights.

Research into a pandemic like Covid-19 needs a tremendous input of patient histories and characteristics. Patients and doctors are only willing to share these sensitive data when they are ensured that the data are solely used by legitimate research laboratories. Asymmetric group key agreement (AGKA) protocols provide a good cryptographic primitive to address this requirement. The AGKA protocols proposed in literature provide users with a common public group key and a different decryption key by relying on compute intensive pairing operations. In this paper, we propose a new primitive, called the Common AGKA (CAGKA) protocol in which the users share the same private-public key pair, resulting in a more efficient solution. By combining Elliptic Curve Qu Vanstone certificates and a recently proposed Canetti–Krawczyk (CK) secure mutual authentication protocol, a one round self-certified pairing free CAGKA protocol is defined, which can be also globally certified after one additional round.

An Identity-Based Cross-Domain Authenticated Asymmetric Group Key Agreement

Cross-domain authenticated asymmetric group key agreement allows group members in different domains to establish a secure group communication channel and the senders can be anyone. However, the existing schemes do not meet the requirement of batch verification in the group key negotiation phase, which makes the schemes have low efficiency. To address this problem, an identity-based cross-domain authenticated asymmetric group key agreement is proposed that supports batch verification. The performance analysis shows that this protocol is highly efficient. Finally, the proposed protocol is proved to be secure under the k-Bilinear Diffie–Hellman Exponent assumption.

An asymmetric group key agreement protocol based on attribute threshold for Internet of Things

AbstractWith the development of wireless mobile network and Internet of Things (IoT), users enter the network with a large amount of data and information, including some important personal information, such as ID number, telephone number. Personal privacy disclosure has become one of the focuses of attention. In this article, we propose an asymmetric group key agreement (GKA) protocol based on attribute threshold for IoT to protect user privacy. Users do not need to expose any personal information in the group, but only need to meet the same number of attributes and conduct bidirectional authentication registration with key generation center (KGC) to ensure the legitimacy of mobile terminal members participating in GKA. In the registration phase, user performs heavy preliminary calculations according to the designed protocol, thereby reducing the computation in the key agreement phase and decreasing the complexity of the protocol. The protocol can realize self‐verification, and any member participating in key agreement can verify the correctness of the negotiated key by themselves. Under the assumption of bilinear computational Diffie‐Hellman problem, the security of the protocol is proved. Performance analysis further shows that our protocol has lower energy consumption in terms of communication and computing.

Blockchain-based asymmetric group key agreement protocol for internet of vehicles

Data sharing and group communication are the main applications for Internet of Vehicles (IoV). IoV has some obvious characteristics, such as terminals resources are limited, sensitive information is easy to leak and the whole network is vulnerable to some attacks. Therefore, in the process of terminal communication for IoV, it is urgent to construct an efficient group key to encrypt the communication contents to protect the security of communication contents and user’s privacy. In this work, we propose a blockchain-based asymmetric group key agreement protocol for IoV (B-AGKA), in which blockchain anonymous authentication technology is adopted to achieve user’s privacy protection. And in this scheme, the calculation is distributed to each node in a balanced manner, reducing the calculation and communication overhead; for traceability and accountability, the blockchain logging techniques are adopted. In the whole process, we show that the proposed protocol is proven secure under the hardness assumption of decision bilinear Diffie–Hellman (DBDH) problem. The performance analysis shows that the proposed scheme is more efficient than existing works.

Dynamic asymmetric group key agreement protocol with traitor traceability

In asymmetric group key agreement (ASGKA) protocols, a group of users establish a common encryption key which is publicly accessible and compute pairwise different decryption keys. It is left as an open problem to design an ASGKA protocol with traitor traceability in Eurocrypt 2009. A one-round dynamic authenticated ASGKA protocol with public traitor traceability is proposed in this study. It provides a black-box tracing algorithm. Ind-CPA security with key compromise impersonation resilience (KCIR) and forward secrecy of ASGKA protocols is formally defined. The proposed protocol is proved to be Ind-CPA secure with KCIR and forward secrecy under D k-HDHE assumption. It is also proved that the proposed protocol resists collusion attack. In Setup algorithm and Join algorithm, one communication round is required. In Leave algorithm, no message is required to be transmitted. The proposed protocol adopts O ( log ⁡ N ) -way asymmetric multilinear map to make the size of public key and the size of ciphertext both achieve O ( log ⁡ N ) , where N is the number of potential group members. This is the first ASGKA protocol with public traitor traceability which is more efficient than trivial construction of ASGKA protocols.

A Self‐certified Cross‐Cluster Asymmetric Group Key Agreement for Wireless Sensor Networks

Wireless sensor networks have some obvious characteristics, such as communication range is limited, computing power is limited and energy is limited. Group key agreement in this environment requires a cross-cluster, computation and communication overhead are lightweight and highly safe group key agreement protocol. Aiming at these demands, the paper proposes a Self-certified cross-cluster Asymmetric group key agreement (SC-AGKA). To establish a lightweight and efficient group communication channel among sensor nodes. According to the cluster head as the bridge node to realize the sensor nodes in different cluster have the same group key information, and negotiate a pair of asymmetric group keys to realize the cross cluster secure communication. The group communication adopts asymmetric encryption mechanism. It realizes the group security communication mechanism of message sender unconstraint. The asymmetric group key agreement has the key self-certified, which does not need additional rounds to verify the correctness of group key. Proven and analysis show that the proposed protocol has the advantages of in security and energy consumption.

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Asymmetric group key agreement protocol is to negotiate a shared group encryption key. Each member can calculate a decryption key corresponding to the encryption key. With the rapid development of network and system technology, secure information exchange has been one of the foci. In this paper, we propose an authenticated hierarchical asymmetric group key agreement protocol based on identity. Based on the realisation of a round of asymmetric group key agreement, the protocol carries out a second round of agreement. Different levels of secrets exchange information between a group of players with different permissions as the number of rounds increases, which can achieve anonymity and authentication and support dynamic group key updating of nodes to achieve forward and backward security of group key. The protocol proved to be secure under the assumption of bilinear computational Diffie-Hellman problem. The performance analysis shows that the proposed scheme is efficient.

Multi‐domain Lightweight Asymmetric Group Key Agreement

Multi‐domain Lightweight Asymmetric Group Key Agreement

An authenticated asymmetric group key agreement based on attribute encryption

Secure communication among terminals in a group is necessary in Internet of Things (IoT). Such as, the Vehicular Ad-hoc Network (VANET) is used to communicate with the vehicles to give alert for weather conditions, road defects, traffic conditions, etc. However, people are also worried about two major security issues: privacy and authentication. Under an open and untrusted network, common secret keys which are negotiated by group terminals through group key agreement are used to realize encryption communication among group members. Personal identity information is exposed and privacy cannot be protected under the traditional identity-based authenticated asymmetric group key agreement protocol. Therefore, an authenticated asymmetric group key agreement based on attribute encryption (ABE-AAGKA) is proposed, which combines the advantages of attribute encryption and identity authentication. Attribute encryption and authentication techniques are adopted to guarantee the secure of group key agreement, and protect the personal privacy. Moreover, calculate and communicate loads are able to be moved to powerful server through the protocol to reduce the workload on intelligent terminal under the imbalanced mobile networks. The proposed protocol is proven to be secure under the inverse computational Diffie-Hellman (ICDH) problem assumption. Performance analysis shows that the proposed scheme is more efficient than existing works.

A Specific‐Targeting Asymmetric Group Key Agreement for Cloud Computing

When the information is exchanged and transmitted among the group members in mobile cloud environment, the group members may distribute different security domains. The information exchanged among group members may have different secret levels in this environment. When a person has some secret information, he only wants to share these information with some people who have the appropriate level of security permissions, other than all the members in the group. Aiming at these needs, we propose a flexible Asymmetric group key agreement (AGKA) protocol that information exchange and transmission are specific-targeting. The paper adopts bilinear mapping and two-way anonymous authentication technology to hide personal identity authentication information, and uses storage and computing migration technology to reduce the resource consumption of mobile terminal, and also proposes the secret key factor oriented extraction and combinations technology to achieve multi-level three-dimensional complex space security information exchange requirements and meet the lightweight computing. The analysis proves that the protocol has good safety performance and low resource consumption.

Cross-cluster asymmetric group key agreement for wireless sensor networks

Cross-cluster asymmetric group key agreement for wireless sensor networks

Secure and efficient encrypted keyword search for multi-user setting in cloud computing

A key challenge to design searchable encryption in multi-user setting lies in the efficient management of encryption and search keys. Existing multi-user searchable encryption schemes either extend the single-user searchable encryption framework with broadcast encryption or require search user refers to the data owner and get the search token. However, this implies the necessity that the data owner distributes a single shared secret key among the group of users or requires the data owner stay online to authorize other users to search. In this paper, we address this practical problem, which is neglected in the literature. We also study secret-key-recovery attack where a malicious user can deduce a valid secret when given a search token. We show such attack violates secret key privacy, which is important in the whole system. Inspired by asymmetric group key agreement and multilinear map technology, we provide a secure and efficient encrypted keyword search scheme for multi-user setting, in which a data owner can share data with a group users without knowing which user in the group. In the proposed scheme, (a) each user has his own secret key, (b) each user generates trapdoors without getting any help from data owner or the third party, (c) our scheme features constant communication overhead, and (d) our scheme resist the secret-key-recovery attack. Our scheme preserves the traceability inherited from the asymmetric group key agreement system. We offer rigorous security proof of our scheme, and the performance analysis demonstrates the efficiency of our scheme.

A Dynamic and Cross-Domain Authentication Asymmetric Group Key Agreement in Telemedicine Application

Telemedicine offers medical services remotely via telecommunications systems and physiological monitoring devices. Group-oriented communication is an important application for telemedicine. However, transmission of information over an insecure channel such as Internet or private data storing generates a security problem. Therefore, authentication, confidentiality, and privacy are important challenges in telemedicine. Therefore, developing suitable encryption communication protocol for group communication is quite important for modern medicine. Group key agreement is one way to ensure the security of group-oriented communication for telemedicine. In this paper, we propose a dynamic and cross-domain authenticated asymmetric group key agreement. The protocol adopts cross-domain authentication mechanism to avoid the security risks of key escrow and the complexity of certificate management. It supports the dynamic group key update of nodes for forward secrecy and backward security of group key, and also achieving the key self-certified, the member participated group key agreement can self-certify whether the calculated group keys are correct. The protocol is proven secure under the inverse computational Diffie-Hellman problem assumption, and the performance analysis shows that the proposed scheme is highly efficient. The proposed scheme is more suitable for security group communication in telemedicine.

A Strongly Secure and Efficient Certificateless Authenticated Asymmetric Group Key Agreement Protocol

A Strongly Secure and Efficient Certificateless Authenticated Asymmetric Group Key Agreement Protocol

OTIBAAGKA: A New Security Tool for Cryptographic Mix-Zone Establishment in Vehicular Ad Hoc Networks

Location privacy is one of the major challenges in vehicular ad hoc networks. Due to the open and broadcast nature of wireless communication, the safety messages of vehicles can be easily collected by malicious eavesdroppers to continuously track vehicles. Cryptographic mix-zone (CMIX) is a promising tool to enhance vehicle privacy, in which the safety messages of vehicles are encrypted using a group secret key. In that way, any outsider cannot monitor the safety messages broadcasted by the vehicles in the CMIX. Existing CMIX protocols need fully trusted dealers to distribute group secret keys and/or suffer from the problem of efficient key update. This paper proposes a novel method based on a new security tool referred to as one-time identity-based authenticated asymmetric group key agreement to create CMIXes which withstand malicious eavesdroppers. Different from the existing solutions, our proposal does not rely on the existence of fully trusted dealers and deals with efficient key update in CMIX for the first time. In our protocol, any vehicle in a CMIX could be a group secret key distributer. Furthermore, once the group secret key of the CMIX has to be updated, a vehicle in the CMIX just needs to broadcast a short ciphertext, then all the vehicles in the CMIX may refresh the group secret key to the new one efficiently.