English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56437/90265 (63%)
Visitors : 11704205      Online Users : 51
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/59859

    Title: An Efficient Dynamic Threshold Scheme
    Authors: Hwang, Shin Jia;Chang, Chin Chen;Yang, Wei Pang
    Contributors: 淡江大學資訊工程學系
    Keywords: secret sharing;threshold scheme;dynamic threshold scheme;discrete logarithm
    Date: 1996-07
    Issue Date: 2013-06-07 10:46:53 (UTC+8)
    Publisher: Tokyo: Denshi Jouhou Tsuushin Gakkai
    Abstract: To improve the efficiency for the threshold schemes, the major problem is that the secret shadows cannot be reused after renewing or recovering the shared secret. However, if the secret shadows cannot be reused, the established threshold scheme is limited to be used only once. It is inefficient to reconstruct the whole secret sharing system. Therefore, we introduce an efficient dynamic threshold scheme. In the new scheme, the shadowholders can reuse the secret shadows no matter that the shared secret is renewed or recovered. In addition, the new scheme provides a way by which the dealer can renew the shared secret or reconstruct the secret sharing system, efficiently. Therefore, this scheme is good for maintaining the important secrets.
    Relation: IEICE Transactions on Information and Systems E79-D(7), pp.936-942
    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