Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience

Ying Cai; Chengyi Qin; Mingqiang Wang

Paper 2025/649

Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience

Ying Cai, School of Mathematics, Shandong University, Jinan, 250100, China

Chengyi Qin, School of Mathematics, Shandong University, Jinan, 250100, China

Mingqiang Wang, State Key Laboratory of Cryptography and Digital Economy Security, Shandong University, Jinan, 250100, China

Abstract

Asynchronous Complete Secret Sharing (ACSS) is a foundational module for asynchronous networks, playing a critical role in cryptography. It is essential for Asynchronous Secure Multi-Party Computation (AMPC) and, with termination, is widely applied in Validated Asynchronous Byzantine Agreement (VABA) and Asynchronous Distributed Key Generation (ADKG) to support secure distributed systems. Currently, there are relatively few statistical secure ACSS protocols that can guarantee termination, and their communication complexity is relatively high. To reduce communication complexity, we propose a new multi-receiver signature scheme, ARICP, which supports linear operations on signatures. Leveraging the ARICP scheme and the properties of symmetric polynomials, we propose an ACSS protocol that ensures termination and optimal resilience () with ) bits per sharing. Compared with the best-known result of ACSS protocols that guarantee termination [CP23], the amortized communication complexity of our protocol is reduced by a factor of .

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Minor revision. The 30th Australasian Conference on Information Security and Privacy (ACISP 2025)
Keywords: Asynchronous Complete Secret Sharing Termination Optimal Resilience.
Contact author(s): caiying011 @ 163 com
QCY521111 @ 163 com
wangmingqiang @ sdu edu cn
History: 2025-04-13: approved; 2025-04-09: received; See all versions
Short URL: https://ia.cr/2025/649
License: CC BY

BibTeX

@misc{cryptoeprint:2025/649,
      author = {Ying Cai and Chengyi Qin and Mingqiang Wang},
      title = {Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/649},
      year = {2025},
      url = {https://eprint.iacr.org/2025/649}
}