淡江大學機構典藏:Item 987654321/63281
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3991477      Online Users : 521
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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/63281


    Title: Secure and efficient group key management with shared key derivation
    Authors: Lin, Jen-Chiun;Huang, Kuo-Hsuan;Lai, Feipei;Lee, Hung-Chang
    Contributors: 淡江大學資訊管理學系
    Keywords: Secure group communication;Group key management;Key tree;Shared key derivation
    Date: 2009-01
    Issue Date: 2011-10-19 20:06:48 (UTC+8)
    Publisher: Amsterdam: Elsevier BV * North-Holland
    Abstract: In many network applications, including distant learning, audio webcasting, video streaming, and online gaming, often a source has to send data to many receivers. IP multicasts and application-layer multicasts provide efficient and scalable one-to-many or many-to-many communications. A common secret key, the group key, shared by multiple users can be used to secure the information transmitted in the multicast communication channel. In this paper, a new group key management protocol is proposed to reduce the communication and computation overhead of group key rekeying caused by membership changes. With shared key derivation, new keys derivable by members themselves do not have to be encrypted or delivered by the server, and the performance of synchronous and asynchronous rekeying operations, including single join, single leave, and batch update, is thus improved. The proposed protocol is shown to be secure and immune to collusion attacks, and it outperforms the other comparable protocols from our analysis and simulation. The protocol is particularly efficient with binary key trees and asynchronous rekeying, and it can be tuned to meet different rekeying delay or key size requirements.
    Relation: Computer Standards & Interfaces 31(1), pp.192-208
    DOI: 10.1016/j.csi.2007.11.005
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    Secure and efficient group key management with shared key derivation.pdf論文內容1149KbAdobe PDF403View/Open

    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