摘要

A (t, n) secret sharing (SS) scheme can be divided into two protocols: share generation protocol and secret reconstruction protocol. In share generation protocol, a mutually trusted dealer selects a secret and distributes shares to shareholders secretly; in secret reconstruction protocol, a group of t qualified shareholders pool their shares together to reconstruct the secret. However, in secret reconstruction protocol, dishonest shareholders (i.e., cheaters) can pool forged shares to fool honest shareholders. By this way, the cheaters can recover the legitimate secret exclusively, and the honest shareholders get nothing but a fake secret. In this paper, we propose a (t, n)SS that is capable of detecting such cheating fact efficiently. Our scheme is an extension of Shamir's (t, n)SS that uses a symmetric bivariate polynomial. In addition, our scheme adopts no security assumption, it is unconditional secure.

全文