Fast Multiparty Threshold ECDSA with Fast Trustless Setup
Offered By: Association for Computing Machinery (ACM) via YouTube
Course Description
Overview
Explore a groundbreaking protocol for multiparty threshold ECDSA signatures in this 22-minute conference talk. Delve into the advantages of splitting keys, the Digital Signature Algorithm, and threshold optimality. Learn about the innovative approach that supports any $t łeq n$ configuration with an efficient dealerless key generation, offering faster performance and reduced communication complexity compared to previous solutions. Examine key aspects such as signature failure prevention, range proofs, and additive key generation. Gain insights into the implementation details and understand how this protocol advances the field of threshold cryptography.
Syllabus
Introduction
Threshold signatures
Advantages of splitting keys
Digital Signature Algorithm
Threshold Optimality
McKenzie and Ryder
Previous work
Signature failure
Range proof
No background
Multiple people additive
Key generation
Implementation
Taught by
Association for Computing Machinery (ACM)
Related Courses
Applied CryptographyUniversity of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera