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

Key words: Conference key agreement; Identity-based; Tate pairing

摘要： 利用Cha 和Cheon 提出的基于身份的数字签名方案，提出了一种新的会议密钥协商算法，并分析了该算法的正确性、安全性和执行效率。分析结果表明，在Gap Diffie-Hellman 假设下，任何窃听者均无法得到有关会议密钥的任何信息，且无论存在多少恶意参与者，诚实参与者都能够协商出共同的会议密钥。该方案效率较高，有较强的灵活性、适应性和实用性。

关键词: 会议密钥协商；基于身份；Tate 配对