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

International Conference on Information, Communications & Signal Processing (ICICS)

Universally composable asymmetric group key agreement protocol

Yong Chen, Mingxing He, Shengke Zeng, Xiao Li

Published Dec 1, 2015• 1 citation
Publisher

Abstract

We analyze the security of asymmetric group key agreement (ASGKA) protocol in the universal composability (UC) framework. An ideal functionality that is suitable for ASGKA protocol is proposed. And we show that the ASGKA protocol securely realizes the proposed ideal functionality that can resist attacks by malicious insiders. The UC framework allows the protocols to guarantee their security under arbitrary protocol environment.

DOI
10.1109/icics.2015.7459858

Related papers

Universally composable contributory group key exchange

M. Choudary Gorantla, Colin Boyd, Juan Manuel González Nieto

We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by malicious insiders. We define an ideal functionality for GKE that captures contributiveness in addition to other desired security goals. We show that an efficient two-round protocol securely realizes the proposed functionality in the random oracle model. As a result, we obtain the most efficient UC-secure contributory GKE protocol known.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Mar 10, 2009•15 citations

A group-key agreement protocol secure against the malleability attacks

Seiko Arita, Akihiko Sakuma

In group key agreement protocols, it is important to consider the effects of existence of malicious insiders. In this paper, we define a type of key-control attacks and the security against them for group key agreement protocols with malicious insiders. Then, we give a first ideal functionality of group key agreement that takes key-control attacks (as well as key-integrity attacks) into consideration, and construct a group key agreement protocol that securely realizes the ideal functionality. The construction is efficient enough for practical uses, being comprised of 2 rounds and n messages for n-party groups.

International Symposium on Information Theory and its Applications•Dec 1, 2008•3 citations

Design and Analysis of Dynamic Group Key Agreement Protocol with UC Security

Yang Chun-ya

Aiming at the fact that the concurrent group key agreement( GKA) protocol is discussed only within the isolate model,and based on m-ary tree decisional Diffie-Hellman within the framework of universally composable( UC) security,a group key agreement protocol is designed,and the ideal functionality model for GKA protocol formulated. The security modular design and implementation of GKA protocol indicates that this protocol could meet the requirement of UC security. Compared with the similar protocol of GKA,this new protocol has the advantages of less communication and computation overhead,while supports group members in their dynamic joining and exiting.

Communications technology•Jan 1, 2014•0 citations

Universally Composable Secure Group Communication.

Youliang Tian, Changgen Peng

Abstract. This paper analyzes group communication within the universally composable framework. We first propose the group communication model, identity-based signcrytion mod-el and group key distribution model in the UC framework by designing the ideal functionality FSAGCOM, FIDSC and FGKD, respectively. Then, we construct a UC secure identity-based signcryption protocol πIDSC. Moreover, we shows that the identity-based signcryption πIDSC securely realizes the ideal functionality FIDSC if and only if the corresponding protocol ID-SC is secure. Finally, based on the identity-based protocol, we propose a group communica-tion scheme πSAGCOM, which can securely realizes the ideal functionality FSAGCOM in the (FIDSC,FGKD)-hybrid model.

•Jan 1, 2014•2 citations

Universally Composable Group Key Exchange Protocol

Pla Information

In this article,a universally composable group key exchange ideal function is proposed and realized using witness indistinguishable proof of knowledge with partially isolated party based on the tamper-proof hardware token.Compared with protocols under the CRS model,the group key exchange protocol can greatly reduce the risk of putting all trusts in one place.The protocol is proved to be AKE secure and resistant to the attacks of adaptive adversaries and malicious insiders.

JOURNAL OF ELECTRONICS INFORMATION TECHNOLOGY•Jan 1, 2009•2 citations

Universally Composable Three-Party Key Distribution.

Zhou Jin, TingMao Chang, Yajuan Zhang +1 more

In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal functionality that captures the basic security requirements of three-party key distribution is formulated. We show that UC definition of security for three-party key distribution protocol is strictly more stringent than a previous definition of security which is termed AKE-security. Finally, we present a real-life protocol that securely realizes the formulated ideal functionality with respect to non-adaptive adversaries. Keywords—Key distribution, Universally composable, AKEsecurity

•Jan 1, 2006•1 citation
We analyze the security of asymmetric group key agreement (ASGKA) protocol in the universal composability (UC) framework. An ideal functionality that is suitable for ASGKA protocol is proposed. And we show that the ASGKA protocol securely realizes the proposed ideal functionality that can resist attacks by malicious insiders. The UC framework allows the protocols to guarantee their security under arbitrary protocol environment.
We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by malicious insiders. We define an ideal functionality for GKE that captures contributiveness in addition to other desired security goals. We show that an efficient two-round protocol securely realizes the proposed functionality in the random oracle model. As a result, we obtain the most efficient UC-secure contributory GKE protocol known.
In group key agreement protocols, it is important to consider the effects of existence of malicious insiders. In this paper, we define a type of key-control attacks and the security against them for group key agreement protocols with malicious insiders. Then, we give a first ideal functionality of group key agreement that takes key-control attacks (as well as key-integrity attacks) into consideration, and construct a group key agreement protocol that securely realizes the ideal functionality. The construction is efficient enough for practical uses, being comprised of 2 rounds and n messages for n-party groups.
Aiming at the fact that the concurrent group key agreement( GKA) protocol is discussed only within the isolate model,and based on m-ary tree decisional Diffie-Hellman within the framework of universally composable( UC) security,a group key agreement protocol is designed,and the ideal functionality model for GKA protocol formulated. The security modular design and implementation of GKA protocol indicates that this protocol could meet the requirement of UC security. Compared with the similar protocol of GKA,this new protocol has the advantages of less communication and computation overhead,while supports group members in their dynamic joining and exiting.
Abstract. This paper analyzes group communication within the universally composable framework. We first propose the group communication model, identity-based signcrytion mod-el and group key distribution model in the UC framework by designing the ideal functionality FSAGCOM, FIDSC and FGKD, respectively. Then, we construct a UC secure identity-based signcryption protocol πIDSC. Moreover, we shows that the identity-based signcryption πIDSC securely realizes the ideal functionality FIDSC if and only if the corresponding protocol ID-SC is secure. Finally, based on the identity-based protocol, we propose a group communica-tion scheme πSAGCOM, which can securely realizes the ideal functionality FSAGCOM in the (FIDSC,FGKD)-hybrid model.
In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal functionality that captures the basic security requirements of three-party key distribution is formulated. We show that UC definition of security for three-party key distribution protocol is strictly more stringent than a previous definition of security which is termed AKE-security. Finally, we present a real-life protocol that securely realizes the formulated ideal functionality with respect to non-adaptive adversaries. Keywords—Key distribution, Universally composable, AKEsecurity