Tunghai University Institutional Repository:Item 310901/5032
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4220054      Online Users : 495
RC Version 6.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://140.128.103.80:8080/handle/310901/5032


    Title: 建構於階層式架構上的秘密分享機制
    Other Titles: Efficient Secret Sharing with Access Structures in a Hierarchy
    Authors: 李威
    Lee, Wei
    Contributors: 林祝興
    Lin, Chu-Hsing
    東海大學資訊工程學系
    Keywords: 秘密分享;存取架構;階層式金鑰管理;離散對數;單項雜湊函數;對稱式加密
    secret sharing;access structures;hierarchical key management;discrete logarithm;one-way hash function;symmetric key cryptography
    Date: 2004
    Issue Date: 2011-05-19T07:32:37Z (UTC)
    Abstract: Secret sharing with access structures in a hierarchy has two properties. First, each group wants to communicate with the others, the participants in the group need to share their secrets based upon access structures. Second, groups are divided into several levels, and each level has its own ancestors and descendants. Based upon the properties of hierarchical key management, only the ancestor groups can hold the descendant groups’ secret keys. In this paper, we suggest two approaches to solve the problem of secret sharing with access structures in a hierarchy. In the first approach, we use the concept of discrete logarithm to reuse shadows, and we adopt Cho’s mechanism to achieve the properties of hierarchical key management. The drawback of the first approach is to spend a lot of time on computation. In the second approach, we use one way hash function to allow the shadows to be reused, and we use the symmetric key cryptography to achieve the properties of hierarchical key management. The second approach is more efficient than the first one. The presented schemes are based upon general hierarchies. They are suitable for many real applications. For example, a business with hierarchical organization can use the proposed schemes to transmit documents and data, and military departments can exchange their reports by the proposed schemes to achieve the properties of hierarchical access control and secret sharing.
    Appears in Collections:[Department of Computer Science and Information ] Master's Theses

    Files in This Item:

    There are no files associated with this item.



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


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

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