计算机工程 ›› 2009, Vol. 35 ›› Issue (10): 158-161.doi: 10.3969/j.issn.1000-3428.2009.10.052

• 安全技术 • 上一篇    下一篇

基于双线性对的可验证秘密共享及其应用

田有亮,彭长根   

  1. (贵州大学理学院,贵阳 550025)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-05-20 发布日期:2009-05-20

Verifiable Secret Sharing and Its Applications Based on Bilinear Pairings

TIAN You-liang, PENG Chang-gen   

  1. (College of Science, Guizhou University, Guiyang 550025)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-05-20 Published:2009-05-20

摘要: 利用双线性对设计一个知识承诺方案,该承诺方案满足知识承诺的隐藏性和绑定性要求。利用该承诺方案构造一个秘密共享方案,该方案是可验证的、子密钥能定期更新的(t, n)门限方案。根据秘密共享方案设计一个可验证的门限签名方案。该签名方案是前向安全的,各成员的签名子密钥能定期更新,无需求逆运算,执行效率更高。

关键词: 可验证秘密共享, 双线性对, 承诺, 前向安全, 门限签名

Abstract: A knowledge commitment scheme is designed by making use of bilinear pairings, it satisfies hiding and binding of commitment. Using the scheme, a new secret sharing scheme is constructed. This scheme is a verifiable(t, n) threshold secret sharing scheme that its shares can be updated. Based on the threshold secret sharing, a verifiable(t, n) threshold signature scheme is structured. This scheme is forward secure, and shares of parties can be updated and need not compute the inverse element.

Key words: verifiable secret sharing, bilinear pairings, commitment, forward secure, threshold signature

中图分类号: