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

Identity-based with fault-tolerant conference key distribution

Xiuying Li

Published Jan 1, 2009• 0 citations
OpenAlex

Abstract

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.

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

Improved fault-tolerant conference key distribution scheme

Fangping Gao

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.

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

An efficient fault-tolerant conference-key agreement protocol

Shi Ting-jun, Jianfeng Ma

Byzantine fault model will be increasingly important in the future because malicious attacks and component failures are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. This paper describes an efficient fault-tolerant conference-key agreement schme based on this model under the authenticated channel model. For distributing conference keys, the scheme based on commit-challenge-response framework requires only 2t+1 active servers. So it is efficient and optimal. It is shown that the passive or active adversaries neither gain information about the conference keys established by the honest participants nor disrupt conference keys establishment.

Journal of Yangzhou University•Jan 1, 2004•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 Agreement Algorithm

Yali Wang

Most of conference key agreement algorithms operate only when all participants are honest,but do not work when some participants are malicious and attempt to delay or destruct the conference.This paper presents a new conference key agreement algorithm based on the identity-based signature scheme given by Cha and Cheon.Under the Gap Diffie-Hellman assumption,honest participants can agree on a common conference key no matter how many participants are malicious,and passive adversaries get no information about the conference key established by honest participants.Furthermore,the algorithm is efficient,and has flexible structure and high adaptability.

Jisuanji gongcheng•Jan 1, 2006•0 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
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.
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.
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.
Byzantine fault model will be increasingly important in the future because malicious attacks and component failures are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. This paper describes an efficient fault-tolerant conference-key agreement schme based on this model under the authenticated channel model. For distributing conference keys, the scheme based on commit-challenge-response framework requires only 2t+1 active servers. So it is efficient and optimal. It is shown that the passive or active adversaries neither gain information about the conference keys established by the honest participants nor disrupt conference keys establishment.
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.
Most of conference key agreement algorithms operate only when all participants are honest,but do not work when some participants are malicious and attempt to delay or destruct the conference.This paper presents a new conference key agreement algorithm based on the identity-based signature scheme given by Cha and Cheon.Under the Gap Diffie-Hellman assumption,honest participants can agree on a common conference key no matter how many participants are malicious,and passive adversaries get no information about the conference key established by honest participants.Furthermore,the algorithm is efficient,and has flexible structure and high adaptability.
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.