Preprint
Oct 2026
Asynchronous Verifiable and Complete Secret Sharing: From Design Patterns to System-Level Trade-offs
The results show that message complexity alone poorly predicts latency, that optimistic paths can be dominated by recovery cost, and that batching or packing helps only when verification stays off the critical path.
Joachim Bruneau-Queyreix, Martin Zivojinovic, Léo Mendiboure et al.
· 0 citations