ASIA unversity:Item 310904400/6549
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90453/105671 (86%)
造访人次 : 15392334      在线人数 : 300
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/6549


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6549


    题名: A Scheme for Threshold Multi-Secret Sharing
    作者: Chan, C. W.;Chang, C. C
    关键词: 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
    日期: 2005-07
    上传时间: 2009-12-17 14:58:34 (UTC+8)
    出版者: Asia University
    摘要: 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.
    關聯: Applied Mathematics and Computation 166(1) : 1-14
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown549检视/开启
    310904400-6549.doc50KbMicrosoft Word234检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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