Welcome to the resource topic for 2024/1666
Title:
Concretely Efficient Asynchronous MPC from Lightweight Cryptography
Authors: Akhil Bandarupalli, Xiaoyu Ji, Aniket Kate, Chen-Da Liu-Zhang, Yifan Song
Abstract:We consider the setting of asynchronous multi-party computation (AMPC) with optimal resilience n=3t+1 and linear communication complexity, and employ only ``lightweight’’ cryptographic primitives, such as random oracle hash.
In this model, we introduce two concretely efficient AMPC protocols for a circuit with |C| multiplication gates: a protocol achieving fairness with \mathcal{O}(|C|\cdot n + n^3) field elements of communication, and a protocol achieving guaranteed output delivery with \mathcal{O}(|C|\cdot n + n^5) field elements.
These protocols significantly improve upon the best prior AMPC protocol in this regime communicating \mathcal{O}(|C|\cdot n + n^{14}) elements. To achieve this, we introduce novel variants of asynchronous complete secret sharing (ACSS) protocols with linear communication in the number of sharings, providing different abort properties.
ePrint: https://eprint.iacr.org/2024/1666
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .