High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings

ePrint Report: High-Throughput Secure Multiparty Computation with an Honest Majority in Various Network Settings

Christopher Harth-Kitzerow, Georg Carle

In this work, we present novel protocols over rings for semi-honest secure three-party computation (3-PC) and malicious four-party computation (4-PC) with one corruption. Compared to state-of-the-art protocols in the same setting, our protocols require fewer low-latency and high-bandwidth links between the parties to achieve high throughput. Our protocols also reduce the computational complexity by requiring up to 50 percent fewer basic instructions …

art computation corruption eprint report high malicious network novel party protocols report rings secure multiparty computation semi settings state work