Computationally efficient asynchronous MPC with linear communication and low additive overhead

DOI10.1007/978-3-032-01884-7_9MaRDI QIDQ6863904zbMATH OpenFDO

Authors Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, Yifan Song

Publication date 4 February 2026

zbMATH Keywords

asynchronous complete secret-sharing protocol

Mathematics Subject Classification ID

Cryptography (94A60)

This page was built for publication: Computationally efficient asynchronous MPC with linear communication and low additive overhead

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863904)