English  |  正體中文  |  简体中文  |  Items with full text/Total items : 52047/87178 (60%)
Visitors : 8711266      Online Users : 105
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/35124

    Title: 以單向函數樹為基礎的群體廣播技術之研究
    Other Titles: The study of multicast based on one way function tree
    Authors: 林明甫;Lin, Ming-fuu
    Contributors: 淡江大學資訊工程學系碩士班
    黃仁俊;Hwang, Ren-junn
    Keywords: 群播;單向函數樹;會議金鑰;Mutlicast;One way function tree;Session key
    Date: 2005
    Issue Date: 2010-01-11 06:02:44 (UTC+8)
    Abstract: 在現今科技盛行的時代中,網路越來越為人們所依賴,也提供人們越來越多的功能,如電子郵件、傳送訊息、線上交談、電子郵件、進行影像傳輸、電子新聞等等。而在網路所提供的眾多服務項目中需要仰賴群播技術的服務也日漸增加,如線上會議、網路購物、數位電視等等。群播技術中最為學者們所致力研究的在於更換會議金鑰時的效率問題。過去曾有學者提出以階層式架構結合單向函數而形成單向函數樹的方法,此種方法可以有效降低在有成員加入或離開群體時更換會議金鑰的訊息量。然而此種方法無法抵擋共謀攻擊,因此本文以單向函數樹的方法為基礎,改善其對於共謀攻擊方面的弱點,以提供一更具安全性並兼顧效率的群播技術。
    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.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback