TL;DR
Poplar introduces a lightweight, cryptography-free system for privately identifying popular data items among clients, ensuring privacy even with malicious servers, using novel distributed point functions.
Contribution
The paper presents Poplar, a novel privacy-preserving heavy-hitters protocol that requires only two servers, no public-key cryptography, and introduces incremental distributed point functions.
Findings
Achieves privacy against malicious servers.
Requires only a single message per client.
Does not rely on public-key cryptography.
Abstract
This paper presents Poplar, a new system for solving the private heavy-hitters problem. In this problem, there are many clients and a small set of data-collection servers. Each client holds a private bitstring. The servers want to recover the set of all popular strings, without learning anything else about any client's string. A web-browser vendor, for instance, can use Poplar to figure out which homepages are popular, without learning any user's homepage. We also consider the simpler private subset-histogram problem, in which the servers want to count how many clients hold strings in a particular set without revealing this set to the clients. Poplar uses two data-collection servers and, in a protocol run, each client send sends only a single message to the servers. Poplar protects client privacy against arbitrary misbehavior by one of the servers and our approach requires no…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
