| Summary: | 碩士 === 國立臺灣大學 === 電機工程學研究所 === 89 === Multicasting is now considered a new attracting and challenging paradigm in the area of communication. Such applications include pay-per-view systems, video conferencing, on-line games and so on. A secure multicasting environment is therefore essential, so that the messages delivered via multicasting should only be available to authorized recipients.
To achieve secure multicasting, all authorized users share a group key. The messages should be encrypted by this group key before they are multicasted. For the sake of security, we need a new group key when someone joins/leaves this group.
In this thesis, we propose a new framework for key management to construct a secure multicasting environment. When rekeying, only one rekey message will be generated, and the message size is a constant. Especially when the group size is large, our framework largely reduces the traffic in the network. Two solutions are proposed to carry out this framework. They are closed curve solution (CCS) and perpendicular space solution (PSS), respectively. One is based on geometric approach and the other on linear algebraic approach. Our framework is also compatible to other group communication protocols. Above all, our framework can avoid the collusion attack.
|
|---|
