Paper 2025/2135

Robust Elections and More: Fast MPC in the Preprocessing Model

Charanjit S. Jutla, IBM Research - Thomas J. Watson Research Center
Nathan Manohar, IBM Research - Thomas J. Watson Research Center
Arnab Roy, Mysten Labs
Abstract

In this paper, we present an MPC protocol in the preprocessing model with essentially the same concrete online communication and rounds as the state-of-the-art MPC protocols such as online-BGW (with precomputed Beaver tuples) for $t < n/3$ malicious corruptions. However, our protocol additionally guarantees robustness and correctness against up to $t < n/2$ malicious corruptions while the privacy threshold remains at $n/3$. This is particularly useful in settings (e.g. commodity/stock market auctions, national elections) where it is paramount that the correct outcome is certified, while maintaining the best possible fast-tracked online speed. In addition, this honest-majority correctness allows us to use optimistic Berlekamp-Welch decoding in contrast to BGW. Moreover, just like online-BGW, our protocol is responsive until a final attestation phase. We also give a complementary verifiable input-sharing scheme for the multi-client distributed-server setting which satisfies both robustness and correctness against up to $t < n/2$ malicious servers. This is accomplished by having the servers first run a preprocessing phase that does not involve the clients. The novelty of this input-sharing scheme is that a client only interacts for one round, and hence need not be online, which, again, is highly desirable in applications such as elections/auctions. We prove our results in the universally-composable model with statistical security against static corruptions. Our protocol is achieved by combining global authenticators of SPDZ with an augmented Reed-Solomon code in a novel manner. This augmented code enables honest-majority decoding of degree $n/2$ Reed-Solomon codes. Our particular augmentation (often referred to as robust sharing) has the additional property that the preprocessing phase can generate this augmented sharing with a factor $n$ speedup over prior information-theoretic robust sharing schemes.

Note: A new way to handle extra-robustness. Fixed a minor typo.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
MPCBGWOffline-OnlineResponsive ProtocolRobust
Contact author(s)
csjutla @ us ibm com
nmanohar @ ibm com
arnab @ mystenlabs com
History
2026-02-16: last of 2 revisions
2025-11-21: received
See all versions
Short URL
https://ia.cr/2025/2135
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/2135,
      author = {Charanjit S. Jutla and Nathan Manohar and Arnab Roy},
      title = {Robust Elections and More: Fast {MPC} in the Preprocessing Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/2135},
      year = {2025},
      url = {https://eprint.iacr.org/2025/2135}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.