Shamir的(k,n)门限秘密共享方案

Shamir提出秘密共享概念的同时，也分别给出了(k,n)门限秘密共享体制的概念。简单地说，设秘密通过秘密共享算法分发给个成员共享，每一个成员持有一个子密钥也称为影子或秘密碎片，如果满足:

(1)任何不少于k个的合格成员通过所持有的正确的碎片都可以重构。

(2)任何k个以下的成员集都无法重构。

称这种方案为(k,n)门限秘密共享方案，简称为门限方案，k称为方案的门限值。 作为各种秘密共享方案中最简单实用的门限秘密共享方案，(k,n)门限秘密共享方案也是这些方案中最具有代表性和广泛应用的方案。下面简单介绍一下这个方案 -Shamir' s (k, n) threshold secret sharing scheme Shamir proposed the concept of secret sharing, were also given (k, n) threshold secret sharing system concept. Simply set in secret by secret sharing algorithm distributed members share held by every member of a sub-key is also known as the shadow or secret debris, if: (1) any less than k qualified members through the correct fragmentation held can be reconstructed. (2) The members of any k sets can not be reconstructed. This scheme (k, n) threshold secret sharing scheme, referred to as the threshold scheme, k is called the threshold of the program. As secret sharing scheme in the most simple and practical door threshold secret sharing scheme (k, n) threshold secret sharing scheme is also the most representative and widely used programs such programs. Following is a brief look at this program