论文部分内容阅读
ECDSA需要计算有限域上的逆元,而求逆元的运算复杂而费时,且在该方案中密钥分割和合成都是很困难的,所以不能直接运用于门限签名。文中在一种改进的椭圆曲线数字签名算法的基础上,采用Pedersen可验证门限秘密共享技术,构造了一种基于ECC的(t,n)可验证门限数字签名方案,并分析了它的安全性。该方案具有鲁棒性、通信代价更小、执行效率更高等特点。
ECDSA needs to calculate the inverse element in the finite field, and the computation of the inverse element is complicated and time-consuming. In this scheme, the key segmentation and synthesis are both difficult and can not be directly applied to the threshold signature. Based on an improved elliptic curve digital signature algorithm, this paper uses Pedersen verifiable threshold secret sharing technique to construct an (t, n) verifiable threshold digital signature scheme based on ECC, and analyzes its security . The scheme has the characteristics of robustness, smaller communication cost and higher efficiency.