{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:23Z","timestamp":1763468183871,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642420320"},{"type":"electronic","value":"9783642420337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42033-7_15","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T08:07:02Z","timestamp":1385194022000},"page":"276-295","source":"Crossref","is-referenced-by-count":6,"title":["Random Projections, Graph Sparsification, and Differential Privacy"],"prefix":"10.1007","author":[{"given":"Jalaj","family":"Upadhyay","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D. Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-lindenstrauss with binary coins. J. Comput. Syst. Sci.\u00a066(4), 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N. Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast johnson\u2013lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput.\u00a039(1), 302\u2013322 (2009)","journal-title":"SIAM J. Comput."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Blocki, J., Blum, A., Datta, A., Sheffet, O.: The johnson-lindenstrauss transform itself preserves differential privacy. In: FOCS, pp. 410\u2013419 (2012)","DOI":"10.1109\/FOCS.2012.67"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC, pp. 609\u2013618 (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., Sarl\u00f3s, T.: A sparse johnson: Lindenstrauss transform. In: STOC, pp. 341\u2013350 (2010)","DOI":"10.1145\/1806689.1806737"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S. Dasgupta","year":"2003","unstructured":"Dasgupta, S., Gupta, A.: An elementary proof of a theorem of johnson and lindenstrauss. Random Struct. Algorithms\u00a022(1), 60\u201365 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"15_CR7","series-title":"Part of the SIAM Book Series on the Fundamentals of Algorithms","volume-title":"Direct Methods for Sparse Linear Systems","author":"T. Davis","year":"2008","unstructured":"Davis, T.: Direct Methods for Sparse Linear Systems. Part of the SIAM Book Series on the Fundamentals of Algorithms. SIAM, Philadelphia (2008)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Dwork","year":"2006","unstructured":"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.\u00a04004, pp. 486\u2013503. Springer, Heidelberg (2006)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C. Dwork","year":"2006","unstructured":"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.\u00a03876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G., Vadhan, S.: Boosting and DP. In: FOCS, pp. 51\u201360 (2010)","DOI":"10.1109\/FOCS.2010.12"},{"issue":"98","key":"15_CR11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal\u00a023(98), 298\u2013305 (1973)","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"100","key":"15_CR12","first-page":"618","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Mathematical Journal\u00a025(100), 618\u2013633 (1975)","journal-title":"Czechoslovak Mathematical Journal"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Friedman, J.: A proof of alon\u2019s second eigenvalue conjecture. In: STOC, pp. 720\u2013724 (2003)","DOI":"10.1145\/780642.780646"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"15_CR15","volume-title":"Matrix Computations","author":"G. Golub","year":"1996","unstructured":"Golub, G., Loan, C.: Matrix Computations. John Hopkins University Press, Maryland (1996)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately releasing conjunctions and the statistical query barrier. In: STOC, pp. 803\u2013812 (2011)","DOI":"10.1145\/1993636.1993742"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-28914-9_19","volume-title":"Theory of Cryptography","author":"A. Gupta","year":"2012","unstructured":"Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 339\u2013356. Springer, Heidelberg (2012)"},{"key":"15_CR18","unstructured":"Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. In: NIPS, pp. 2348\u20132356 (2012)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Hardt, M., Roth, A.: Beating randomized response on incoherent matrices. In: STOC, pp. 1255\u20131268 (2012)","DOI":"10.1145\/2213977.2214088"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Hay, M., Li, C., Miklau, G., Jensen, C.: Accurate estimation of the degree distribution of private networks. In: ICDM, pp. 169\u2013178 (2009)","DOI":"10.1109\/ICDM.2009.11"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of Lipschitz mapping into Hilbert space. In: Conf. in Modern Analysis and Probability. Contemporary Mathematics, vol.\u00a026, pp. 189\u2013206. American Mathematical Society (1984)","DOI":"10.1090\/conm\/026\/737400"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Kane, D., Nelson, J.: Sparser johnson-lindenstrauss transforms. In: SODA, pp. 1195\u20131206 (2012)","DOI":"10.1137\/1.9781611973099.94"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Talwar, K.: On differentially private low rank approximation. In: SODA, pp. 1395\u20131414 (2013)","DOI":"10.1137\/1.9781611973105.101"},{"issue":"11","key":"15_CR24","first-page":"1146","volume":"4","author":"K. Karwa","year":"2011","unstructured":"Karwa, K., Raskhodnikova, S., Smith, A., Yaroslavtsev, G.: Private analysis of graph structure. PVLDB\u00a04(11), 1146\u20131157 (2011)","journal-title":"PVLDB"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Korolova, A., Mironov, I., Mishra, N.: Privacy via the johnson-lindenstrauss transform. CoRR, abs\/1204.2606 (2012)","DOI":"10.29012\/jpc.v5i1.625"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Marcus, A., Spielman, D., Srivastava, N.: Interlacing families i: Bipartite ramanujan graphs of all degrees. To Appear in FOCS (2013)","DOI":"10.1109\/FOCS.2013.63"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via DP. In: FOCS, pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Nesetril, J., Mendez, P.: Sparsity - Graphs, Structures, and Algorithms. Algorithms and combinatorics, vol.\u00a028. Springer (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: STOC, pp. 75\u201384 (2007)","DOI":"10.1145\/1250790.1250803"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Roth, A., Roughgarden, T.: Interactive privacy via the median mechanism. In: STOC, pp. 765\u2013774 (2010)","DOI":"10.1145\/1806689.1806794"},{"issue":"6","key":"15_CR31","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"D. Spielman","year":"2011","unstructured":"Spielman, D., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput.\u00a040(6), 1913\u20131926 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"15_CR32","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"D. Spielman","year":"2011","unstructured":"Spielman, D., Teng, S.: Spectral sparsification of graphs. SIAM J. Comput.\u00a040(4), 981\u20131025 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR33","doi-asserted-by":"publisher","first-page":"111","DOI":"10.4086\/toc.2008.v004a005","volume":"4","author":"L. Trevisan","year":"2008","unstructured":"Trevisan, L.: Approximation algorithms for unique games. Theory of Computing\u00a04(1), 111\u2013128 (2008)","journal-title":"Theory of Computing"},{"issue":"1","key":"15_CR34","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1077464.1077466","volume":"1","author":"R. Yuster","year":"2005","unstructured":"Yuster, R., Zwick, U.: Fast sparse matrix multiplication. ACM Transactions on Algorithms\u00a01(1), 2\u201313 (2005)","journal-title":"ACM Transactions on Algorithms"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42033-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T22:54:36Z","timestamp":1746053676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42033-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420320","9783642420337"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42033-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}