Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (8): 90-92.

Previous Articles     Next Articles

Secret sharing scheme based on elliptic curve

ZHANG Yong, ZHANG Huan   

  1. School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China
  • Online:2014-04-15 Published:2014-05-30

基于椭圆曲线的密钥共享方案

张  永,张  欢   

  1. 兰州理工大学 计算机与通信学院,兰州 730050

Abstract: In order to resolve the key distributor and participants cheating problem in the secret sharing scheme, a multi-key sharing scheme which based on the elliptic curve cryptosystem and the cheaters can be detected is presented. The key distribution cheat and participants cheat can effectively be prevented, and the master key can be renewed without renewing the sub-keys of the participants. The scheme can increase a new participant and reduce a participant freely. The security of the new scheme is based on Shamir’s threshold scheme and the elliptic curve discrete logarithm problem.

Key words: master key, sub-key, secret sharing scheme, elliptic curve discrete logarithm problem

摘要: 针对门限密钥共享体制中存在的密钥分发者欺诈和参与者欺诈问题,采用椭圆曲线密码体制(ECC),提出一种可防欺诈的多密钥共享方案。该方案可以阻止密钥分发者、参与者的欺诈问题,且能实现更新主密钥时无需更改参与者的子密钥。方案可以灵活地增加或减少参与者,其安全性基于Shamir门限机制和椭圆曲线离散对数难题。

关键词: 主密钥, 子密钥, 密钥共享, 椭圆曲线离散对数难题