Paper 2024/1717
Practical Asynchronous MPC from Lightweight Cryptography
Abstract
We present an asynchronous secure multi-party computation (MPC) protocol that is practically efficient. Our protocol can evaluate any arithmetic circuit with linear communication in the number of parties per multiplication gate, while relying solely on computationally lightweight cryptography such as hash function and symmetric encryption. Our protocol is optimally resilient and tolerates $t$ malicious parties among $n = 3t+1$ parties. At the technical level, we manage to apply the \emph{player-elimination} paradigm to asynchronous MPC. This framework enables the detection and eviction of cheating parties by repeatedly attempting to generate Beaver triples. Once all malicious parties are eliminated, honest parties can proceed with efficient Beaver triple generation. While this approach is standard in synchronous MPC, it presents several technical challenges when adopted in an asynchronous network, which we address in this work.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- MPCAsynchronous
- Contact author(s)
- atsuki momose @ gmail com
- History
- 2024-10-21: approved
- 2024-10-21: received
- See all versions
- Short URL
- https://ia.cr/2024/1717
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1717,
author = {Atsuki Momose},
title = {Practical Asynchronous {MPC} from Lightweight Cryptography},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1717},
year = {2024},
url = {https://eprint.iacr.org/2024/1717}
}