摘要
作者引入了多项式数列的概念,给出并证明了它的一些性质.在此基础之上通过利用门限秘密共享的思想和非循环多项式数列的特性设计出具有两类不同访问权限的(u+v,t+1)秘密共享门限方案,结果表明此门限方案是一种安全的、有效的、实用的而且易于实现的密钥共享体制.
The author introduces the concept of polynomial sequence. Some properties about the polyno- mial sequence which constant term is one are gave and proved in this paper. On the basis of this, a (u+ v,t+1)-secret sharing threshold scheme having two kinds of different access right is designed by means of using the thought of secret sharing and the performance of acyclic polynomial sequence. The results reveal that this threshold scheme is a secure effective and practical secret sharing scheme. Furthermore, it can be carried out easily through a instantiation that involves solving indeterminate equations.
出处
《四川大学学报(自然科学版)》
CAS
CSCD
北大核心
2014年第3期423-427,共5页
Journal of Sichuan University(Natural Science Edition)
基金
四川省科研项目(12ZB276)
关键词
多项式数列
秘密共享
门限方案
Polynomial sequence
Secret sharing
Threshold scheme