| 基于正交向量的秘密共享方案 |
| |
| 引用本文： | 黄明刚.基于正交向量的秘密共享方案[J].陕西工学院学报,2010(1):67-70,85. |
| |
| 作者姓名： | 黄明刚 |
| |
| 作者单位： | 陕西理工学院土木工程与建筑系,陕西汉中723001 |
| |
| 摘 要： | 利用正交向量的特性以及拉格朗日插值多项式，提出一种（m，n）门限秘密共享方案和一种（m＋n，t1＋t2）门限秘密共享方案。这两种方案可以预防参与者之间的互相欺诈以及不诚实分发者的欺诈行为，且容易实现系统共享密钥的更新。系统中的秘密分发者能比较简单地实现成员的增加与删减。
|
| 关 键 词： | 正交向量 门限秘密共享 拉格朗日插值 |
Secret sharing scheme based on orthogonal vectors |
| |
| HUANG Ming-gang.Secret sharing scheme based on orthogonal vectors[J].Journal of Shaanxi Institute of Technology,2010(1):67-70,85. |
| |
| Authors: | HUANG Ming-gang |
| |
| Affiliation: | HUANG Ming-gang (Dept. of C. E. of Shaanxi University of Technology, Hanzhong 723001, China) |
| |
| Abstract: | A secure secret sharing shceme and a secret sharing shceme are proposed based on the orthogonal vectors and Lagrange interpolation ploynominal. These schemes can avoid unfaithful participants to cheat each other and the unfaithful dealer distribute incorrect shadows to the participants. It is easy to renew the system secrets. The dealer can easily add or delete the members of the system. |
| |
| Keywords: | orthogonal vectors threshold secret sharings Lagrange interpolation |
| 本文献已被 维普 等数据库收录！ |
