椭圆曲线上的可验证多秘密共享方案

摘要

基于椭网曲线提出一个可验证的多秘密共享方案.在该方案中每个参与者自己选择秘密份额,不需要安全信道,并且该方案是一个多次使用的方案,在一次加密过程中可以共享多个秘密.该方案的安全性基于椭圆曲线上RSA密码体制的安全性及椭圆曲线上离散对数问题的困难性.%This paper presents a verifiable multi-secret sharing scheme based on elliptic curves. In the scheme each participant chooses her/his shadow by her/himself, so the system does not need a secure channel. It is a multi-use scheme, which can share several secrets in one secret sharing process. The security of the proposed scheme is based on the security of the Elliptic Curve RSA cryptosystem(ECRSA) and the intractability of the Elliptic Curve Discrete Logarithm Problem(ECDLP).