Threshold ECDSA in 3 rounds

Abhi Shelat (Northeastern) identifies a specific rewriting of the ECDSA signing equation and a method to compute and verify it that lends itself to the minimal MPC protocols for distributed key generation and threshold signing. This method for signing is constructed using only idealized commitments and multiplication, and can be instantiated under many different assumptions, yielding different time/bandwidth tradeoffs. Abhi constructs 3 or 2 round signing protocols (with pre-processing) that run in milliseconds, thus eliminating long standing bottlenecks in round complexity for this problem without incurring additional costs elsewhere. This is joint work with Jack Doerner, Yash Kondi, Eysa Lee.

About the presenter

Abhi is a professor at Northeastern University and pseudo-engineer at Google whose demeanor has often led students to confuse him with that other famous Indian comedian who is Master of None.

About a16z crypto research

a16z crypto research is a multidisciplinary lab that works closely with our portfolio companies and others toward solving the important problems in the space, and toward advancing the science and technology of the next generation of the internet.

More about us:

a16z.com/2022/04/21/announcing-a16z-crypto-research More from the a16z crypto team – Subscribe to our ‘web3 weekly newsletter’: a16zcrypto.substack.com – Listen to our ‘web3 with a16z’ podcast: a16zcrypto.com/web3-with-a16z-podcast/ – Read more of our work: a16zcrypto.com