Linear secret sharing schemes and rearrangements of access structures

被引:4
作者
Xiao L.-L. [1 ]
Liu M.-L. [2 ]
机构
[1] Institute of Software, State Key Laboratory of Information Security, Chinese Academy of Sciences, Beijing
[2] Academy of Mathematics and Systems Science, Key Laboratory of Mathematics Mechanization, Chinese Academy of Sciences, Beijing
基金
中国国家自然科学基金;
关键词
Access structure; Linear secret sharing scheme; Monotone span program; Rearrangement of access structure;
D O I
10.1007/s10255-004-0206-7
中图分类号
学科分类号
摘要
In this paper we study linear secret sharing schemes by monotone span programs, according to the relation between realizing access structures by linear secret sharing schemes and computing monotone Boolean functions by monotone span programs. We construct some linear secret sharing schemes. Furthermore, we study the rearrangements of access structures that is very important in practice. © Springer-Verlag 2004.
引用
收藏
页码:685 / 694
页数:9
相关论文
共 3 条
  • [1] Beimel A., Secure schemes for secret sharing and key distribution, (1996)
  • [2] Shamir A., How to share a secret, Communications of the ACM, 22, pp. 612-613, (1979)
  • [3] Simmons G.J., Contemporary Cryptology, (1992)