Communication Efficient Semi-Honest Three-Party Secure Multiparty Computation with an Honest Majority. (arXiv:2206.03776v1 [cs.CR])

In this work, we propose a novel protocol for secure three-party computation
with an honest majority. For each AND gate, our protocol requires only two bits
of communication in the online phase and two bits of communication in the
offline phase. Also, only P2 and P3 are involved in the online phase. Our
protocol is simulation-based secure in the presence of semi-honest adversaries,
and achieves privacy but not correctness in the presence of malicious
adversaries. The best previously known construction …

communication computation party