A conference key agreement protocol with fault-tolerant capability

作者：Huang Kuo Hsuan^*; Chung Yu Fang; Lee Hsiu Hui; Lai Feipei; Chen Tzer Shyong

来源：Computer Standards & Interfaces, 2009, 31(2): 401-405.

DOI：10.1016/j.csi.2008.05.015

• Conference key
• Key agreement
• Fault tolerance
• Discrete logarithm problem

Secure communication is of utmost importance to participants of Internet conferences. Secure communication thwarts eavesdropping. In an Internet conference, all conference participants together establish a common conference key to enable multi-party and secure exchange of messages. However, malicious conference participants may try to obtain the conference key through unfair means, and this could result in the generation of different conference keys. This paper is intended as a proposal of a new form of conference key agreement protocol. It emphasizes the filtering of malicious participants at the beginning of the conference to ensure that all participants obtain the same conference key. The proposed method also has fault-tolerant capability. Efficiency and security of a protocol is important in practice. The security of the proposed protocol is based on discrete logarithm problem assumption. The protocol is executed in computationally secure environment. The secret information of a user cannot be determined from its corresponding public information and therefore ensures privacy. Since efficiency of a protocol depends on low computation cost, the protocol attempts to achieve lower computation cost without compromising on security.

• 出版日期2009-2