Paper 2025/1516

GoSSamer: Lightweight and Linear-Communication Asynchronous (Dynamic Proactive) Secret Sharing and the Applications

Yizhong Liu, Beihang University

Boyang Liao, Beihang University

Jianwei Liu, Beihang University

Bin Hu, Beihang University

Xun Lin, Beihang University

Yuan Lu, A*STAR Institute for Infocomm Research

Tianwei Zhang, Nanyang Technological University

Abstract

Asynchronous complete secret sharing (ACSS) and asynchronous dynamic proactive secret sharing (ADPSS) are fundamental primitives for secret sharing and resharing in modern threshold systems, such as multi-party computation, distributed key management, and blockchain. However, existing ACSS constructions that employ homomorphic commitments incur notable computational overhead, while the lightweight-computation constructions require quadratic per-secret communication, limiting scalability as the number of parties grows. ADPSS constructions inevitably inherit these inefficiencies due to their tight coupling to the commitment-based ACSS and requiring at least quadratic cross-committee communication. To break these bottlenecks, we design GoSSamer, a concretely and asymptotically efficient protocol suite, where both our ACSS and ADPSS achieve (1) lightweight computation with only hash function and symmetric encryption; (2) asymptotically optimal, linear per-secret communication; (3) optimal resilience in asynchronous networks; and (4) post-quantum security. In GoSSamer-ACSS, we propose an original-evaluation propagation paradigm for linear communication without commitment‑requiring interpolation, which further unlocks our lightweight bivariate-polynomial-based degree checking for share verification. Building on this foundation, GoSSamer‑ADPSS contributes two further techniques: a consistency verification technique that decouples the ADPSS framework from the commitment-based ACSS, and a dual-committee reconstruction technique that yields linear per-secret communication. When deployed in distributed AWS instances, GoSSamer-ACSS reduces the runtime by 95.6% compared to the linear-communication scheme hbACSS (NDSS'22) and 45.8% compared to lightweight SS24 (JoC'24). GoSSamer-ADPSS reduces the runtime by at least 67.7% compared to LongLive (Usenix Security'23). Moreover, when applied to practical distributed key management systems, the GoSSamer-ACSS-based distributed key generation is 7-11x faster than DXK+23 (Usenix Security'23), and GoSSamer-ADPSS-based key resharing reaches a throughput of 1994 keys/s across 10-node committees, compared to 85 keys/s in LongLive.

Note: Expand the description of SS24’s faster happy path.

@misc{cryptoeprint:2025/1516,
      author = {Xinxin Xing and Yizhong Liu and Boyang Liao and Jianwei Liu and Bin Hu and Xun Lin and Yuan Lu and Tianwei Zhang},
      title = {{GoSSamer}: Lightweight and Linear-Communication Asynchronous (Dynamic Proactive) Secret Sharing and the Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1516},
      year = {2025},
      doi = {10.1109/SP63933.2026.00185},
      url = {https://eprint.iacr.org/2025/1516}
}