Threshold ECDSA from ECDSA Assumptions - The Multiparty Case
Explore a groundbreaking conference talk on extending threshold ECDSA protocols to support arbitrary thresholds. Delve into the innovative approach that improves upon previous works by requiring only the Computational Diffie-Hellman assumption in the Random Oracle model. Discover how this new scheme achieves a logarithmic round count, outperforming constant-round protocols in practical scenarios. Learn about the novel consistency check mechanism and optimized two-party multiplication protocol that contribute to the scheme's efficiency. Examine the implementation results across various settings, including groups of co-located and geographically-distributed parties, as well as embedded devices. Gain insights into the protocol's superior performance in LAN environments and its practical applicability on smartphones and hardware tokens.