计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (12): 33-35.DOI: 10.3778/j.issn.1002-8331.2009.12.010

• 博士论坛 • 上一篇    下一篇

高效的可验证多秘密共享方案

谭晓青1,2   

  1. 1.暨南大学 信息科学技术学院 数学系,广州 510632
    2.中山大学 广东省信息安全技术重点实验室,广州 510275
  • 收稿日期:2008-12-30 修回日期:2009-02-09 出版日期:2009-04-21 发布日期:2009-04-21
  • 通讯作者: 谭晓青

Efficient verifiable multi-secret sharing scheme

TAN Xiao-qing1,2   

  1. 1.Department of Mathematics,College of Information Science and Technology,Jinan University,Guangzhou 510632,China
    2.Guangdong Key Laboratory of Information Security Technology,Sun Yat-sen University,Guangzhou 510275,China
  • Received:2008-12-30 Revised:2009-02-09 Online:2009-04-21 Published:2009-04-21
  • Contact: TAN Xiao-qing

摘要: 秘密共享是当前信息安全和密码学中一个重要的研究课题,在密钥托管、电子商务、安全多方计算、导弹发射控制等诸多领域均有广泛的应用。利用双变量单向函数的隐蔽性、离散对数问题的难解性,基于Hermite插值多项式提出了一个新的可验证多秘密共享方案以共享p个主秘密,该方案具有效率高、子秘密可重复使用、多个主秘密能同时被重构、可验证等特点。

关键词: 可验证多秘密共享, 双变量单向函数, Hermite插值多项式, 有限域上离散对数问题

Abstract: Secret sharing plays an important role in information security and cryptography.It has wide applications in such fields as key escrow,electronic commerce,secure multiparty computation,control of missile launch,and so on.An efficient new verifiable multi-secret sharing scheme based on two variable one-way function and Hermite interpolation polynomial and discrete logarithm problem is presented.It can share p secrets,in which the participants’ shadows are remained secretly and can be reused.And these multiple secrets can be recovered at the same time.Every participant can verify values proposed by another participant.

Key words: verifiable multi-secret sharing, two variable one-way function, Hermite interpolation polynomial, discrete logarithm problem for finite field