CSpace  > 系统科学研究所
constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns
Yingpu Deng1; Lifeng Guo2; Mulan Liu1
2007
Source Publicationactamathematicaeapplicataesinica
ISSN0168-9673
Volume023Issue:001Pages:67
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. 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.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/49660
Collection系统科学研究所
Affiliation1.中国科学院数学与系统科学研究院
2.中国科学院
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yingpu Deng]'s Articles
[Lifeng Guo]'s Articles
[Mulan Liu]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yingpu Deng]'s Articles
[Lifeng Guo]'s Articles
[Mulan Liu]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yingpu Deng]'s Articles
[Lifeng Guo]'s Articles
[Mulan Liu]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.