{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T04:10:07Z","timestamp":1748837407731,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030660451"},{"type":"electronic","value":"9783030660468"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-66046-8_22","type":"book-chapter","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T15:02:32Z","timestamp":1609686152000},"page":"267-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-Stage Framework for Accurate and Differentially Private Network Information Publication"],"prefix":"10.1007","author":[{"given":"Maneesh Babu","family":"Adhikari","sequence":"first","affiliation":[]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[]},{"given":"Arinjita","family":"Paul","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: SP. IEEE 2008, 111\u2013125 (2008)","DOI":"10.1109\/SP.2008.33"},{"key":"22_CR2","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. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"22_CR3","first-page":"2233","volume":"2019","author":"L Roohi","year":"2019","unstructured":"Roohi, L., Rubinstein, B.I., Teague, V.: Differentially-private two-party egocentric betweenness centrality. INFOCOM IEEE 2019, 2233\u20132241 (2019)","journal-title":"INFOCOM IEEE"},{"key":"22_CR4","unstructured":"\u201cCrime network dataset - KONECT,\u201d April 2017. http:\/\/konect.uni-koblenz.de\/networks\/moreno_crime"},{"key":"22_CR5","first-page":"442","volume":"2004","author":"D Chakrabarti","year":"2004","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. SDM SIAM 2004, 442\u2013446 (2004)","journal-title":"SDM SIAM"},{"key":"22_CR6","unstructured":"Ullman, J., Sealfon, A.: Efficiently estimating erdos-renyi graphs with node differential privacy. In: Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8\u201314 December 2019, Vancouver, BC, Canada, 2019, pp. 3765\u20133775 (2019)"},{"key":"22_CR7","first-page":"123","volume":"2016","author":"W-Y Day","year":"2016","unstructured":"Day, W.-Y., Li, N., Lyu, M.: Publishing graph degree distribution with node differential privacy. ICDM 2016, 123\u2013138 (2016)","journal-title":"ICDM"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-642-36594-2_26","volume-title":"Theory of Cryptography","author":"SP Kasiviswanathan","year":"2013","unstructured":"Kasiviswanathan, S.P., Nissim, K., Raskhodnikova, S., Smith, A.: Analyzing graphs with node differential privacy. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 457\u2013476. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_26"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Hay, M., Li, C., Miklau, G., Jensen, D.D.: Accurate estimation of the degree distribution of private networks. In: The Ninth IEEE International Conference on Data Mining, Miami, Florida, USA 6\u20139(2009), pp. 169\u2013178 (2009)","DOI":"10.1109\/ICDM.2009.11"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kenthapadi, K., Korolova, A., Mironov, I., Mishra, N.: Privacy via the Johnson-Lindenstrauss transform, arXiv preprint arXiv:1204.2606 (2012)","DOI":"10.29012\/jpc.v5i1.625"},{"key":"22_CR11","unstructured":"Ahmed, F., Liu, A.X., Jin, R.: Publishing social network graph eigen-spectrum with privacy guarantees. In: IEEE Transactions on Network Science and Engineering, pp. 1\u201314 (2019)"},{"key":"22_CR12","first-page":"167","volume":"2012","author":"DJ Mir","year":"2012","unstructured":"Mir, D.J., Wright, R.N.: A differentially private estimator for the stochastic kronecker graph model. EDBT\/ICDT Workshops 2012, 167\u2013176 (2012)","journal-title":"EDBT\/ICDT Workshops"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-319-48743-4_23","volume-title":"Web Information Systems Engineering \u2013 WISE 2016","author":"D Li","year":"2016","unstructured":"Li, D., Zhang, W., Chen, Y.: Differentially private network data release via stochastic kronecker graph. In: Cellary, W., Mokbel, M.F., Wang, J., Wang, H., Zhou, R., Zhang, Y. (eds.) WISE 2016. LNCS, vol. 10042, pp. 290\u2013297. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48743-4_23"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Paul, A., Suppakitpaisarn, V., Bafna, M., Rangan, C.P.: Improving accuracy of differentially private kronecker social networks via graph clustering. In: ISNCC 2020, 2020 (accepted)","DOI":"10.1109\/ISNCC49221.2020.9297349"},{"issue":"6","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1953","DOI":"10.1137\/15100271X","volume":"45","author":"J Hsu","year":"2016","unstructured":"Hsu, J., Huang, Z., Roth, A., Roughgarden, T., Wu, Z.S.: Private matchings and allocations. SIAM J. Comput. 45(6), 1953\u20131984 (2016)","journal-title":"SIAM J. Comput."},{"key":"22_CR16","unstructured":"Varma, N., Yoshida, Y.: Average sensitivity of graph algorithms, arXiv preprint arXiv:1904.03248 (2019)"},{"key":"22_CR17","unstructured":"Huang, Z., Zhu, X.: Scalable and jointly differentially private packing. In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9\u201312, 2019, Patras, Greece, ser. LIPIcs, 2019, pp. 73:1\u201373:12 (2019)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS 2007. IEEE 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"22_CR19","unstructured":"Cochran, W.G.: Sampling techniques. Wiley (2007)"},{"key":"22_CR20","unstructured":"Kleinberg, J., Tardos, E.: Algorithm design. Pearson Education (2006)"},{"issue":"7","key":"22_CR21","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: random permutation. Commun. ACM 7(7), 420 (1964)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66046-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T03:48:53Z","timestamp":1748836133000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66046-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030660451","9783030660468"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66046-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}