In 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 b...In 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. Let v(t, w, q) denote the minimum size of the set of shares of a perfect anonymous (t, w) threshold secret sharing scheme with q secrets. In this paper we prove that v(t, w, q) - Θ(q) if t and w are fixed and that the lower bound of the size of the set of shares in [4] is not optimal under certain condition.展开更多
基金Supported by the National Natural Science Foundation of China(No.10501049,90304012) 973 Project(No.2004CB318000)
文摘In 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. Let v(t, w, q) denote the minimum size of the set of shares of a perfect anonymous (t, w) threshold secret sharing scheme with q secrets. In this paper we prove that v(t, w, q) - Θ(q) if t and w are fixed and that the lower bound of the size of the set of shares in [4] is not optimal under certain condition.