Sign inGet started
Paper · arXiv

TAPAS: Efficient Two-Server Asymmetric Private Aggregation Beyond Prio(+)

Privacy-preserving aggregation is a cornerstone for AI systems that learn from distributed data without exposing individual records, especially in federated learning and telemetry. Existing two-server protocols (e.g., Prio and successors) set a practical baseline by validating inputs while preventing any single party from learning users' values, but they impose symmetric costs on both servers and communication that scales with the per-client input dimension $L$. Modern learning tasks routinely involve dimensionalities $L$ in the tens to hundreds of millions of model parameters. We present TAPAS, a two-server asymmetric private aggregation scheme that addresses these limitations along four...

AuthorsHarish Karthikeyan, Antigoni Polychroniadou
Primary categorycs.CR
Published20 March 2026
Last updated at source20 March 2026
cs.CRcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/cbaa0820-17f2-4f37-b9a4-7d7e3f848c53" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.