English  |  正體中文  |  简体中文  |  Items with full text/Total items : 16335/24215 (67%)
Visitors : 11477616      Online Users : 324
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.nknu.edu.tw/ir/handle/987654321/11983

    題名: Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme
    Authors: 王釋毅;賴溪松
    Shyh-Yih Wang;Chi-Sung Laih
    貢獻者: 光電與通訊工程學系
    Keywords: Access control;cryptography;key management
    Date: 2006-01
    Issue Date: 2010-11-19 16:49:57 (UTC+8)
    Abstract: Conventional hierarchical key assignment schemes have not been concerned with a practical situation: Users might be assigned to a class for only a period of time. When a user leaves a class, the keys of that class and all the descendent classes must be renewed. For applications where the privileges of users change frequently or where there are many users, the communication load for key redistributions is very large. Recently, Tzeng (2002) proposed a time-bound hierarchical key assignment scheme to address this issue. However, Tzeng's scheme was very complex and suffered from a collusion attack. In this paper, we propose an efficient time-bound scheme based on a technique called merging. The idea behind merging is to consider primitive keys instead of hierarchies. It is conceptually like the compression used in source coding. Through this technique, it is feasible to combine multiple keys into an aggregate key. Thus, communication and storage requirements are greatly reduced. This technique can also be used for an alternative implementation of Akl-Taylor's scheme. Moreover, it can be used to construct a systematic approach for adjusting hierarchies in Akl-Taylor's scheme as well. Through the insights gained from these exercises, we may see that some problems that are usually addressed by the conventional key assignment schemes can be solved directly via merging, with better performance. Furthermore, if other suitable merging functions are found in the future, new secure hierarchical key assignment schemes and time-bound schemes is obtained accordingly.
    關聯: IEEE Transactions on Dependable and Secure Computing / vol.3, no.1, pp.91-100, DOI: 10.1109/TDSC.2006.15
    Appears in Collections:[光電與通訊工程學系] 期刊論文
    [光通系] 王釋毅

    Files in This Item:

    File SizeFormat

    All items in NKNUIR are protected by copyright, with all rights reserved.

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