Ranking Differential Privacy
Shirong Xu, Will Wei Sun, Guang Cheng

TL;DR
This paper introduces a new concept called epsilon-ranking differential privacy to protect ranking data, develops a multistage algorithm for generating private synthetic rankings, and analyzes its utility and privacy trade-offs through theoretical and empirical studies.
Contribution
It proposes epsilon-ranking differential privacy, connects it with the Mallows model, and develops a multistage ranking algorithm with theoretical utility guarantees.
Findings
The synthetic rankings preserve utility in downstream tasks.
Privacy parameter epsilon influences estimation accuracy.
The algorithm effectively balances privacy and utility.
Abstract
Rankings are widely collected in various real-life scenarios, leading to the leakage of personal information such as users' preferences on videos or news. To protect rankings, existing works mainly develop privacy protection on a single ranking within a set of ranking or pairwise comparisons of a ranking under the -differential privacy. This paper proposes a novel notion called -ranking differential privacy for protecting ranks. We establish the connection between the Mallows model (Mallows, 1957) and the proposed -ranking differential privacy. This allows us to develop a multistage ranking algorithm to generate synthetic rankings while satisfying the developed -ranking differential privacy. Theoretical results regarding the utility of synthetic rankings in the downstream tasks, including the inference attack and the personalized ranking tasks,…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data
