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

International Conference on Digital Information Management

Privacy-preserved conference key distribution protocol

Chien-Lung Hsu, Tzu‐Wei Lin, Huang-Chia Lu, Tzu-Hsien Chuang, Yu-Han Chen

Published Sep 1, 2017• 1 citation
Publisher

Abstract

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.

DOI
10.1109/icdim.2017.8244668

Related papers

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

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

Privacy-Enhancing Authenticated Key Agreement Protocols Based on Elliptic Curve Cryptosystem

Hong Lei

Authenticated key agreement protocol is designed to provide pair of parties communicating over an insecure network with a secure session key.However,most of the existing authenticated key agreement protocols are not designed for protecting privacy.We emphasize user's privacy properties in network services,in particular we stress anonymity and deniability.We specify the desired security properties of privacy-enhancing authentication key agreement protocols,i.e.mutual authentication,key control,key confirmation,session-key confidentiality,known-key security,forward secrecy,anonymity of user,forward anonymity of user,unlinkability,deniability.Based on elliptic curve cryptosystem we also propose a protocol which satisfies all the desired security properties.

Dianzi xuebao•Jan 1, 2008•4 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

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

Authenticated conference key agreement based on identity

Zecheng Wang

In order to ensure authenticity of the information for conference key negotiation, the information which each party sends should be authenticated. Digital signature and share secret are two methods for authentication. Identity-based public key cryptosystems from the Weil pairing on elliptic curve are introduced. Two authenticated conference key agreement protocols are designed using identitybased signature scheme and identity-based Diffie-Hellman shared key. The protocols are secure and efficient. They can be applied to all kinds of environment in which multi-parties negotiate session keys.

Jisuanji gongcheng yu sheji•Jan 1, 2004•0 citations
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.
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.
Authenticated key agreement protocol is designed to provide pair of parties communicating over an insecure network with a secure session key.However,most of the existing authenticated key agreement protocols are not designed for protecting privacy.We emphasize user's privacy properties in network services,in particular we stress anonymity and deniability.We specify the desired security properties of privacy-enhancing authentication key agreement protocols,i.e.mutual authentication,key control,key confirmation,session-key confidentiality,known-key security,forward secrecy,anonymity of user,forward anonymity of user,unlinkability,deniability.Based on elliptic curve cryptosystem we also propose a protocol which satisfies all the desired security properties.
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.
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.
In order to ensure authenticity of the information for conference key negotiation, the information which each party sends should be authenticated. Digital signature and share secret are two methods for authentication. Identity-based public key cryptosystems from the Weil pairing on elliptic curve are introduced. Two authenticated conference key agreement protocols are designed using identitybased signature scheme and identity-based Diffie-Hellman shared key. The protocols are secure and efficient. They can be applied to all kinds of environment in which multi-parties negotiate session keys.