0 citations
Differentially Private Aggregation via Imperfect Shuffling
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)2023
Citations Over Time
Abstract
In this paper, we introduce the imperfect shuffle differential privacy model, where messages sent from users are shuffled in an almost uniform manner before being observed by a curator for private aggregation. We then consider the private summation problem. We show that the standard split-and-mix protocol by Ishai et. al. [FOCS 2006] can be adapted to achieve near-optimal utility bounds in the imperfect shuffle model. Specifically, we show that surprisingly, there is no additional error overhead necessary in the imperfect shuffle model.
Related Papers
- → Bitslice Masking and Improved Shuffling:(2022)8 cited
- → Load shuffling algorithms for split-platform AS/RS(2010)10 cited
- → Efficient algorithms for load shuffling in split-platform AS/RS(2004)5 cited
- → Amplification by Shuffling without Shuffling(2023)
- → Amplification by Shuffling without Shuffling(2023)