Aggregation and Transformation of Vector-Valued Messages in the Shuffle Model of Differential Privacy

TL;DR

This paper introduces a new protocol for vector aggregation in the Shuffle Model of differential privacy, improving accuracy through Fourier transforms and enabling future work on complex data structures.

Contribution

It presents a single message vector summation protocol in the Shuffle Model and enhances error bounds using Discrete Fourier Transform techniques.

Findings

Single message protocol for real vector summation

Error bound improvements via Fourier Transform

Foundation for higher-dimensional data aggregation

Abstract

Advances in communications, storage and computational technology allow significant quantities of data to be collected and processed by distributed devices. Combining the information from these endpoints can realize significant societal benefit but presents challenges in protecting the privacy of individuals, especially important in an increasingly regulated world. Differential privacy (DP) is a technique that provides a rigorous and provable privacy guarantee for aggregation and release. The Shuffle Model for DP has been introduced to overcome challenges regarding the accuracy of local-DP algorithms and the privacy risks of central-DP. In this work we introduce a new protocol for vector aggregation in the context of the Shuffle Model. The aim of this paper is twofold; first, we provide a single message protocol for the summation of real vectors in the Shuffle Model, using advanced composition results. Secondly, we provide an improvement on the bound on the error achieved through using this protocol through the implementation of a Discrete Fourier Transform, thereby minimizing the initial error at the expense of the loss in accuracy through the transformation itself. This work will further the exploration of more sophisticated structures such as matrices and higher-dimensional tensors in this context, both of which are reliant on the functionality of the vector case.