{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:38:42Z","timestamp":1725601122101},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642235559"},{"type":"electronic","value":"9783642235566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23556-6_3","type":"book-chapter","created":{"date-parts":[[2011,8,19]],"date-time":"2011-08-19T00:08:57Z","timestamp":1313712537000},"page":"33-51","source":"Crossref","is-referenced-by-count":2,"title":["LORA: Link Obfuscation by Randomization in Graphs"],"prefix":"10.1007","author":[{"given":"Qian","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengkui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"924","volume-title":"IEEE International Conference on Data Engineering","author":"F. Bonchi","year":"2011","unstructured":"Bonchi, F., Gionis, A., Tassa, T.: Identity Obfuscation in Graphs Through the Information Theoretic Lens. In: IEEE International Conference on Data Engineering, pp. 924\u2013935. IEEE Press, Hannover (2011)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A. Clauset","year":"2008","unstructured":"Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature\u00a0453, 98\u2013101 (2008)","journal-title":"Nature"},{"key":"3_CR3","unstructured":"Hay, M., Miklau, G., Jensen, D., Weis, P., Srivastava, S.: Anonymizing social networks. University of Massachusetts Technical Report (2007)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ying, X., Wu, X.: Randomizing social networks: A spectrum preserving approach. In: Proceedings of the 8th SIAM Conference on Data Mining, pp. 739\u2013750 (2008)","DOI":"10.1137\/1.9781611972788.67"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Ying, X., Wu, X.: Graph generation with prescribed feature constraints. In: Proceedings of the 9th SIAM Conference on Data Mining, pp. 966\u2013977 (2009)","DOI":"10.1137\/1.9781611972795.83"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Hanhijarvi, S., Garriga, G.C., Puolamaki, K.: Randomization techniques for graphs. In: Proceedings of the 9th SIAM Conference on Data Mining, pp. 780\u2013791 (2009)","DOI":"10.1137\/1.9781611972795.67"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Ozsu, M.T.: K-automorphism: A general framework for privacy preserving network publication. VLDB, 946\u2013957 (2009)","DOI":"10.14778\/1687627.1687734"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Wu, W., Xiao, Y., Wang, W., He, Z., Wang, Z.: k-symmetry model for identity anonymization in social networks. EDBT, 111\u2013122 (2010)","DOI":"10.1145\/1739041.1739058"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, J., Fu, A.W.C., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. SIGMOD, 459\u2013470 (2010)","DOI":"10.1145\/1807167.1807218"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. SIGMOD, 93\u2013106 (2008)","DOI":"10.1145\/1376616.1376629"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Clauset, A., Moore, C., Newman, M.E.J.: Structural Inference of Hierarchies in Networks. CoRR, 1\u201313 (2006)","DOI":"10.1007\/978-3-540-73133-7_1"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Mir, D.J., Wright, R.N.: A Differentially Private Graph Estimator. In: ICDM Worshops, pp. 122\u2013129 (2009)","DOI":"10.1109\/ICDMW.2009.96"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"36104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"M.E.J. Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E\u00a074, 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1098\/rstb.1986.0056","volume":"314","author":"J.G. White","year":"1986","unstructured":"White, J.G., Southgate, E., Thomson, J.N., Brenner, S.: The Structure of the Nervous System of the Nematode Caenorhabditis elegans. Phil. Trans. R. Soc. London\u00a0314, 1\u2013340 (1986)","journal-title":"Phil. Trans. R. Soc. London"},{"key":"3_CR15","unstructured":"Dam, E.R.V., Haemers, W.H.: Spectral Characterizations of Some Distance-Regular Graphs. Journal of Algebraic Combinatorics, 189\u2013202 (2002)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Zhou, B., Pei, J.: Preserving Privacy in Social Networks Against Neighborhood Attacks. ICDE, 506\u2013515 (2008)","DOI":"10.1109\/ICDE.2008.4497459"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Dwork, C., Kleinberg, J.: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th International Conference on World Wide Web, pp. 181\u2013190 (2007)","DOI":"10.1145\/1242572.1242598"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Hay, M., Miklau, G., Jensen, D., Towsley, D., Weis, P.: Resisting structural re-identification in anonymized social networks. In: Proceedings of the VLDB Endowment, pp. 102\u2013114 (2008)","DOI":"10.14778\/1453856.1453873"}],"container-title":["Lecture Notes in Computer Science","Secure Data Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23556-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T01:24:27Z","timestamp":1560475467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23556-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642235559","9783642235566"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23556-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}