一个基于状态树的(t,n)秘密共享方案

A state-tree based(t,n) secret sharing scheme

在简述已有(t,n)秘密共享方案的基础上,提出了一个直观、简洁有效的基于状态树的(t,n)秘密共享方案,包括设计考虑、算法描述、算法实例,并对该方案进行了分析。分析表明,该方案秘密分割算法具有多项式复杂度,秘密重建算法具有线性复杂度,满足门限机密性和门限可用性。

By introducing and analyzing the existed threshold secret sharing schemes, a visual, concise and efficient state-tree based （t, n） secret sharing scheme was proposed and analyzed, including designing consideration, algorithm description and algorithm instance. It was shown that the secret split algorithm of the scheme polynomial complexity and the secret reconstruction algorithm have hnear complexity. This scheme can provide threshold confidentiality and threshold availability.