Paper compares seven asynchronous secret-sharing protocols in one Rust stack
Original title: Asynchronous Verifiable and Complete Secret Sharing: From Design Patterns to System-Level Trade-offs
Grid'5000 runs show message complexity poorly predicts latency and that recovery can dominate optimistic paths.
A cs.CR paper analyzes asynchronous verifiable and complete secret sharing as a design space rather than protocol by protocol. The authors select seven representative protocols, implement them in a common Rust framework, and stress honest-dealer and faulty-dealer cases on Grid'5000. They report latency, throughput, message count, bandwidth, and aggregate CPU time, and argue batching or packing helps only when verification stays off the critical path.
- Seven protocols were implemented in one Rust framework for comparison.
- Tests cover honest-dealer and faulty-dealer executions on Grid'5000.
- Metrics include latency, throughput, messages, bandwidth, and CPU time.
- Batching helps only when verification is off the critical path.
From the original article
1 min read at arxiv.orgModern secret sharing protocols promise robust secret sharing in fully asynchronous Byzantine systems, but their practical costs remain difficult to compare across papers, assumptions, and workloads. The difficulty is not merely experimental: protocols with similar asymptotic guarantees often place very different work on the critical path through their choices of dissemination, verification, batching, and recovery.
By Joachim Bruneau-Queyreix · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.