线性码上的可验证多秘密共享方案  

Verifiable Multi-secret Sharing Scheme on Linear Codes

作　　者：郭玉娟[1] 李志慧[1] 赖红[1] 

机构地区：[1]陕西师范大学数学与信息科学学院,西安710062

出　　处：《计算机工程》2011年第21期89-90,共2页Computer Engineering

基　　金：国家自然科学基金资助项目(10571112);中央高校基本科研业务费专项基金资助项目(10871123)

摘　　要：基于Massy的秘密共享体制和RSA密码体制,提出一个可验证的多秘密共享方案。在秘密共享阶段,参与者的份额由各个参与者自己选取,且其子秘密的传送可以通过公开的信道发送给秘密分发者。在秘密恢复阶段,可以验证参与者是否进行欺骗。该方案可以动态地更新秘密,无需更改参与者的秘密份额,只需更改公告牌上的部分相应信息。与以往的(t,n)门限秘密共享方案相比,该方案具有更丰富的授权子集。This paper proposes a verifiable multi-secret sharing scheme based on the Massy secret sharing scheme and RSA encryption algorithm.In the sharing phase,the shares of each participant are chosen by himself or herself and sub-secret is transmitted to the secret dealer by using public channel.In the recovering phase,designated combiner is allowed to check whether each participant provides the true value.Multi-secrets are dynamically renewed without re-distributing the participant’s shares,the dealer only renew the values related to the renewed secrets in a public board.Compared with the former dynamic secret sharing schemes,this scheme has more interesting access structure.

关 键 词：线性码 RSA密码体制 多秘密共享体制 对偶码 极小码字 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]