Network Shuffling: Privacy Amplification via Random Walks
Seng Pei Liew, Tsubasa Takahashi, Shun Takagi, Fumiyuki Kato, Yang, Cao, Masatoshi Yoshikawa

TL;DR
This paper introduces a decentralized network shuffling method using random walks to enhance privacy in data sharing, eliminating the need for a trusted centralized shuffler and maintaining comparable privacy amplification.
Contribution
It proposes the first decentralized network shuffling protocol that achieves privacy amplification without relying on a centralized trusted entity.
Findings
Network shuffling achieves privacy amplification similar to centralized shuffling.
The proposed protocols are practical and easy to implement in real-world systems.
Decentralized shuffling maintains strong privacy guarantees without trusted third parties.
Abstract
Recently, it is shown that shuffling can amplify the central differential privacy guarantees of data randomized with local differential privacy. Within this setup, a centralized, trusted shuffler is responsible for shuffling by keeping the identities of data anonymous, which subsequently leads to stronger privacy guarantees for systems. However, introducing a centralized entity to the originally local privacy model loses some appeals of not having any centralized entity as in local differential privacy. Moreover, implementing a shuffler in a reliable way is not trivial due to known security issues and/or requirements of advanced hardware or secure computation technology. Motivated by these practical considerations, we rethink the shuffle model to relax the assumption of requiring a centralized, trusted shuffler. We introduce network shuffling, a decentralized mechanism where users…
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.
