基于多项式秘密共享的前摄性门限RSA签名方案  

Proactive Threshold RSA Signature Scheme Based on Polynomial Secret Sharing

作　　者：徐甫[1,2] 

机构地区：[1]解放军信息工程大学,郑州450002 [2]北京市信息技术研究所,北京100094

出　　处：《电子与信息学报》2016年第9期2280-2286,共7页Journal of Electronics & Information Technology

基　　金：国家科技重大专项(2012ZX03002003)~~

摘　　要：现有可证明安全的前摄性门限RSA签名方案均依赖加性秘密共享方法,存在每次签名均需所有成员参与,易暴露合法成员的秘密份额,签名效率低下等问题。该文以Shoup门限签名为基础,提出一种基于多项式秘密共享的前摄性门限RSA签名方案,并对其进行了详细的安全性及实用性分析。结果表明,在静态移动攻击者模型中,该方案是不可伪造的和稳健的,与现有同类方案相比,其通信开销更低,运算效率更高。All the existing provable secure proactive threshold RSA signature schemes rely on additive secret sharing, in which all players have to cooperate to produce a signature, valid players＇ secret shares may be exposed, and the computing efficiency is too low. Based on Shoup＇s threshold RSA signature scheme, a proactive threshold RSA signature scheme is proposed by using polynomiM secret sharing, and its security and practicability are analyzed. Results show that the proposed scheme is unforgeable and robust under the model of static mobile adversary, and compared with the existing comparable schemes, its communication overhead is lower and computing efficiency is higher.

关 键 词：门限签名 RSA 多项式秘密共享 前摄性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]