Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations

K Bangachev, G Bresler, S Tiegel… - arXiv preprint arXiv …, 2024 - arxiv.org
We present a polynomial-time reduction from solving noisy linear equations over $\mathbb
{Z}/q\mathbb {Z} $ in dimension $\Theta (k\log n/\mathsf {poly}(\log k,\log q,\log\log n)) $ with …

[PDF][PDF] Better, Faster, Stronger

N Melissaris - nikolasmelissaris.github.io
Multiparty computation (MPC) enables parties to collaboratively compute functions on their
inputs while preserving privacy. Evaluation of MPC protocols typically revolves around …