Abstract
This paper initiates the study of preserving differential privacy (DP) when the data-set is sparse. We study the problem of constructing efficient sanitizer that preserves 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.[3] (BBDS) can be adapted to preserve DP for answering cut-queries on sparse graphs, with an asymptotically efficient sanitizer than 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 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 [17]: 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 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 DP guarantee as our sanitization algorithm for S, \(\bar{S}\)-cuts. Moreover, we achieve a better utility guarantee than Gupta, Roth, and Ullman [17]. We give further optimization by showing that fast Johnson-Lindenstrauss transform of Ailon and Chazelle [2] also preserves DP.
Chapter PDF
Similar content being viewed by others
Keywords
References
Achlioptas, D.: Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671–687 (2003)
Ailon, N., Chazelle, B.: The fast johnson–lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39(1), 302–322 (2009)
Blocki, J., Blum, A., Datta, A., Sheffet, O.: The johnson-lindenstrauss transform itself preserves differential privacy. In: FOCS, pp. 410–419 (2012)
Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC, pp. 609–618 (2008)
Dasgupta, A., Kumar, R., Sarlós, T.: A sparse johnson: Lindenstrauss transform. In: STOC, pp. 341–350 (2010)
Dasgupta, S., Gupta, A.: An elementary proof of a theorem of johnson and lindenstrauss. Random Struct. Algorithms 22(1), 60–65 (2003)
Davis, T.: Direct Methods for Sparse Linear Systems. Part of the SIAM Book Series on the Fundamentals of Algorithms. SIAM, Philadelphia (2008)
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: Privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486–503. Springer, Heidelberg (2006)
Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265–284. Springer, Heidelberg (2006)
Dwork, C., Rothblum, G., Vadhan, S.: Boosting and DP. In: FOCS, pp. 51–60 (2010)
Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23(98), 298–305 (1973)
Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Mathematical Journal 25(100), 618–633 (1975)
Friedman, J.: A proof of alon’s second eigenvalue conjecture. In: STOC, pp. 720–724 (2003)
Godsil, C., Royle, G.: Algebraic Graph Theory. Springer (2001)
Golub, G., Loan, C.: Matrix Computations. John Hopkins University Press, Maryland (1996)
Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately releasing conjunctions and the statistical query barrier. In: STOC, pp. 803–812 (2011)
Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 339–356. Springer, Heidelberg (2012)
Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. In: NIPS, pp. 2348–2356 (2012)
Hardt, M., Roth, A.: Beating randomized response on incoherent matrices. In: STOC, pp. 1255–1268 (2012)
Hay, M., Li, C., Miklau, G., Jensen, C.: Accurate estimation of the degree distribution of private networks. In: ICDM, pp. 169–178 (2009)
Johnson, W., Lindenstrauss, J.: Extensions of Lipschitz mapping into Hilbert space. In: Conf. in Modern Analysis and Probability. Contemporary Mathematics, vol. 26, pp. 189–206. American Mathematical Society (1984)
Kane, D., Nelson, J.: Sparser johnson-lindenstrauss transforms. In: SODA, pp. 1195–1206 (2012)
Kapralov, M., Talwar, K.: On differentially private low rank approximation. In: SODA, pp. 1395–1414 (2013)
Karwa, K., Raskhodnikova, S., Smith, A., Yaroslavtsev, G.: Private analysis of graph structure. PVLDB 4(11), 1146–1157 (2011)
Kenthapadi, K., Korolova, A., Mironov, I., Mishra, N.: Privacy via the johnson-lindenstrauss transform. CoRR, abs/1204.2606 (2012)
Marcus, A., Spielman, D., Srivastava, N.: Interlacing families i: Bipartite ramanujan graphs of all degrees. To Appear in FOCS (2013)
McSherry, F., Talwar, K.: Mechanism design via DP. In: FOCS, pp. 94–103 (2007)
Nesetril, J., Mendez, P.: Sparsity - Graphs, Structures, and Algorithms. Algorithms and combinatorics, vol. 28. Springer (2012)
Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: STOC, pp. 75–84 (2007)
Roth, A., Roughgarden, T.: Interactive privacy via the median mechanism. In: STOC, pp. 765–774 (2010)
Spielman, D., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913–1926 (2011)
Spielman, D., Teng, S.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981–1025 (2011)
Trevisan, L.: Approximation algorithms for unique games. Theory of Computing 4(1), 111–128 (2008)
Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Transactions on Algorithms 1(1), 2–13 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Upadhyay, J. (2013). Random Projections, Graph Sparsification, and Differential Privacy. In: Sako, K., Sarkar, P. (eds) Advances in Cryptology - ASIACRYPT 2013. ASIACRYPT 2013. Lecture Notes in Computer Science, vol 8269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42033-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-42033-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42032-0
Online ISBN: 978-3-642-42033-7
eBook Packages: Computer ScienceComputer Science (R0)