An efficient fault-tolerant group key agreement protocol

Zhao, Jiewen; Gu, Dawu; Li, Yali

doi:10.1016/j.comcom.2010.01.001

Cited by 25 publications

(32 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From Table I, we can see that the computational cost of IGKA protocol is the same with the protocol of Zhao et al [16], which is more efficient than other previous fault-tolerant group key agreement protocols.…”

Section: Computational Cost Comparisonsupporting

confidence: 49%

“…In this section, we will compare our improved group key agreement (IGKA) protocol with Tzeng's protocol [12], Tseng's protocol [13], protocol of Huang et al [14], and the protocol of Zhao et al [16] in computational cost and communication cost. The reason why we chose these protocols for comparison is that they are fault-tolerant and PKI-based.…”

Section: Efficiency Analysismentioning

confidence: 99%

“…Message size is the maximum number of bits communicated by any single participant. As stated in [16], we use t to denote the size of a single group. Table II shows that IGKA protocol has the same communication cost with the protocol of Zhao et al [16], which has a significant advantage regarding the message complexity.…”

Section: Communication Cost Analysismentioning

confidence: 99%

“…In a fault-tolerant group key agreement protocol, all malicious participants are excluded from the set of participants before session key computation and cannot disrupt the key agreement process. In 2010, Zhao et al [16] proposed a very efficient fault-tolerant group key agreement protocol. In their protocol, malicious participants can be detected in the fault detection phase.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Improvement on the fault‐tolerant group key agreement protocol of Zhao et al.

Wang

2012

Security Comm Networks

View full text Add to dashboard Cite

In 2010, Zhao et al. proposed a fault-tolerant group key agreement protocol based on RSA cryptosystem. In their protocol, malicious participants can be detected in the fault detection phase. Thus, they do not disrupt the key agreement process. However, there exists a drawback in the protocol of Zhao et al. After two rounds of trying, an adversary can impersonate any other group member in the third round. We propose an improved protocol to overcome this drawback. The efficiency and security analysis of our improved protocol are also provided in detail.

show abstract

Section: Computational Cost Comparisonsupporting

confidence: 49%

Section: Efficiency Analysismentioning

confidence: 99%

Section: Communication Cost Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Improvement on the fault‐tolerant group key agreement protocol of Zhao et al.

Wang

2012

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…In 2009, Huang et al [6] proposed an enhanced group key agreement protocol based on Discrete Logarithm Problem (DLP) and they claimed that their protocol is more efficient in terms of computation and communication. In 2010, Zhao et al [7] proposed a group key agreement protocol based on RSA cryptosystem [8] to improve the performance of Huang et al's protocol.…”

mentioning

confidence: 99%

Secure Key Transfer Protocol Based on Secret Sharing for Group Communications

Lee

Wang

Harn

et al. 2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYGroup key establishment is an important mechanism to construct a common session key for group communications. Conventional group key establishment protocols use an on-line trusted key generation center (KGC) to transfer the group key for each participant in each session. However, this approach requires that a trusted server be set up, and it incurs communication overhead costs. In this article, we address some security problems and drawbacks associated with existing group key establishment protocols. Besides, we use the concept of secret sharing scheme to propose a secure key transfer protocol to exclude impersonators from accessing the group communication. Our protocol can resist potential attacks and also reduce the overhead of system implementation. In addition, comparisons of the security analysis and functionality of our proposed protocol with some recent protocols are included in this article. key words: key transfer protocol, group key, Diffie-Hellman key agreement, secret sharing

show abstract

An authenticated group key distribution protocol based on the generalized Chinese remainder theorem

Guo

Chang

2012

Int J Communication

View full text Add to dashboard Cite

The group key distribution protocol is a mechanism for distributing a group key that is used to encrypt the communication data transmitted in an open group. Recently, a novel group key distribution protocol based on secret sharing was proposed. In their protocol, the group key information is broadcast in an open network environment, and only authorized group members can obtain the group key. However, their protocol requires each group member to broadcast a random challenge to the rest of the group members in the construction of the group key, and this may increase communication cost and cause network traffic congestion. In this paper, we propose an authenticated group key distribution protocol based on the generalized Chinese remainder theorem that drastically reduces communication costs while maintaining at least the same degree of security. Our protocol is built on the secret sharing scheme based on Chinese remainder theorem, which requires fewer computation operations than the previous work. 127This paper focuses on how to construct a secure and efficient group key distribution protocol. Although group key distribution [2-6, 12-15] has been deeply researched, it still remains open in cryptography. A secure and efficient group key distribution scheme should allow only authorized members to share a common session key for secure group communication. Some group key distribution protocols [2, 3, 5, 6] have been proposed based on the Diffie-Hellman key agreement protocol.In 2003, Sáze [16] utilized the secret sharing scheme [17] to distribute the group key. A trusted offline server can be used to distribute secret pieces to all authorized group members in the initialization phase. Then, only the authorized members that obtained the secret piece can achieve the secret data in the following group key distribution phase. In 2010, Harn and Lin [12] proposed an efficient authenticated group key transfer protocol based on Shamir's secret sharing scheme [17], in which the group manager transfers the group key among the group members by broadcasting group key information. With Shamir's (t , n) threshold scheme, any authorized group member can obtain the group key, and unauthorized users cannot obtain anything about the group key. Their protocol can withstand outsider attack and insider attack. Furthermore, its security does not rely on unproven assumptions, so its security feature is information theoretically secure. However, Harn and Lin's protocol requires that, when group members want to construct a group key or a member joins or leaves the group, each group member has to broadcast a random challenge as an input of a function used to generate the group key. This requirement may cause network traffic congestion and increase communication cost.The current paper, inspired by Harn and Lin's scheme, proposes a new group key distribution scheme based on the generalized Chinese remainder theorem (GCRT) that drastically reduces computation and communication costs and maintains at least the same security degree. In addition to an...

show abstract

An efficient fault-tolerant group key agreement protocol

Cited by 25 publications

References 31 publications

Improvement on the fault‐tolerant group key agreement protocol of Zhao et al.

Improvement on the fault‐tolerant group key agreement protocol of Zhao et al.

Secure Key Transfer Protocol Based on Secret Sharing for Group Communications

An authenticated group key distribution protocol based on the generalized Chinese remainder theorem

Contact Info

Product

Resources

About