Constructions for anonymous secret sharing schemes using combinatorial designs
文献类型：期刊论文
| 作者 | Deng, Ying-pu1 ; Gu, Li-feng2; Liu, Mu-lan1
|
| 刊名 | ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES
 |
| 出版日期 | 2007 |
| 卷号 | 23期号:1页码:67-78 |
| 关键词 | anonymous secret sharing schemes Steiner systems group divisible designs difference families relative difference sets |
| 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) = circle minus(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. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000254931500007 |
| 出版者 | SPRINGER HEIDELBERG |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/4874]  |
| 专题 | 系统科学研究所 |
| 通讯作者 | Deng, Ying-pu |
| 作者单位 | 1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China 2.Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China |
| 推荐引用方式 GB/T 7714 | Deng, Ying-pu,Gu, Li-feng,Liu, Mu-lan. Constructions for anonymous secret sharing schemes using combinatorial designs[J]. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,2007,23(1):67-78. |
| APA | Deng, Ying-pu,Gu, Li-feng,&Liu, Mu-lan.(2007).Constructions for anonymous secret sharing schemes using combinatorial designs.ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES,23(1),67-78. |
| MLA | Deng, Ying-pu,et al."Constructions for anonymous secret sharing schemes using combinatorial designs".ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES 23.1(2007):67-78. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。