摘要
针对有限个秘密要分享的情况,提出了一种具有指派功能秘密共享方案的新实现方法。为了说明这一方法,给出了两个实现方案:第一个方案通过引入碎片向量的概念来实现;第二个方案通过引入秘密偏移量的概念来对第一个方案进行优化,能够达到对分享着资源的充分利用。和以往的方案相比,这些方案要求更低的通讯和计算成本;且更加合理和容易实施。
A new method to the secret sharing scheme with the function of assignment was proposed, in which the circumstance of finite secrets to share was considered. To demonstrate this method, two schemes are provided. The first scheme is realized by introducing a concept of ＂share vector＂, the second scheme ameliorates the first scheme by introducing the concept of ＂secret shift＂, in which the resource of shareholders is fully used. In contrast with the early one, these schemes require less cost of communication and computation.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第3期111-112,116,共3页
Microelectronics & Computer
基金
华北电力大学青年教师基金项目(200521001)
关键词
密码学
门限秘密共享
指派方案
碎片向量
cryptography
threshold secret sharing
assignment scheme
share vector
