Reproduce “On the (Quantum) Communication Complexity of Secure MPC from a Random Oracle” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Alexander Hoover, Giuseppe Persiano, Kevin Yeo
The authors present an MPC protocol for degree-2 computations that uses a random oracle to expand short seeds into pads, letting paired parties exchange masked inputs. For a paired inner-product task, it communicates nℓ field elements plus lower-order terms when n=O(log λ), versus an Ω(nℓt/s) statistical lower bound; communication remains linear, and the result is restricted to degree-2 circuits.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.