Secure multi-party computation (MPC) lets a group of parties jointly compute a function while keeping their inputs private. A central challenge is minimizing communication overhead, which often dominates performance. In 2007, Damgård and Nielsen introduced a preprocessing approach that achieves linear communication complexity, a significant milestone for practical MPC.
A new arXiv paper, "Big Secrets Small Shares: Revisiting Secure Multi-Party Computation," returns to this line of work. The abstract notes that another approach to reducing communication complexity was proposed by Cramer, though the announcement does not include further details. The paper appears to revisit these strategies, but the abstract does not disclose specific findings.
Readers interested in the full analysis can find the paper on arXiv under identifier 2610.27609.