Private Set Union with Multiple Contributions

NeurIPSSpotlight2025

Authors
Travis Dick, Haim Kaplan, Alex Kulesza, Uri Stemmer, Ziteng Sun, Ananda Theertha Suresh
Venue
NeurIPS 2025
Track
Spotlight

TL;DR

In the private set union problem each user owns a bag of at most $k$ items (from some large universe of items), and we are interested in computing the union of the items in the bags of all of the user…

Opening excerpt from the authors’ abstract. source

Read the paper

← All NeurIPS 2025 Spotlight papers · Browse the whole archive