Lightweight Techniques for Private Heavy Hitters

@article{Boneh2021LightweightTF,
  title={Lightweight Techniques for Private Heavy Hitters},
  author={Dan Boneh and Elette Boyle and Henry Corrigan-Gibbs and Niv Gilboa and Yuval Ishai},
  journal={2021 IEEE Symposium on Security and Privacy (SP)},
  year={2021},
  pages={762-776}
}
  • D. Boneh, Elette Boyle, Y. Ishai
  • Published 29 December 2020
  • Computer Science, Mathematics
  • 2021 IEEE Symposium on Security and Privacy (SP)
This paper presents a new protocol 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 our protocol to figure out which homepages are popular, without learning any user’s homepage. We also consider the simpler private… 

Figures and Tables from this paper

GPU-accelerated PIR with Client-Independent Preprocessing for Large-Scale Applications
TLDR
This work introduces Client-Independent Preprocessing (CIP) PIR that moves n−1 n of the online computation to a local preprocessing phase suitable for efficient batch precomputations and is the first multiserver PIR scheme that is accelerated by GPUs.
Aggregate Measurement via Oblivious Shuffling
TLDR
A secure histogram aggregates method which is suitable for many applications such as ad conversion measurements and guarantees differentially private histogram outputs is introduced.
Private Approximate Nearest Neighbor Search with Sublinear Communication
TLDR
This paper presents the first lightweight protocol for private nearest neighbor search, instantiated using two non-colluding servers, each holding a replica of the database and implements its protocol and reports its performance on real-world data.
Spectrum: High-bandwidth Anonymous Broadcast
We present Spectrum, a high-bandwidth, metadata-private file broadcasting system. In Spectrum, a small number of broadcasters share a file with many subscribers via two or more non-colluding
Experimenting with Collaborative zk-SNARKs: Zero-Knowledge Proofs for Distributed Secrets
TLDR
The proof generation algorithm in pairing-based zkSNarks is optimized so that algebraic techniques for multiparty computation (MPC) yield efficient proof generation protocols, which suggests MPC “friendliness” as an additional criterion for evaluating zk-SNARKs.
Lightweight Private Similarity Search
TLDR
This paper presents the first lightweight protocol for private nearest neighbor search, instantiated using two non-colluding servers, each holding a replica of the database and supports an arbitrary number of clients simultaneously querying the database via these servers.
Lightweight, Maliciously Secure Verifiable Function Secret Sharing
TLDR
This work presents a lightweight construction of verifiable two-party function secret sharing (FSS) for point functions and multi-point functions and is the first DPF veri-cation protocol that can verify general DPFs while remaining secure even if one server is malicious.
Lightweight, Verifiable Function Secret Sharing and its Applications
In this work, we present a lightweight construction of verifiable two-party function secret sharing (FSS) for point functions and multi-point functions. We use these verifiable FSS schemes to
Masked LARk: Masked Learning, Aggregation and Reporting worKflow
TLDR
A secure multi-party compute (MPC) protocol that utilizes ”helper” parties to train models, so that once data leaves the browser, no downstream system can individually construct a complete picture of the user activity.
Practical and Light-weight Secure Aggregation for Federated Submodel Learning
TLDR
This work uses Distributed Point Function (DPF) and cuckoo hashing to construct a practical and light-weight secure FSL scheme in the two-server setting and proposes two basic protocols with few optimisation techniques, which ensures the protocol practicality on specific real-world FSL tasks.
...
1
2
...

References

SHOWING 1-10 OF 54 REFERENCES
Efficient Private Statistics with Succinct Sketches
TLDR
This paper builds on efficient cryptographic protocols for private aggregation and on data structures for succinct data representation, namely, Count-Min Sketch and Count Sketch, to reduce the communication and computation complexity incurred by each data source.
An improved data stream summary: the count-min sketch and its applications
Practical Locally Private Heavy Hitters
TLDR
This work presents new practical local differentially private heavy hitters algorithms achieving optimal or near-optimal worst-case error and running time -- TreeHist and Bitstogram and implemented Algorithm TreeHist to verify the theoretical analysis.
Software protection and simulation on oblivious RAMs
TLDR
This paper shows how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time, and shows that a logarithmic slowdown is a lower bound.
Function Secret Sharing: Improvements and Extensions
TLDR
Efficient protocols for verifying that keys (k*/1,...,k*/m ), obtained from a potentially malicious user, are consistent with some f in F are presented, critical for applications that involve private writing or voting by many users.
Express: Lowering the Cost of Metadata-hiding Communication with Cryptographic Privacy
TLDR
Improvements in communication and computation enable Express to increase message throughput, reduce latency, and consume over 100x less bandwidth than Pung and Riposte, dropping the end to end cost of running a realistic whistleblowing application by 6x.
Prio: Private, Robust, and Scalable Computation of Aggregate Statistics
TLDR
Pozo is presented, a privacy-preserving system for the collection of aggregate statistics that uses secret-shared non-interactive proofs (SNIPs), a new cryptographic technique that yields a hundred-fold performance improvement over conventional zero-knowledge approaches.
Riposte: An Anonymous Messaging System Handling Millions of Users
TLDR
Riposte is the first such system, to the authors' knowledge, that simultaneously protects against traffic-analysis attacks, prevents anonymous denial-of-service by malicious clients, and scales to million-user anonymity sets.
Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast
TLDR
Blinder is presented, the first system that provides a scalable and fully robust solution for anonymous committed broadcast and maintains both properties of security (anonymity) and robustness (aka. ‘guaranteed output delivery’ or ‘availability’) in the face of a global active (malicious) adversary.
Private Summation in the Multi-Message Shuffle Model
TLDR
Two new protocols for summation in the shuffle model with improved accuracy and communication trade-offs are introduced, including a recursive construction based on the protocol from Balle et al. mentioned above and a novel analysis of the reduction from secure summation to shuffling introduced by Ishai etAl.
...
1
2
3
4
5
...