可公开验证可更新的多秘密共享方案  

Publicly verifiable and renewable multi-secret sharing scheme

作　　者：尚雪娇[1] 杜伟章[1] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410114

出　　处：《计算机应用研究》2013年第12期3794-3796,3799,共4页Application Research of Computers

摘　　要：针对现有的多秘密共享方案不能同时满足秘密份额的动态更新和可公开验证性的问题,提出一种可公开验证可更新的多秘密共享方案。该方案利用单向散列链构造更新多项式,使得参与者的秘密份额能够定期更新,并且在秘密分发的同时生成验证信息,任何人都可以根据公开信息对秘密份额和更新份额的有效性进行验证,及时检测成员之间的相互欺诈行为。分析表明,在椭圆曲线上的离散对数问题和计算性Diffie-Hellman问题困难的假设下,该方案能有效地抵抗内外部攻击,具有较好的安全性。In order to solve the problem that the proactive refreshment of secret shares and public verifiability could not be satisfied simultaneously in previous multi-secret sharing schemes, this paper proposed a publicly verifiable and renewable multi-secret sharing scheme. It constructed the updated polynomials by a one-way hash chain, which could make secret shares be updated periodically, and generated the verification information during the process of secret distribution. According to the public information, anyone could verify the validity of secret shares and renewed shares. Cheating of dealer and participants could be detected in time. Under the assumptions of elliptic curve discrete logarithm problem （ECDLP） and computational Diffie-Hellman problem （CDLP） , this scheme can effectively resist internal and external attacks and has better security.

关 键 词：多秘密共享 动态更新 可公开验证性 单向散列链 DIFFIE-HELLMAN问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]