How to Collaborate between Threshold Schemes

How to Collaborate between Threshold Schemes
复制标题

DOI:
--
复制
发表时间:
2013-05
期刊:
ArXiv
影响因子:
--
通讯作者:
Daoshun Wang;Ziwei Ye;Xiaobo Li
Daoshun Wang;Ziwei Ye;Xiaobo Li
中科院分区:
其他
文献类型:
--
作者:
Daoshun Wang;Ziwei Ye;Xiaobo Li

文献摘要

被引文献

相似文献

阈值方案已用于通过向参与者分配份额来保护秘密。为了保护两个秘密,我们可以使用两个单独的传统方案,例如(t1,n1)方案和(t2,n2)方案。如果两个方案都有 u (<=min(t1, t2)) 名参与者参与,则这些 u 参与者中的每一个都必须保留两个不同的份额。本文提出了一种允许每个普通参与者只保留一份份额的方法。我们的方法构造两个具有 u 个公共交叉点的多项式。我们给出了理论细节和两个论证性例子。该算法还可以处理两个以上方案之间的协作。
Threshold schemes have been used to protect secrets by distributing shares to participants. To protect two secrets, we can use two separate traditional schemes, say, a (t1, n1) scheme and a (t2, n2) scheme. If there are u (<=min(t1, t2)) participants involved in both schemes, each of these u participants must keep two different shares. This paper proposes a method that allows each common participant to keep only one share. Our method constructs two polynomials with u common crossover points. We give theoretical details and two demonstrative examples. This algorithm can also handle the collaboration between more than two schemes.