植基於群體廣播橢圓曲線系統

Abstract

With the growth of Internet technology and its popularization, numerous users can share a single package in the multicasting system, making networking more efficient and also reduces the bandwidth. The system is, however, constructed by different groups, making secret sharing complex. Therefore, the construction of a secure multicasting system through the use of information security protocol is an important topic of discussion. All members under the same multicasting system share a group key. Therefore, all broadcasted messages can be enciphered and deciphered using this key. Consequently, only legitimate members have access to the messages. However, if any member were to join or leave the group, the group key must be changed to ensure environment security. Thus, the security of the multicasting system is absolutely dependent on the security of the group key. It is also the biggest problem in the construction of a secure multicasting system. Kuen-Pin Wu proposed the use of the secure filter method to solve the security problems of the system, but it was still lacking. We shall, however, use the elliptic curve to construct a new framework to solve this problem and then compared it with the secure filter.