Perfect Secret Sharing Schemes based on generalized Kirkman squares

摘要：

In perfect secret sharing schemes, unauthorized collaboration participants cannot get any information about the secret In 1998, Chaudhry etc. proposed a perfect secret sharing schemes arising from critical sets of Room Squares. This paper presents a perfect secret sharing schemes based on starter-adder sets of generalized Kirkman squares. A starter-adder set of the generalized Kirkman square as a secret, the dealer calculates the pseudo-share in accordance with the Karnin-Greene-Hellman algorithm to distribute that to each participant. By the concentrate pseudoshare of each authorized participant, the dealer can reconstruct starter-adder sets of generalized Kirkman squares.

关键词： generalized Kirkman squares starter-adder sets secret sharing scheme perfect secret sharing scheme

作者: WANG Changyuan

作者单位: Department of Mathematics & Statistics, Zaozhuang University, Zaozhuang 277160, Shandong, China

会议类型: 国际会议

会议名称: 2011 4th International Conference on Biomedical Engineering and Informatics(第四届生物医学工程与信息学国际会议 BMEI 2011)

会议地点: 上海

会议语种:英文

页码: 2076-2079

在线出版日期: 2011-10-15（万方平台首次上网日期，不代表论文的发表时间）