摘要
针对当前电子商务对数字签名方案提出的新要求,在改进后的短签名方案的基础上,提出了一种基于双线性对的新型门限签名方案,使得单个签名成员可高效地完成签名。分析表明,方案具有不可冒充性和可审计性,同时可以动态地增删成员,较之已有的门限签名方案其具有密钥分发简单、签名过程执行高效等优势。
To meet the new requirements droven by nowadays E-commerce for the signature schemes,a new threshold signature scheme was proposed from bilinear pairings based on improved short signature scheme,in which a single signing member can accomplish signature efficiently.The analysis shows that the scheme serves properties of non-masquerading and auditing,the members can be added and revoked dynamically.Compared with the existing threshold signature scheme,our scheme is more convenient in secret key distribution and more efficient in signing process.
出处
《计算机科学》
CSCD
北大核心
2011年第4期111-114,共4页
Computer Science
基金
国家自然科学基金(60903018)
河海大学中央高校基本科研业务费项目(2009B20514
2010B16314)资助
关键词
门限签名
双线性对
概率签名
秘密共享
Threshold signature
Bilinear pairings
Probabilistic signature
Secret sharing
