Optimal Resilience Asynchronous Secret Sharing with Linear Communication
Researchers introduce a new Asynchronous Verifiable Secret Sharing protocol, achieving linear communication complexity with optimal Byzantine resilience, foundational for scalable, trust-minimized computation.
