基于双线性对的动态门限多秘密共享方案  

Dynamic threshold multi-secret sharing scheme based on bilinear pairing

作　　者：黄伟达[1] 姚国祥[1] 沈瑞雪[1] 

机构地区：[1]暨南大学信息科学技术学院,广东广州510632

出　　处：《计算机工程与设计》2012年第3期901-905,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(61070164);广东省部产学研基金项目(2008B090500201);广东省科技计划基金项目(2009B010800023);高校成果转化基金项目(cgzhzd0807)

摘　　要：为解决当前许多门限秘密共享方案都是基于RSA密码体制和门限值是不变性的不足,分析了一些其他文献的多秘密共享方案,提出了一个基于椭圆曲线的双线性对动态门限多秘密共享方案。通过一个多项式实现动态门限的多秘密共享,并利用双线性对对参与者身份进行验证,所以能在任何场合中确保秘密安全,而无需安全通道,具有高效性,减少通信量,并且能有效地防止欺骗行为。同时,该方案能够定时地更新共享的秘密,增加了安全性。分析结果表明了该方案的高效性和安全性。In order to address the problems that many current threshold secret sharing schemes are based on RSA cryptosystem and thresholds are invariant. After analyzing the literature of other multi-secret sharing scheme, a dynamic threshold multi-secret sharing scheme based on hilinear pairing and elliptic curve is proposed. In the scheme, multi-level threshold is realized by a polynomial, and the identity of participants can be authenticated through bilinear pairing, therefore, secret security is abled to be guaranteed on any occasion. Because no scure channel is used, the scheme has low communication comsuption and high effiency, and can prevent cheating. Moreover, the scheme renew the sharing secrets, which improve the security of the scheme. And the analysis indicates that it＇s a scure and effective dynamic threshold signature scheme.

关 键 词：双线性对 动态门限 椭圆曲线 多秘密共享 定期更新 

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