没有SDC的(t，n)门限秘密共享方案

利用椭圆曲线离散问题对数问题的难解性,给出了基于椭圆曲线密码体制的(t,n)门限秘密共享方案。基于门限秘密共享方案一般分为需要SDC和不需要SDC两类,在分布式环境下,一个被所有成员信任的SDC并不存在,不需要SDC的门限秘密共享方案的安全性得到很大的提高,该方案中由组成员共同生成群公钥和私有密钥。并给出了当新成员加入时,无SDC下的周期密钥分片的更新方案。还给出了一个本方案数据实例,最后对本方案的安全性进行了分析。

(t, n) threshold secret sharing scheme without SDC

By means of the intractability of ellipse curve discrete logarithm problem(ECDLP),a(t,n) secret sharing threshold scheme based on ellipse curve cryptography was proposed.Generally speaking,there are two kinds of threshold schemes: a threshold scheme with share distribution center(SDC) and a threshold scheme without SDC.Under distrib-uted situation,there is no such a center can be completely trusted by all members of the group,a threshold scheme with-out SDC appears more attractive.In the scheme without SDC all of the members generate the group public key and pri-vate keys.When new numbers join the group secret sharing should be updated by period.An example of the scheme us-ing the small number was given.The security of the scheme was analyzed in the final.