constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns

CSpace > 系统科学研究所

	constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns
	Yingpu Deng1 ; Lifeng Guo 2; Mulan Liu 1
	2007
发表期刊	actamathematicaeapplicataesinica
ISSN	0168-9673
卷号	023 期号:001 页码:67
摘要	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.
语种	英语
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/49660
专题	系统科学研究所
作者单位	1.中国科学院数学与系统科学研究院 2.中国科学院
推荐引用方式 GB/T 7714	Yingpu Deng,Lifeng Guo,Mulan Liu. constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns[J]. actamathematicaeapplicataesinica,2007,023(001):67.
APA	Yingpu Deng,Lifeng Guo,&Mulan Liu.(2007).constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns.actamathematicaeapplicataesinica,023(001),67.
MLA	Yingpu Deng,et al."constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns".actamathematicaeapplicataesinica 023.001(2007):67.