Cryptology ePrint Archive: Report 2013/580

Random Projections, Graph Sparsification, and Differential Privacy

Jalaj Upadhyay

Abstract: This paper initiates the study of preserving {\em differential privacy} ({\sf DP}) when the data-set is sparse. We study the problem of constructing efficient sanitizer that preserves {\sf DP} and guarantees high utility for answering cut-queries on graphs. The main motivation for studying sparse graphs arises from the empirical evidences that social networking sites are sparse graphs. We also motivate and advocate the necessity to include the efficiency of sanitizers, in addition to the utility guarantee, if one wishes to have a practical deployment of privacy preserving sanitizers.

We show that the technique of Blocki et al. (FOCS2012) ({\sf BBDS}) can be adapted to preserve {\sf DP} for answering cut-queries on sparse graphs, with an asymptotically efficient sanitizer than~{\sf BBDS}. We use this as the base technique to construct an efficient sanitizer for arbitrary graphs. In particular, we use a preconditioning step that preserves the spectral properties (and therefore, size of any cut is preserved), and then apply our basic sanitizer. We first prove that our sanitizer preserves {\sf DP} for graphs with high conductance. We then carefully compose our basic technique with the modified sanitizer to prove the result for arbitrary graphs. In certain sense, our approach is complementary to the Randomized sanitization for answering cut queries (Gupta, Roth, and Ullman, TCC 2012): we use graph sparsification, while Randomized sanitization uses graph densification.

Our sanitizers almost achieves the best of both the worlds with the same privacy guarantee, i.e., it is almost as efficient as the most efficient sanitizer and it has utility guarantee almost as strong as the utility guarantee of the best sanitization algorithm.

We also make some progress in answering few open problems by {\sf BBDS}. We make a combinatorial observation that allows us to argue that the sanitized graph can also answer $(S,T)$-cut queries with same asymptotic efficiency, utility, and {\sf DP} guarantee as our sanitization algorithm for $S, \bar{S}$-cuts. Moreover, we achieve a better utility guarantee than Gupta, Roth, and Ullman (TCC 2012). We give further optimization by showing that fast Johnson-Lindenstrauss transform of Ailon and Chazelle~\cite{AC09} also preserves {\sf DP}.

Category / Keywords: Differential Privacy, Graph sparsification, Fast Johnson-Lindenstrauss transform

Original Publication (with minor differences): IACR-ASIACRYPT-2013

Date: received 9 Sep 2013, last revised 9 Sep 2013

Contact author: jkupadhy at cs uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20130914:015745 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]