Research

Adi Shamir quote: “In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. Key Words and Phrases: cryptography, key management, interpolation”

This foundational article defines the concept of zero-knowledge proof (ZKP): a cryptographic approach that allows one validating party, called ”the prover” to verify a claim made by another party without the prover disclosing any supporting information. This will allow to control that partial secrets exchanged between the parties do respect the protocol specifications.

Yehuda Lindell quote: “In this paper, we present the first truly practical full threshold ECDSA signing protocol that has both fast signing and fast key distribution. This solves a years-old open problem, and opens the door to practical uses of threshold ECDSA signing that are in demand today. There is growing practical interest in such solutions, but prior to our work these could not be deployed today due to the need for distributed key generation.”

Alongside the Lindell, Noff and Rannelucci article, the Gennaro/Goldfeder algorithm is the most advanced research work to solve multiparty ECDSA. Our Research work uses several key elements demonstrated in both papers. A threshold signature scheme enables distributed signing among n players such. Rosario Gennaro quote: “While there exist previous threshold schemes for the ECDSA signature scheme, we present the first protocol that supports multiparty signatures for any t ≤ n with efficient, dealerless key generation. Our protocol is faster than previous solutions and significantly reduces the communication complexity as well.”