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

IEEE/ACIS International Conference on Computer and Information Science (ICIS)

Identity-Based Conference Key Distribution Scheme Using Sealed Lock

Yongquan Cai, Xiuying Li

Published May 1, 2008• 1 citation
Publisher

Abstract

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.

DOI
10.1109/icis.2008.22

Related papers

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 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

Privacy-preserved conference key distribution protocol

Chien-Lung Hsu, Tzu‐Wei Lin, Huang-Chia Lu +2 more

With the progress of information technology, the computer crimes are emerging in an endless stream. User's privacy should be protected. When a user submits a service request to a service provider, both should check the identity of each other and build a shared key to accomplish the service request. Furthermore, when a conference is held, the chairman must verify the identities of all participants. Afterwards, the chairman chooses a conference key and distributes it to legitimate participants. Besides, the participants should know who is in the conference. These manners prevent the malicious adversary from eavesdropping or impersonating to get some benefits. From mentioned above, we adopt identity-based cryptosystem and elliptic curve cryptosystem to propose a privacy-preserved conference key distribution protocol.

International Conference on Digital Information Management•Sep 1, 2017•1 citation

An efficient and robust conference key distribution protocol

Yuanbo Guo, Jianfeng Ma

A computationally secure and robust conference key distribution scheme is presented, which requires only the authenticated and encrypted point-to-point channels between each server and each user. By using it, every honest user of a conference can get a common key after running of the protocol, even if some minority of the servers malfunction or misbehave. Analysis shows that a passive adversary gets zero knowledge about the conference key, and the active adversary cannot impersonate successfully. Because this scheme is noninteractive, both operation and communication overhead are reduced, this make it very efficient.

International Conference on Computer Networks and Mobile Computing•Mar 1, 2004•3 citations

An intrusion-tolerant conference key distribution scheme

Yuanbo Guo, Jianfeng Ma

This paper proposes a computationally secure and fault-tolerant conference key distribution scheme, which only requires the authenticated and encrypted point-to-point channels between each server and each user. By the combined use of knowledge proof and verifiable secret sharing, the scheme has the properties of simple structure and high security. Analysis shows that every honest user of a conference can get a common key after the running of the protocol, even if a minority of the servers malfunction or misbehave. We also show that on the assumption of a Diffie-Hellman decisional problem, a passive adversary gets zero knowledge about the conference key, and the active adversary cannot impersonate someone successfully. Because the knowledge proof method we adopt is non-interactive, both operation and communication overheads are reduced, thus making the schemes very efficient.

Journal of Xidian University•Jan 1, 2004•0 citations
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.
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.
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.
With the progress of information technology, the computer crimes are emerging in an endless stream. User's privacy should be protected. When a user submits a service request to a service provider, both should check the identity of each other and build a shared key to accomplish the service request. Furthermore, when a conference is held, the chairman must verify the identities of all participants. Afterwards, the chairman chooses a conference key and distributes it to legitimate participants. Besides, the participants should know who is in the conference. These manners prevent the malicious adversary from eavesdropping or impersonating to get some benefits. From mentioned above, we adopt identity-based cryptosystem and elliptic curve cryptosystem to propose a privacy-preserved conference key distribution protocol.
A computationally secure and robust conference key distribution scheme is presented, which requires only the authenticated and encrypted point-to-point channels between each server and each user. By using it, every honest user of a conference can get a common key after running of the protocol, even if some minority of the servers malfunction or misbehave. Analysis shows that a passive adversary gets zero knowledge about the conference key, and the active adversary cannot impersonate successfully. Because this scheme is noninteractive, both operation and communication overhead are reduced, this make it very efficient.
This paper proposes a computationally secure and fault-tolerant conference key distribution scheme, which only requires the authenticated and encrypted point-to-point channels between each server and each user. By the combined use of knowledge proof and verifiable secret sharing, the scheme has the properties of simple structure and high security. Analysis shows that every honest user of a conference can get a common key after the running of the protocol, even if a minority of the servers malfunction or misbehave. We also show that on the assumption of a Diffie-Hellman decisional problem, a passive adversary gets zero knowledge about the conference key, and the active adversary cannot impersonate someone successfully. Because the knowledge proof method we adopt is non-interactive, both operation and communication overheads are reduced, thus making the schemes very efficient.