Abstract. In this talk, we will present a new protocol for two-party ECDSA signing that simultaneously achieves the best concrete computation and bandwidth efficiency relative to prior work, without compromising on round complexity. On a conceptual level, our protocol only makes blackbox use of generic cryptography—Oblivious Transfer during setup and Pseudorandom Functions when signing—and is asymptotically optimal in communication (linear in the security parameter). The technical insights that underlie our protocol are a Pseudorandom Correlation Function for Vector Oblivious Linear Evaluation over a large ring, and a generalization of proof techniques from previous work.
Presented by Yashvant Kondi. Suggested reading: Two-party ECDSA Signing at Constant Communication Overhead (ia.cr/2025/1813)
Presented at MPTS 2026: NIST Workshop on Multi-Party Threshold Schemes
MPTS 2026: NIST Workshop on Multi-Party Threshold Schemes 2026
Starts: January 26, 2026Security and Privacy: cryptography