| Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs |
| |
| 作者姓名： | Ying-pu Deng Li-feng Guo Mu-lan Liu |
| |
| 作者单位： | Ying-pu Deng Mu-lan Liu Academy of Mathematics and Systems Science，Chinese Academy of Sciences，Beijing 100080，ChinaLi-feng Guo State Key Laboratory of Information Security，Graduate School of Chinese Academy of Sciences，Beijing 100049，China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China （No.10501049, 90304012） and 973 Project （No. 2004CB318000）. |
| |
| 摘 要： | In an anonymous secret sharing scheme the secret can be reconstructed without knowledge ofwhich participants hold which shares.In this paper some constructions of anonymous secret sharing schemeswith 2 thresholds by using combinatorial designs are given.Let v(t,w,q)denote the minimum size of the setof shares of a perfect anonymous(t,w)threshold secret sharing scheme with q secrets.In this paper we provethat v(t,w,q)=(q)if t and w are fixed and that the lower bound of the size of the set of shares in4]is notoptimal under certain condition.
|
| 关 键 词： | 匿名秘密分享计划 Steiner系统 群整除设计 差分族 相关差分集 |
| 收稿时间： | 10 September 2004 |
| 修稿时间： | 2004-09-102006-06-21 |
Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs |
| |
| Ying-pu Deng Li-feng Guo Mu-lan Liu.Constructions for Anonymous Secret Sharing Schemes Using Combinatorial Designs[J].Acta Mathematicae Applicatae Sinica,2007,23(1):67-78. |
| |
| Authors: | Ying-pu Deng Li-feng Guo Mu-lan Liu |
| |
| Institution: | (1) Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China;(2) State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, China |
| |
| Abstract: | 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 in4]is not optimal under certain condition. |
| |
| Keywords: | Anonymous secret sharing schemes Steiner systems group divisible designs difference families relative difference sets |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
