{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:18:03Z","timestamp":1749010683000,"version":"3.41.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319414829"},{"type":"electronic","value":"9783319414836"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41483-6_16","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T11:09:11Z","timestamp":1467371351000},"page":"217-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Sharing-Habits Based Privacy Control in Social Networks"],"prefix":"10.1007","author":[{"given":"Silvie","family":"Levy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Gudes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nurit","family":"Gal-Oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.comcom.2014.01.002","volume":"41","author":"M Maheswaran","year":"2014","unstructured":"Maheswaran, M., Ranjbar, A.: Using community structure to control information sharing in online social networks. Comput. Commun. 41, 11\u201321 (2014)","journal-title":"Comput. Commun."},{"key":"16_CR2","unstructured":"Rivest, R.L., Cormen, T.H., Leiserson, C.E.: Introduction to Algorithms, chap. 27, p. 581. MIT Press, Cambridge (1990). (2009)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"VS Vassilios","year":"2013","unstructured":"Vassilios, V.S., Vatsalan, D., Christen, P.: A taxonomy of privacy-preserving record linkage techniques. Inf. Syst. 38, 946\u2013969 (2013)","journal-title":"Inf. Syst."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1177\/0165551513509564","volume":"40","author":"ITF Carmagnola","year":"2014","unstructured":"Carmagnola, I.T.F., Osborne, F.: Escaping the big brother: an empirical study on factors influencing identification and information leakage on the web. J. Inf. Sci. 40(2), 180\u2013197 (2014)","journal-title":"J. Inf. Sci."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Sandhu, R., Jaehong, P.: Originator control in usage control. In: Proceedings of the 3rd International Workshop on Policies for Distributed Systems and Networks, pp. 60\u201366. IEEE, Washington DC (2002)","DOI":"10.1109\/POLICY.2002.1011294"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.geb.2013.10.002","volume":"82","author":"K Ligett","year":"2013","unstructured":"Ligett, K., Kleinberg, J.: Information-sharing in social networks. Games Econ. Behav. 82, 702\u2013716 (2013)","journal-title":"Games Econ. Behav."},{"key":"16_CR8","unstructured":"Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 21\u201330. ACM, New York (1993)"},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601\u2013604 (1996)","journal-title":"J. ACM"},{"key":"16_CR10","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/TKDE.2011.232","volume":"25","author":"T Tassa","year":"2013","unstructured":"Tassa, T., Cohen, D.J.: Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans. Knowl. Data Eng. 25(2), 311\u2013324 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41483-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:33:13Z","timestamp":1748993593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41483-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319414829","9783319414836"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41483-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"2 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}