作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (9): 119-120.

• 安全技术 • 上一篇    下一篇

一种新的可验证多秘密共享方案

贺 军1,李丽娟2,李喜梅1   

  1. (1. 怀化职业技术学院计算机与信息工程系,怀化 418000;2. 湖南大学计算机与通信学院,长沙 410082)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-05-05 发布日期:2009-05-05

Verifiable Multi-secret Sharing Scheme

HE Jun1, LI Li-juan2, LI Xi-mei1   

  1. (1. Department of Computer and Information Engineering, Huaihua Vocational and Technical College, Huaihua 418000;
    (2. School of Computer and Communication, Hunan University, Changsha 410082)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-05-05 Published:2009-05-05

摘要: 基于离散对数的难解性,提出一种可验证多秘密共享方案并分析其安全性。该方案通过一次秘密共享过程实现对多个秘密的并行共享,其秘密份额由参与者选取,可以防止分发者的欺诈,无须设计专用验证算法。该方案适用于不具备安全信道的环境。

关键词: 密码学, 秘密共享, 可验证, Lagrange插值多项式

Abstract: Based on the intractability of the discrete logarithm, this paper proposes a verifiable multi-secret sharing scheme, and analyzes its security. In this scheme, several secrets can be shared during one secret sharing process simultaneously. Each participant chooses the secret share by himself, and the dealer is impossible to be a cheater. It need not to design special verification algorithm. This scheme is valuable in the environments where the security channels are not available.

Key words: cryptography, secret sharing, verifiable, Lagrange interpolation polynomial

中图分类号: