Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody

Secure multiparty computation

“…Recently, there has been a lot of interest in threshold ECDSA due to its applications to protecting cryptocurrencies. 14,17,26,27 Dishonest-majority MPC. Previously, we described a general protocol for MPC that is secure as long as an adversary cannot corrupt more than a minority of the parties.…”

Distributed signing protocol for IEEE P1363‐compliant identity‐based signature scheme

“…While this design is more efficient than previous ones, it requires significantly higher transmission bandwidth. To generalise their approaches to the multi-party setting, Lindell and Nof [29] extended their prior work and constructed a full-threshold protocol for multi-party ECDSA, where the private key is additively shared instead of multiplicatively. Thus, their private multiplication protocol on secret shares could be based on both Paillier and Oblivious Transfer [34] for various application scenarios.…”

“…For ECDSA, the first two-party setting was addressed by MacKenzie and Reiter [26]. Since then, a number of two-party protocols have also been presented in the literature [27,28], and extended multi-party version [29,30].…”

Contingent Payments on a Public Ledger: Models and Reductions for Automated Verification

“…To link ledger transitions and data release, [15] exploits algebraic properties of the ECDSA signature used in Bitcoin: relying on homomorphic encryption, e.g. Paillier, an encrypted signature can be constructed from an encryption of the signing key, which can be constructed by adding shares of the signing key on top of an initial encrypted share [36][37][38][39]. A Diffie-Hellman group is used to establish a shared key.…”