Threshold-optimal ECDSA signature and its applications
Considering the high interaction and computational complexity of current elliptic curve digital signature algorithm threshold signature algorithms,this paper proposes a kind of high-efficiency threshold-optimal ECDSA signature algorithm.By introducing a preprocessing phase,a set of basic data can be generated through Feldman verifiable secret sharing and level-1 homomorphic encryption at each node,and such data can be used in the mul-tiplication and inversion operations of the signature phase for lowering the polynomial order and ensuring threshold optimality.The whole protocol simply requires four rounds of interaction to generate a valid signature.The results show that,with the threshold value increasing from 4 to 20,the algorithm can generate a signature within 1.232～19.66 s.After the precomputation stage is introduced,the computational efficiency can be improved to 0.667～4.559 s.In a secure environment,the single signature generation speed can reach millisecond levels,which can be effectively applied to blockchain account security protection and cross-chain asset locking.The algorithm has practi-cal application value.
万方数据
维普
