作　　者： ; ; ;

机构地区： 山东大学网络信息安全研究所

出　　处： 《计算机研究与发展》 2006年第1期23-27,共5页

摘　　要： 提出了一种基于加法共享的非交互的可验证秘密再分发协议,协议同时具有门限的性质,能应用于可改变访问结构的成员集合,新旧成员集合之间不需要保持任何关系·协议采用加法共享和份额备份的技术,不但可以验证秘密影子和子影子的正确性,而且能够恢复错误的影子,同时可以鉴别错误成员的集合,能够解决错误成员定位困难的问题·由于采用的是加法共享的方式,所以可以方便地转化为动态RSA再分发体制·协议是正确的、鲁棒的和安全的,并且各方面性能都比较高· A non-interactive verifiable secret redistribution protocol based on additive sharing is put forward, which has threshold attribute, too. It can be applied to all the sets of shareholders that can alter the access structure, so the set of new shareholders doesn＇t need to joint the one of old shareholders. The protocol adopts additive sharing and share back-up technologies, so it can not only verify the correctness of secret shares and subshares, but also recovery bad secret shares. In addition, it can resolve the hard problem of how to identify the set of bad shareholders. It can be transformed into redistribution protocol in proactive RSA conveniently thanks to additive sharing. The protocol is correct, robust and secure, and its performance in many aspects is very high.

关 键 词： 可验证秘密共享 可验证秘密再分发 动态秘密共享 门限方案

领　　域： [自动化与计算机技术] [自动化与计算机技术]