Back to Search Start Over

Fast two-party signature for upgrading ECDSA to two-party scenario easily.

Authors :
Tu, Binbin
Chen, Yu
Cui, Hongrui
Wang, Xianfang
Source :
Theoretical Computer Science. Feb2024, Vol. 986, pN.PAG-N.PAG. 1p.
Publication Year :
2024

Abstract

ECDSA is a standardized signature scheme and is widely used in many fields. However, most two-party ECDSA require a complicated multi-party computation technique to compute the multiplication of many shared secrets and necessitate expensive zero-knowledge proofs to deal with malicious adversaries. In this paper, we propose a simple yet fast two-party signing protocol based on ECDSA security, whose signing operation of each party is similar to the original ECDSA signing algorithm. Our protocol can enjoy the same efficiency as ECDSA and upgrades the existing ECDSA application to two-party scenario friendly. For this purpose, we first introduce a variant of ECDSA called combinatorial ECDSA, which is as secure as the standard ECDSA and can be easily divided into two parts. Then, we devise a two-party signing protocol without complicated multi-party computation from the combinatorial ECDSA and give the security proof based on ECDSA. Compared with the state-of-the-art two-party ECDSA, the signing result of each party in our protocol maintains the structure of ECDSA signature, which can be verified easily and avoids expensive zero-knowledge proofs. Last, we conduct an experimental evaluation, demonstrating that the performance of our combinatorial ECDSA and two-party signature is similar to ECDSA and the experimental results show that our proposed schemes are practical. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*MULTIPLICATION
*ALGORITHMS

Details

Language :
English
ISSN :
03043975
Volume :
986
Database :
Academic Search Index
Journal :
Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
174788251
Full Text :
https://doi.org/10.1016/j.tcs.2023.114325