Reproduce “The Capacity of Interactive Secure Summation” 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

Hua Sun

The paper characterizes communication and randomness rates for secure summation with private inputs and one destination. It uses independent local randomness and interactive messages over pairwise secure links, without prearranged correlated randomness. For K=5,T=2, minimum communication is 20/3 symbols per sum symbol, achieved by a linear scheme and optimal even against interactive, nonlinear protocols. The rates are model-specific, not runtime results.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.