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

An Efficient Group Key Agreement Protocol for Online Social Network

Sowmya.R, R.Gowri, D. Hemavathy

Published Apr 30, 2016• 0 citations
Publisher

Abstract

The objective of this project is to study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocols, which demonstrate that our constructions are rounding efficient. Finally, we construct an actively secure protocol from a passively secure one.

DOI
10.5281/zenodo.21576445

Related papers

Group Key Agreement with Local Connectivity

Shaoquan Jiang

In this paper, we study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocol, which demonstrates that our constructions are round efficient. Finally, we construct an actively secure protocol from a passively secure one.

IEEE Transactions on Dependable and Secure Computing•Feb 3, 2015•11 citations

An Efficient Group Key Agreement Protocol from Bilinear Pairings

Chengyu Hu, Pengtao Liu, Daxing Li

A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.

International Conference on Computational Intelligence and Security Workshops (CISW)•Dec 1, 2007•1 citation

An Efficient Group Key Agreement Protocol from Bilinear Pairings

Chengyu Hu, Pengtao Liu, LI Daxing

A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.

Computational Intelligence and Security•Dec 15, 2007•2 citations

Enhancement of an Authenticated 3-round Identity-Based Group Key Agreement Protocol

Wei Yuan, Liang Qing Hu, Hongtu Li +2 more

In 2008, Gang Yao et al. proposed an authenticated 3-round identity-based group key agreement protocol, which is based on Burmester and Desmedt’s protocol proposed at Eurocrypt 94. However, their protocol can only prevent passive attack. If the active attack is allowed, the protocol is vulnerable and an internal attacker can forge her neighbor’s keying material. It is obvious that the protocol do not achieve the aim of authentication. In this paper, we discuss the flaws to attack this protocol and propose an enhanced provably-secure protocol based on their protocol. At last, we make a detailed security analysis of our enhanced authenticated identity-based group key agreement protocol.

Journal of Networks•Oct 19, 2011•0 citations

Constructing group key agreement protocols using mKEMs

Konstantina Papadopoulou

Over the last few years, researchers have introduced many group key agreement protocols, aiming to construct new efficient schemes in terms of both computation and communication. Group key agreement protocols aim to derive a common session key among a group of users, which will be used later in order to achieve secure communication between them. In this thesis, we provide a complete analysis of the protocols that have already been introduced in the literature from 2010 until now and require only one round. The main goal of this analysis is to evaluate these protocols in both communication and computation cost, in order to provide a comprehensive comparative analysis. The second part of the thesis is to analyze and evaluate the multi key encapsulation mechanisms that exist in the literature. A multi key encapsulation mechanism is the encryption technique by which a symmetric cryptographic algorithm is combined with an asymmetric one. To be more specific, such a mechanism uses an asymmetric cryptographic algorithm, as a method to encrypt the session key, while the key is derived by a symmetric cryptographic algorithm. Finally, we propose two new group key agreement protocols which use the multi key encapsulation mechanisms, and compare them with existing group key agreement protocols. These constructions are based on a generic methodology for creating a group key exchange protocol by using multi key encapsulation mechanisms. For this reason, emphasis has been given to both one round group key agreement protocols and multi key encapsulation mechanisms, in order to examine the possibility of combining them

•Feb 26, 2018•0 citations

Group Key Agreement From Signcryption

Xixiang Lv

There is an intuitive connection between signcryption and key agreement.Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols.In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption.This approach introduces desired properties to group key agreement.What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender.Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8].We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.

KSII Transactions on Internet and Information Systems•Jan 1, 2012•2 citations
The objective of this project is to study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocols, which demonstrate that our constructions are rounding efficient. Finally, we construct an actively secure protocol from a passively secure one.
In this paper, we study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocol, which demonstrates that our constructions are round efficient. Finally, we construct an actively secure protocol from a passively secure one.
A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.
A group key agreement protocol is designed to efficiently implement secure multicast channels for a group of parties communicating over an distrustful, open network by allowing them to agree on a common secret key. Recently some constant-round protocols have been proposed. However, some of them are too expensive with computational complexity O(n), others with lower computational complexity doesn't ensure the participants to get the same session key. In this paper we propose a new constant-round protocol suited for groups consisting of many hosts with limited computational capability and a host with more computational power. Then we prove its security.
In 2008, Gang Yao et al. proposed an authenticated 3-round identity-based group key agreement protocol, which is based on Burmester and Desmedt’s protocol proposed at Eurocrypt 94. However, their protocol can only prevent passive attack. If the active attack is allowed, the protocol is vulnerable and an internal attacker can forge her neighbor’s keying material. It is obvious that the protocol do not achieve the aim of authentication. In this paper, we discuss the flaws to attack this protocol and propose an enhanced provably-secure protocol based on their protocol. At last, we make a detailed security analysis of our enhanced authenticated identity-based group key agreement protocol.
Over the last few years, researchers have introduced many group key agreement protocols, aiming to construct new efficient schemes in terms of both computation and communication. Group key agreement protocols aim to derive a common session key among a group of users, which will be used later in order to achieve secure communication between them. In this thesis, we provide a complete analysis of the protocols that have already been introduced in the literature from 2010 until now and require only one round. The main goal of this analysis is to evaluate these protocols in both communication and computation cost, in order to provide a comprehensive comparative analysis. The second part of the thesis is to analyze and evaluate the multi key encapsulation mechanisms that exist in the literature. A multi key encapsulation mechanism is the encryption technique by which a symmetric cryptographic algorithm is combined with an asymmetric one. To be more specific, such a mechanism uses an asymmetric cryptographic algorithm, as a method to encrypt the session key, while the key is derived by a symmetric cryptographic algorithm. Finally, we propose two new group key agreement protocols which use the multi key encapsulation mechanisms, and compare them with existing group key agreement protocols. These constructions are based on a generic methodology for creating a group key exchange protocol by using multi key encapsulation mechanisms. For this reason, emphasis has been given to both one round group key agreement protocols and multi key encapsulation mechanisms, in order to examine the possibility of combining them
There is an intuitive connection between signcryption and key agreement.Such a connector may lead to a novel way to construct authenticated and efficient group key agreement protocols.In this paper, we present a primary approach for constructing an authenticated group key agreement protocol from signcryption.This approach introduces desired properties to group key agreement.What this means is that the signcryption gives assurance to a sender that the key is available only to the recipient, and assurance to the recipient that the key indeed comes from the sender.Following the generic construction, we instantiate a distributed two-round group key agreement protocol based on signcryption scheme given by Dent [8].We also show that this concrete protocol is secure in the outsider unforgeability notion and the outsider confidentiality notion assuming hardness of the Gap Diffie-Hellman problem.