The Study of Multicast Based on One Way Function Tree
碩士 === 淡江大學 === 資訊工程學系碩士班 === 93 === Multicast is an efficient technique to communicate with specific members. Sherman and McGrew proposed a new scalable algorithm called one way function tree for establishing session key in large and dynamic group. The number of messages broadcasted after a member...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20883173059379796820 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士班 === 93 === Multicast is an efficient technique to communicate with specific members. Sherman and McGrew proposed a new scalable algorithm called one way function tree for establishing session key in large and dynamic group. The number of messages broadcasted after a member is added or evicted is about proportional to the logarithm of group size. However, the scheme is vulnerable to the collusion attack. We will analysis the possible collusion attack on the scheme proposed by Sherman and McGrew and improve the weakness to provide a more secure scheme in this paper.
|
|---|