ASIA unversity:Item 310904400/6549
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105671 (86%)
Visitors : 15392278      Online Users : 293
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:

    Title: A Scheme for Threshold Multi-Secret Sharing
    Authors: Chan, C. W.;Chang, C. C
    Keywords: Access structure;Basis of access structure;The Chinese remainder theorem;Distinctness;Entropy;Idealness;Multi-secret sharing scheme;Perfectness;The Shamir (t, n)-threshold secret sharing scheme;(t, n)-threshold access structure;Threshold multi-secret sharing scheme
    Date: 2005-07
    Issue Date: 2009-12-17 14:58:34 (UTC+8)
    Publisher: Asia University
    Abstract: A multi-secret sharing scheme is a natural generalization of the secret sharing scheme. We show the close similarity between the Chinese remainder theorem and the uniqueness theorem of interpolating polynomial. Based on the similarity, we propose a threshold multi-secret sharing scheme that is a generalization of the Shamir threshold scheme. We also show that the proposed scheme with the proposed deletion procedure can realize all possible monotone access structures.
    Relation: Applied Mathematics and Computation 166(1) : 1-14
    Appears in Collections:[Department of Computer Science and Information Engineering] Journal Artical

    Files in This Item:

    File Description SizeFormat
    310904400-6549.doc50KbMicrosoft Word234View/Open

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

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