摘要
在传统的(t,n)门限秘密共享方案中,t个或更多的诚实参与者能重构秘密K.在重构中,每个秘密分块和秘密K被揭示了,因此K仅仅能被共享一次.文中首先给出防泄露秘密共享方案的定义(该方案由一个分配协议和证明协议构成),然后分别构造了计算上安全的和信息理论上安全的防泄露的秘密共享协议.在我们的协议中,t个或更多的诚实参与者使用了一个知识的多证明者论证系统联合证明他们拥有秘密K,因此秘密K能被多次共享,而且,每个参与者在分配协议中能识别庄家的欺骗,在证明协议中能识别非授权参与者集合的欺骗.我们给出了一个应用实例,即使用我们的防泄露秘密共享方案去构造了一个具有零知识性质的群身份认证协议.
In a traditional （t, n）-threshold secret sharing scheme, t or more honest participants can reconstruct the secret K. In the reconstruction process, the individual shares and the secret key K are revealed, hence K is shared once only. In this paper, we firstly give the definition of leakproof secret sharing scheme which is composed of a distribution protocol and a proof protocol, then propose two leakproof secret sharing protocols, a computationally secure protocol and an information-theoretically secure protocol. In our protocols, t or more participants can jointly prove that they hold the secret K by using a multi-prover zero-knowledge argument of knowledge. As a result, the secret K will be shared for as many times as desired. Furthermore, each participant can detect the dealer in the distribution protocol from cheating, and any verifier can prevent non-qualified set of participants in proof protocol from cheating. As an example of the practical impact of our work we use our techniques to construct group identification schemes with zero-knowledge.
出处
《中国科学：信息科学》
CSCD
2012年第5期634-647,共14页
Scientia Sinica(Informationis)
基金
国家自然科学基金(批准号:10871222)
美国国家自然科学基金(批准号:DMS-0302549)
山东大学教育部密码技术与信息安全重点实验室开放课题资助项目
关键词
秘密共享
防泄露秘密共享
多证明者零知识论证
知识证明
群身份认证协议
secret sharing, leakproof secret sharing, multi-prover zero-knowledge argument, proof of knowledgegroup identification scheme
