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

Information security and cryptography

Conference Key Protocols

Colin Boyd, Anish Mathuria

Published Jan 1, 2003• 0 citations
Publisher
DOI
10.1007/978-3-662-09527-0_6

Related papers

On Classifying Conference Key Distribution Protocols

Shahrokh Saeednia, Reihaneh Safavi–Naini, Willy Susilo

Lecture notes in computer science•Jan 1, 2001•1 citation

Conference Key Agreement Protocol using Oblivious Transfer

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

IFIP International Federation for Information Processing/IFIP•Jan 1, 2002•0 citations

Conference key agreement protocol using oblivious transfer

Ari Moesriami Barmawi, Shingo Takada, Norihisa Doi

•Jan 1, 2001•0 citations

Efficient identity-based conference key distribution protocols

Shahrokh Saeednia, Reihaneh Safavi–Naini

Lecture notes in computer science•Jan 1, 1998•18 citations

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

Key Agreement Protocols

Colin Boyd, Anish Mathuria, Douglas Stebila

Information security and cryptography•Nov 6, 2019•1 citation
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.