计算机工程与应用2016，Vol.52Issue(13)：38-42,109,6.DOI:10.3778/j.issn.1002-8331.1601-0192
基于二元对称多项式的公平秘密共享方案
Fair secret sharing scheme based on symmetric bivariate polynomial.
摘要
Abstract
Based on symmetric bivariate polynomial, this paper proposes a new fair (t, n) threshold secret sharing scheme, which can guarantee that each participant can recover the correct secret if all participants are legal and honest;when there is a cheater, all participants are unable to recover the correct secret. In the proposed scheme, a symmetric bivariate polyno-mial is used to generate session key for any two participants;moreover, combined with discrete logarithm, the symmetric bivariate polynomial enables the scheme to choose a sufficiently long sequence of secrets to guarantee the fairness while each participant holds a small number of shares. Additionally, the scheme also can achieve fair secret recovery in asyn-chronous environment. Compared with Harn's scheme, the proposed scheme is fairer and more flexible.关键词
秘密共享/欺骗者/二元对称多项式/公平性Key words
secret sharing/cheater/symmetric bivariate polynomial/fairness分类
信息技术与安全科学引用本文复制引用
顾为玉,苗付友,何晓婷..基于二元对称多项式的公平秘密共享方案[J].计算机工程与应用,2016,52(13):38-42,109,6.基金项目
国家自然科学基金(No.61572454,No.61472382,No.61232018). （No.61572454,No.61472382,No.61232018）
