Asynchronous DKG with O(n²) communication and O(1) time from plain PKI

The new distributed key generation protocol improves previous async DKG tradeoffs without requiring a silent setup

Asynchronous DKG with O(n^2) communication and O(1) time, assuming only a plain PKI setup With Renas Bacho and Gilad Stern: https:// eprint.iacr.org/2026/1159 Previously, async DKG required either O(k) time and O(n^{2+1/k}) communicati
Ranked #5 on backlist 2026-06-10 (10 Jun 2026 UTC) · by (Ittai Abraham) ·

How it ranks: Backlist reads my Twitter/X timeline, scores every tweet for substance with an LLM rubric (not engagement), and publishes the daily top picks with a one-line takeaway. Curated by Surya Dantuluri.