| 无可信中心的多秘密共享方案 |
| |
| 引用本文： | 濮光宁,殷凤梅,侯整风.无可信中心的多秘密共享方案[J].重庆科技学院学报(自然科学版),2011,13(4):150-151,166. |
| |
| 作者姓名： | 濮光宁 殷凤梅 侯整风 |
| |
| 作者单位： | 1. 合肥工业大学,合肥,230009
2. 合肥师范学院,合肥,230601 |
| |
| 基金项目： | 合肥师范学院院级科研项目(2011kj03); 安徽高校省级自然科学研究项目(KJ2010B162) |
| |
| 摘 要： | 现有的多秘密共享方案虽然可以防止可信中心欺骗,但往往计算量较大。针对此问题,基于离散对数求解的困难性,提出无可信中心的多秘密共享方案。该方案不存在可信中心,可以避免可信中心在分发秘密份额时的主动欺骗或无意欺骗。
|
| 关 键 词： | 可信中心 多秘密共享 门限方案 离散对数 Lagrange插值 |
Multi-secret Sharing Scheme Without a Trusted Party |
| |
| PU Guang-ning, YIN Feng-mei HOU Zheng-feng.Multi-secret Sharing Scheme Without a Trusted Party[J].Journal of Chongqing University of Science and Technology:Natural Science Edition,2011,13(4):150-151,166. |
| |
| Authors: | PU Guang-ning YIN Feng-mei HOU Zheng-feng |
| |
| Affiliation: | PU Guang-ning1,2 YIN Feng-mei3 HOU Zheng-feng1(1.School of Computer and Information,Hefei University of Technology,Hefei 230009,2.Anhui Finance & Trade Vocational College,Hefei 230601,3.Hefei Normal University,Hefei 230601) |
| |
| Abstract: | Most present multi-secret sharing schemes need a lot of computation in order to prevent the trusted party from being cheated.To solve this problem,multi-secret sharing scheme without a trusted party on the basis of the intractability of the discrete logarithm is presented.Because the trusted party does not exist in the proposed scheme,which can prevent the trusted party from being actively or unintentionally cheated,it has good practical application. |
| |
| Keywords: | trusted party multi-secret sharing threshold scheme discrete logarithm Lagrange interpolation |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
