386 citations · 795 across the 50 of their papers we have counts for
59 papers
BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height
Ergute Bao, Graham Cormode, Xiaokui Xiao +1
Finding heavy nodes in a tree---those whose counts exceed a given threshold---is a building block for analysis and learning over structured data. Achieving record-level differentia…
PrivLava: Synthesizing Relational Data with Foreign Keys under Differential Privacy
Kuntai Cai, Xiaokui Xiao, Graham Cormode
Answering database queries while preserving privacy is an important problem that has attracted considerable research attention in recent years. A canonical approach to this problem…
Sketch-Flip-Merge: Mergeable Sketches for Private Distinct Counting
Jonathan Hehir, Daniel Ting, Graham Cormode
Data sketching is a critical tool for distinct counting, enabling multisets to be represented by compact summaries that admit fast cardinality estimates. Because sketches may be me…
Pruning Compact ConvNets for Efficient Inference
Sayan Ghosh, Karthik Prasad, Xiaoliang Dai +4
Neural network pruning is frequently used to compress over-parameterized networks by large amounts, while incurring only marginal drops in generalization performance. However, the…
Streaming Zero-Knowledge Proofs
Graham Cormode, Marcel Dall'Agnol, Tom Gur +1
Streaming interactive proofs (SIPs) enable a space-bounded algorithm with one-pass access to a massive stream of data to verify a computation that requires large space, by communic…
The communication cost of security and privacy in federated frequency estimation
Wei-Ning Chen, Ayfer Özgür, Graham Cormode +1
We consider the federated frequency estimation problem, where each user holds a private item from a size- domain and a server aims to estimate the empirical frequency (i.e…