constructionsforanonymoussecretsharingschemesusingcombinatorialdesigns
文献类型：期刊论文
| 作者 | Yingpu Deng2 ; Lifeng Guo1; Mulan Liu2
|
| 刊名 | actamathematicaeapplicataesinica
 |
| 出版日期 | 2007 |
| 卷号 | 023期号:001页码:67 |
| ISSN号 | 0168-9673 |
| 英文摘要 | 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. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/49659]  |
| 专题 | 系统科学研究所 |
| 作者单位 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。