摘要
基于有限域上椭圆曲线离散对数难解性,提出了无可信方的(t,n)门限签名方案和可验证的密钥协商方案。利用一个改进的椭圆曲线签名方程,我们得到一个从计算和安全上都比现有的椭圆曲线数字签名算法(ECDSA)更高效的签名方案。此方案具有更短的密钥,更快的计算和更好的安全性。
Based on the difficulty of solving the ECDLP（elliptic curve discrete logarithm problem）on the finite field, presenting the（ t, n ）threshold signature scheme and giving verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA（ elliptic curve digital signature algorithm） from the computability and security view. Our scheme has a shorter key, faster computation, and better security.
出处
《信号处理》
CSCD
北大核心
2006年第2期189-192,共4页
Journal of Signal Processing
关键词
门限方案
数字签名
椭圆曲线离散对数
门限签名体制
threshold scheme
digital signature
elliptic curve discrete logarithm
threshold signature
