Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Access

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

Zhang Qikun, Yong Gan, Zhang Quanxin, Wang Ruifang, Tan Yu-An

Published Jan 1, 2018• 68 citations
Publisher

Abstract

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.

DOI
10.1109/access.2018.2799007

Related papers

An authenticated hierarchical asymmetric group key agreement protocol based on identity

Qikun Zhang, Zengyu Cai, Yong Gan +2 more

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.

International Journal of Embedded Systems•Jan 1, 2019•1 citation

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

Lei Zhang, Qianhong Wu, Josep Domingo‐Ferrer +2 more

Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k -bilinear Diffie-Hellman exponent assumption.

IEEE Transactions on Information Forensics and Security•Jun 19, 2015•69 citations

A Dynamic ID-based Authenticated Group Key Agreement Protocol

Jun Zheng, Cheng Yang, Jinrong Xue +1 more

Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.

National Conference on Electrical, Electronics and Computer Engineering (NCEECE)•Jan 1, 2016•12 citations

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

Rui Zhang, Lei Zhang, Kim‐Kwang Raymond Choo +1 more

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.

IEEE Transactions on Dependable and Secure Computing•Dec 28, 2021•39 citations

Post-Quantum Attribute-Based Authenticated Key Agreement Protocol for Smart Healthcare

Liang Ni, Bingke Gu, Xiaoyan Liu +1 more

With the digitization and networking of medical and health data, intelligent medical devices are widely used to monitor patient health status and provide personalized medical services. However, these devices involve a large amount of personal health data and must ensure data security. The data security and privacy protection in the new complex network environment has become one of the important challenges in the field of healthcare. This study aims to propose a post quantum attribute based authentication key agreement protocol applicable to intelligent healthcare, to address the security risks and risks of medical data communication under traditional cryptographic systems. This new protocol is based on attribute authentication encryption technology without certificates on the grid, which completes mutual authentication and establishes secure communication through attribute and access control policies, and can optimize the deployment of certificate system components in public key infrastructure. Meanwhile, this scheme belongs to the post quantum cryptography protocol and has the ability to resist quantum computing attacks. Based on comprehensive analysis, this scheme can achieve certain advantages in execution efficiency and security, and can provide a more reliable choice for secure communication in the field of intelligent healthcare.

International Conference on Big Data Engineering (BDE)•Jul 24, 2024•0 citations

Asymmetric Group Key Agreement Protocol from Short Signatures

Kunyu Shen, Lei Zhang, Rui Zhang +1 more

Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.

IEEE International Conference on Computer and Communications (ICCC)•Dec 9, 2022•3 citations
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.
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.
Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k -bilinear Diffie-Hellman exponent assumption.
Through the group key agreement, all group members could negotiate a common session key which is used in later secure communication.While simple GKA cannot provide enough security to resist the adversary's attack, and the malicious damage during the agreement makes the authenticated key agreement particularly important.In identity-based authentication, user's unique identity information is used as the public key, which makes it exempt from a series of management of the certification in public-key infrastructure.Thereby, the identity-based key agreement can simplify the key management procedures and reduce the risk of failure at the certification authority.Recently, several identity-based group key agreement protocols have been proposed, however most of them are either vulnerable to impersonation and replay attack or inefficient and unscalable.This paper proposes a novel authenticated group key agreement protocol which is based on bilinear pairings.It needs two rounds to negotiate the session key, and the low computational complexity makes the protocol efficient and scalable.Meanwhile, our protocol also ensures the forward and backward secrecy and the key independence.Under the Decisional Diffie-Hellman assumption, our protocol is proved to be secure against the adversary. 1.
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.
With the digitization and networking of medical and health data, intelligent medical devices are widely used to monitor patient health status and provide personalized medical services. However, these devices involve a large amount of personal health data and must ensure data security. The data security and privacy protection in the new complex network environment has become one of the important challenges in the field of healthcare. This study aims to propose a post quantum attribute based authentication key agreement protocol applicable to intelligent healthcare, to address the security risks and risks of medical data communication under traditional cryptographic systems. This new protocol is based on attribute authentication encryption technology without certificates on the grid, which completes mutual authentication and establishes secure communication through attribute and access control policies, and can optimize the deployment of certificate system components in public key infrastructure. Meanwhile, this scheme belongs to the post quantum cryptography protocol and has the ability to resist quantum computing attacks. Based on comprehensive analysis, this scheme can achieve certain advantages in execution efficiency and security, and can provide a more reliable choice for secure communication in the field of intelligent healthcare.
Asymmetric group key agreement allows a group of users to negotiate a public encryption key that corresponds to several decryption keys, and each decryption key can only be computed by one group member. This novel notion ensures the confidentiality of communication among group members and allows any external entity to send messages to the group. However, the existing authenticated asymmetric group key agreement protocols are designed in identity-based cryptosystem or certificateless public key cryptosystem, which are not widely deployed. In this paper, we propose an efficient authenticated asymmetric group key agreement protocol. The protocol captures the security of secrecy, known-key security, key-compromise impersonation, unknown key-share and key control while being resistant to active attacks. The security of our protocol is reduced to the k-BDHE problem.