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

Computer Engineering and Applications Journal

Improved fault-tolerant conference key distribution scheme

Fangping Gao

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

Fault-tolerance is an important property of conference key distribution protocol.Recently,Yang et al proposes an identity-based fault-tolerant conference key distribution scheme which is much different from the traditional ones.But their scheme can not withstand passive attack and modification attack.Moreover,it also can not provide forward security.An improved identity-based fault-tolerant conference key distribution scheme is proposed.Compared with the Yang et al's scheme,Tzeng's scheme and Xun's scheme,the new scheme has illustrated the highest security and its communication cost is intervenient of Yang et al's scheme and Tzeng's scheme.As security is the first-line property in conference key establishment protocol,this scheme is the most practical one in the mass.

Related papers

An Improved Identity-based Fault-tolerant Conference Key Distribution Scheme

Yongquan Cai, Xiuying Li

Fault-tolerance is an important property of conference key distribution protocol. Recently, Yang et al. proposed an identity-based fault-tolerant conference key distribution scheme which is much different to the traditional ones. But their scheme can not withstand passive attack and modification attack, moreover, it also can not provide forward security. An improved identity-based fault-tolerant conference key distribution scheme is proposed in this paper. Compared with the Yang et al. 's scheme, Tzeng's (2002) scheme and Xun's scheme, the new scheme has illustrated the highest security and its communication cost is intervenient Yang et al. 's scheme and Tzeng's (2002) scheme. As security is the first-line property in conference key establishment protocol, our scheme is the most practical one in the mass.

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)•Jul 1, 2007•0 citations

Identity-based with fault-tolerant conference key distribution

Xiuying Li

An improved protocol for conference key distribution algorithms is proposed based on the identity-based with faulttolerant conference key distribution which is put foroard by Yang et al,and the correctness and security of the protocol is analyzed.This method makes the honest participants consult a common conference key even in the presence of malicious participants;and be able to effectively resist passive attacks and active attacks.

Computer Engineering and Applications Journal•Jan 1, 2009•0 citations

Identity-based fault-tolerant conference key agreement

Xun Yi

Lots of conference key agreement protocols have been suggested to secure computer network conference. Most of them operate only when all conferees are honest, but do not work when some conferees are malicious and attempt to delay or destruct the conference. Recently, Tzeng proposed a conference key agreement protocol with fault tolerance in terms that a common secret conference key among honest conferees can be established even if malicious conferees exist. In the case where a conferee can broadcast different messages in different subnetworks, Tzeng's protocol is vulnerable to a "different key attack" from malicious conferees. In addition, Tzeng's protocol requires each conferee to broadcast to the rest of the group and receive n - 1 message in a single round (where n stands for the number of conferees). Moreover, it has to handle n simultaneous broadcasts in one round. In this paper, we propose a fault-tolerant conference key agreement protocol, in which each conferee only needs to send one message to a "semitrusted" conference bridge and receive one broadcast message. Our protocol is an identity-based key agreement, built on elliptic curve cryptography. It is resistant to the different key attack from malicious conferees and needs less communication cost than Tzeng's protocol.

IEEE Transactions on Dependable and Secure Computing•Jul 1, 2004•40 citations

Identity-based Conference Key Distribution Scheme Using Sealed Lock

Yang Cheng

In order to hold secure electronic conference in communication networks via insecure channels,a conference key distribution system should be constructed.The conference key distribution system is used for distributing a conference key shared among the participants of the conference and hence secure communications are achieved.By using the sealed lock,this paper proposes an identity-based conference key distribution scheme with user anonymity.It shows that,the scheme withstands passive attack,impersonation attack,and conspiracy attack,and provides forward security of the chairman.These properties make it quite effective and practical.

Jisuanji gongcheng•Jan 1, 2009•0 citations

Identity-Based Conference Key Distribution Scheme Using Sealed Lock

Yongquan Cai, Xiuying Li

In order to hold secure electronic conference in communication networks via insecure channels, a conference key distribution system should be constructed. The conference key distribution system is used for distributing a conference key shared among the participants of the conference and hence secure communications are achieved. In this paper, by using the sealed lock, we propose an identity-based conference key distribution scheme with user anonymity. We also show that, our scheme not only withstands passive attack, impersonation attack, and conspiracy attack, but also provides forward security of the chairman. These properties make it quite effective and practical.

IEEE/ACIS International Conference on Computer and Information Science (ICIS)•May 1, 2008•1 citation

An Improved Conference-Key Agreement Protocol with Forward Secrecy

Yuh‐Min Tseng

Recently, Tzeng proposed a provably secure and fault-tolerant conference-key agreement protocol. It requires only a constant number of rounds to establish a conference key among all honest participants. This article will show that Tzeng’s protocol does not offer forward secrecy. We say that a conference-key agreement protocol offers forward secrecy if the long-term secret key of any participant is compromised and will not result in the compromise of the previously established conference keys. This property is important and has been included in most key agreement protocols and standards. In this paper, an improvement based on Tzeng’s protocol is proposed and it achieves forward secrecy. Under the Diffie–Hellman decision problem assumption and the random oracle model, we show that the proposed protocol can withstand passive attacks and is secure against impersonator’s attacks. The improved protocol requires a constant number of rounds to compute a conference key. The improved protocol provides fault-tolerance.

Informatica•Jan 1, 2005•27 citations
Fault-tolerance is an important property of conference key distribution protocol.Recently,Yang et al proposes an identity-based fault-tolerant conference key distribution scheme which is much different from the traditional ones.But their scheme can not withstand passive attack and modification attack.Moreover,it also can not provide forward security.An improved identity-based fault-tolerant conference key distribution scheme is proposed.Compared with the Yang et al's scheme,Tzeng's scheme and Xun's scheme,the new scheme has illustrated the highest security and its communication cost is intervenient of Yang et al's scheme and Tzeng's scheme.As security is the first-line property in conference key establishment protocol,this scheme is the most practical one in the mass.
Fault-tolerance is an important property of conference key distribution protocol. Recently, Yang et al. proposed an identity-based fault-tolerant conference key distribution scheme which is much different to the traditional ones. But their scheme can not withstand passive attack and modification attack, moreover, it also can not provide forward security. An improved identity-based fault-tolerant conference key distribution scheme is proposed in this paper. Compared with the Yang et al. 's scheme, Tzeng's (2002) scheme and Xun's scheme, the new scheme has illustrated the highest security and its communication cost is intervenient Yang et al. 's scheme and Tzeng's (2002) scheme. As security is the first-line property in conference key establishment protocol, our scheme is the most practical one in the mass.
Lots of conference key agreement protocols have been suggested to secure computer network conference. Most of them operate only when all conferees are honest, but do not work when some conferees are malicious and attempt to delay or destruct the conference. Recently, Tzeng proposed a conference key agreement protocol with fault tolerance in terms that a common secret conference key among honest conferees can be established even if malicious conferees exist. In the case where a conferee can broadcast different messages in different subnetworks, Tzeng's protocol is vulnerable to a "different key attack" from malicious conferees. In addition, Tzeng's protocol requires each conferee to broadcast to the rest of the group and receive n - 1 message in a single round (where n stands for the number of conferees). Moreover, it has to handle n simultaneous broadcasts in one round. In this paper, we propose a fault-tolerant conference key agreement protocol, in which each conferee only needs to send one message to a "semitrusted" conference bridge and receive one broadcast message. Our protocol is an identity-based key agreement, built on elliptic curve cryptography. It is resistant to the different key attack from malicious conferees and needs less communication cost than Tzeng's protocol.
In order to hold secure electronic conference in communication networks via insecure channels,a conference key distribution system should be constructed.The conference key distribution system is used for distributing a conference key shared among the participants of the conference and hence secure communications are achieved.By using the sealed lock,this paper proposes an identity-based conference key distribution scheme with user anonymity.It shows that,the scheme withstands passive attack,impersonation attack,and conspiracy attack,and provides forward security of the chairman.These properties make it quite effective and practical.
In order to hold secure electronic conference in communication networks via insecure channels, a conference key distribution system should be constructed. The conference key distribution system is used for distributing a conference key shared among the participants of the conference and hence secure communications are achieved. In this paper, by using the sealed lock, we propose an identity-based conference key distribution scheme with user anonymity. We also show that, our scheme not only withstands passive attack, impersonation attack, and conspiracy attack, but also provides forward security of the chairman. These properties make it quite effective and practical.
Recently, Tzeng proposed a provably secure and fault-tolerant conference-key agreement protocol. It requires only a constant number of rounds to establish a conference key among all honest participants. This article will show that Tzeng’s protocol does not offer forward secrecy. We say that a conference-key agreement protocol offers forward secrecy if the long-term secret key of any participant is compromised and will not result in the compromise of the previously established conference keys. This property is important and has been included in most key agreement protocols and standards. In this paper, an improvement based on Tzeng’s protocol is proposed and it achieves forward secrecy. Under the Diffie–Hellman decision problem assumption and the random oracle model, we show that the proposed protocol can withstand passive attacks and is secure against impersonator’s attacks. The improved protocol requires a constant number of rounds to compute a conference key. The improved protocol provides fault-tolerance.