| Summary: | 碩士 === 南華大學 === 資訊管理學系 === 100 === Network conference is one of the most popular services on the Internet. In 2005, Ryu et al. proposed a conference key distribution protocol. They claimed their scheme is efficient and secure. However, we found that their protocol has a secure loophole: without applying any private information, the conference key can be recovered only using both the broadcast message of the protocol and the public keys of the participants. In this paper, we employ the Chinese Remainder Theorem to design a novel conference key distribution scheme, which can effectively solve the security problem raised in Ryu et al.’s work. In addition, there are three outcomes of this research. First, it is impossible that an unregistered user could attend an approved conference. Second, without the agreement of all participants in a meeting, no one could obtain the conference key and the content of the conference. Third, the conference server cannot know who participates in a particular conference and cannot compute any conference key. In the future, we hope to improve our scheme which can more efficiently accommodate more users in a meeting at the same time.
|
|---|
