A Fast (3, n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations
A Fast (3, n)-Threshold Secret Sharing Scheme Using Exclusive-OR Operations
复制标题
一种使用异或运算的快速(3, n)阈值秘密共享方案
DOI：
10.1093/ietfec/e91-a.1.127
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Toshiaki Tanaka
中科院分区：
文献类型：
--
作者：
Jun Kurihara;S. Kiyomoto;Kazuhide Fukushima;Toshiaki Tanaka
在Shamir的（k，n）-门限秘密共享方案[1]中，生成n个秘密共享并从k个秘密共享中恢复秘密需要很大的计算代价。为了解决这一问题，已经提出了几种快速阈值方案。然而，没有快速的理想（k，n）-阈值方案，其中k ≥ 3，n是任意的。本文提出了一种新的快速（3，n）门限方案，该方案只使用异或（XOR）运算来进行共享和恢复秘密，是一种类似于Shamir方案的理想秘密共享方案。此外，我们评估的计划的效率，并表明它是更有效的比沙米尔的计算成本。此外，我们建议一个快速的（k，n）-阈值方案可以通过类似的方式，通过增加随机数的集合，构建的份额。
In Shamir's (k,n)-threshold secret sharing scheme [1], a heavy computational cost is required to make n shares and recover the secret from k shares. As a solution to this problem, several fast threshold schemes have been proposed. However, there is no fast ideal (k,n)-threshold scheme, where k ≥ 3 and n is arbitrary. This paper proposes a new fast (3,n)-threshold scheme by using just EXCLUSIVE-OR(XOR) operations to make shares and recover the secret, which is an ideal secret sharing scheme similar to Shamir's scheme. Furthermore, we evaluate the efficiency of the scheme, and show that it is more efficient than Shamir's in terms of computational cost. Moreover, we suggest a fast (k,n)-threshold scheme can be constructed in a similar way by increasing the sets of random numbers constructing pieces of shares.