International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience

Authors:
Vipul Goyal , NTT Research
Chen-Da Liu-Zhang , Luzern University of Applied Sciences and Arts & Web3 Foundation
Yifan Song , Tsinghua University and Shanghai Qi Zhi Institute
Download:
DOI: 10.1007/978-3-031-68397-8_6 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2024
Abstract: Secure multi-party computation (MPC) allows a set of $n$ parties to jointly compute a function over their private inputs. The seminal works of Ben-Or, Canetti and Goldreich [STOC'93] and Ben-Or, Kelmer and Rabin [PODC'94] settled the feasibility of MPC over asynchronous networks. Despite the significant line of work devoted to improving the communication complexity, current protocols with information-theoretic security and optimal resilience $t
BibTeX
@inproceedings{crypto-2024-34154,
  title={Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-68397-8_6},
  author={Vipul Goyal and Chen-Da Liu-Zhang and Yifan Song},
  year=2024
}