| 基于Howell designs的完备秘密共享方案 |
| |
| 引用本文： | 王长远.基于Howell designs的完备秘密共享方案[J].徐州师范大学学报(自然科学版),2011(3). |
| |
| 作者姓名： | 王长远 |
| |
| 作者单位： | 枣庄学院数学与统计学院; |
| |
| 基金项目： | 枣庄学院青年科技基金资助项目(2009) |
| |
| 摘 要： | 在完备秘密共享方案中,非授权集得不到有关秘密的任何信息.1998年,Chaudhry等提出了一种由Room方的临界集产生的完备秘密共享方案.基于此,提出一种从Howell designs的临界集得到的完备秘密共享方案.将一个Howell design的一个临界集作为秘密,秘密分发者按照Karnin-Greene-Hellman算法计算出伪部分依次发给每个参与者.授权集中每个参与者得到的伪部分合在一起,就能重构此Howell design的临界集即秘密.
|
| 关 键 词： | Howell design 临界集 秘密共享方案 完备秘密共享方案 |
Perfect secret sharing schemes based on Howell designs |
| |
| Wang Changyuan.Perfect secret sharing schemes based on Howell designs[J].Journal of Xuzhou Normal University(Natural Science Edition),2011(3). |
| |
| Authors: | Wang Changyuan |
| |
| Institution: | Wang Changyuan(School of Mathematics & Statistics,Zaozhuang University,Zaozhuang 277160,Shandong,China) |
| |
| Abstract: | In perfect secret sharing schemes,unauthorized collaboration participants cannot get any information about the secret.In 1998,Chaudhry et al proposed a perfect secret sharing scheme arising from critical sets of Room squares.This paper presents a perfect secret sharing scheme based on critical sets of Howell designs.Taking a critical set of a Howell design as a secret,the dealer calculates the pseudo-share in accordance with the Karnin-Greene-Hellman algorithm and distributes that to each participant.By the... |
| |
| Keywords: | Howell design critical set secret sharing scheme perfect secret sharing scheme |
| 本文献已被 CNKI 等数据库收录！ |
