Digital Signatures
summary
A one-round threshold ECDSA protocol claims to remove the hidden roll call by making all pre-signing operations Shamir-threshold (not additive), introducing a modified MtA that works between two Shamir secrets and publishing ai_j values; an implementation exists, pre-signing is slower but online signing matches prior work and it supports any t < n. A separate mode called Merkle tree ladder mode applies condensation and reconstitution to cut PQC signature transfer sizes (condensed signatures ≈472 bytes in examples), with real DNS traces showing verifiers reuse ladders hundreds of times and ≤29 new reference updates/day.
AI-written summary · about
chapters (15)
- 0:00Introduction to threshold ECDSA
- 8:56State of the art in threshold ECDSA
- 13:14Preliminaries: math and protocols
- 16:22Gennaro and Goldfeder protocol
- 18:06Our non-interactive protocol
- 20:59Protocol benefits and benchmarks
- 21:44Q&A on threshold ECDSA
- 23:53Introduction to post-quantum signatures
- 27:00Merkle tree ladder concept
- 31:19Merkle tree ladder mode
- 33:05Condensation and reconstitution
- 35:13Security analysis
- 37:23Practical impact on DNS
- 42:26Call to action and future work
- 45:13Q&A on post-quantum signatures
