中国科学院研究生院学报2011，Vol.28Issue(6)：806-810,5.
基于椭圆曲线的可验证的理性秘密共享方案
A verifiable rational secret sharing scheme based on the elliptic curve
摘要
Abstract
A new scheme for rational secret sharing is proposed in game theoretic settings. The scheme has the following characteristics. The scheme is based on elliptic curve cryptography and it is verifiable. The dealer' s and the participants' cheat can be detected. In addition, the participation of the trusted party is not needed in the secret reconstruction stage. The scheme inserts the secret into a series of fake secrets, and participants do not know whether the current round is a test round. The scheme gives rational players incentives to abide by the protocol. Finally, every player can obtain the secret fairly. Analyses indicate that the scheme is simple, fair, and effective.关键词
秘密共享/博弈论/椭圆曲线/公平Key words
secret sharing/ game theory/ elliptic curve/ fairness分类
信息技术与安全科学引用本文复制引用
张恩,蔡永泉..基于椭圆曲线的可验证的理性秘密共享方案[J].中国科学院研究生院学报,2011,28(6):806-810,5.基金项目
国家自然科学基金(61170221)、国家973重点基础研究发展规划项目(2007CB311106)、北京市自然科学基金(1102003)资助 （61170221）
