FME uses hashing plus multiple encryption to filter out unpopular items and run a noise-free-user shuffle protocol over a large domain in one round.
What can we learn privately?
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Augmented Shuffle Differential Privacy Protocols for Large-Domain Categorical and Key-Value Data
FME uses hashing plus multiple encryption to filter out unpopular items and run a noise-free-user shuffle protocol over a large domain in one round.