计算机科学 ›› 2011, Vol. 38 ›› Issue (4): 111-114.
• 计算机网络与信息安全 • 上一篇 下一篇
吕鑫,王志坚,许峰
出版日期:
发布日期:
基金资助:
LU Xin,WANG Zhi-jian,XU Feng
Online:
Published:
摘要： 针对当前电子商务对数字签名方案提出的新要求，在改进后的短签名方案的基础上，提出了一种基于双线性对的新型门限签名方案，使得单个签名成员可高效地完成签名。分析表明，方案具有不可冒充性和可审计性，同时可以动态地增删成员，较之已有的门限签名方案其具有密钥分发简单、签名过程执行高效等优势。
关键词: 门限签名，双线性对，概率签名，秘密共享
Abstract: To meet the new requirements drown 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.
Key words: Threshold signature, Bilinear pairings, Probabilistic signature, Secret sharing
吕鑫,王志坚,许峰. 基于双线性对的新型门限签名方案[J]. 计算机科学, 2011, 38(4): 111-114. https://doi.org/
LU Xin,WANG Zhi-jian,XU Feng. New Threshold Signature Scheme Based on Bilinear Pairings[J]. Computer Science, 2011, 38(4): 111-114. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I4/111
Cited
首页