摘要
基于离散对数的难解性,提出一种可验证多秘密共享方案并分析其安全性。该方案通过一次秘密共享过程实现对多个秘密的并行共享,其秘密份额由参与者选取,可以防止分发者的欺诈,无须设计专用验证算法。该方案适用于不具备安全信道的环境。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第9期119-120,共2页
Computer Engineering