Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs
Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs
复制标题
DOI：
10.1007/s10255-006-0350-3
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Yingpu Deng;Lifeng Guo;Mulan Liu
中科院分区：
文献类型：
--
作者：
Yingpu Deng;Lifeng Guo;Mulan Liu
摘要在匿名秘密共享方案中，秘密可以在不知道哪些参与者持有哪些份额的情况下被重构。利用组合设计方法，给出了一些具有2个门限的匿名秘密共享方案的构造方法。LeTV(t，w，q)表示具有q个秘密的完全匿名(t，w)门限秘密共享方案的份额集的最小大小。本文证明了v(t，w，q)=Θ(Q)是固定的，并证明了文[4]中股份集大小的下界在一定条件下不是最优的。
AbstractIn an anonymous secret sharing scheme the secret can be reconstructed without knowledge of which participants hold which shares. In this paper some constructions of anonymous secret sharing schemes with 2 thresholds by using combinatorial designs are given. Letv(t, w, q) denote the minimum size of the set of shares of a perfect anonymous (t, w) threshold secret sharing scheme withqsecrets. In this paper we prove thatv(t, w, q) = Θ(q) iftandware fixed and that the lower bound of the size of the set of shares in [4] is not optimal under certain condition.