{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T11:00:38Z","timestamp":1777806038509,"version":"3.51.4"},"reference-count":20,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:00:00Z","timestamp":1507852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2018,1,8]]},"abstract":"<jats:p>We study users behavior in online social networks (OSN) as a means to preserve privacy. People widely use OSN for a variety of objectives and fields. Each OSN has different characteristics, requirements, and vulnerabilities of the private data shared. Sharing-habits refers to users\u2019 patterns of sharing information. Sharing-habits are implied by the communication between users and their peers. While social networks allow users to have some control over the dissemination of their information, most users are not aware that the private information they share might leak to users with whom they do not wish to share it. In this paper we address the growing need of social network users to share information with close fiends while hiding it from others. We apply several different well-known strategies from graph-flow theory to an OSN graph with sharing-habits insights, to control the information flow among OSN users. The goal of the method we present is to allow maximum information sharing while enforcing a user\u2019s pre-defined privacy criteria. Our method is evaluated using real data from well known social networks and the results are analyzed in terms of accuracy and run-time.<\/jats:p>","DOI":"10.3233\/jcs-171012","type":"journal-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T12:16:27Z","timestamp":1507896987000},"page":"177-205","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":4,"title":["Sharing-habits based privacy control in social networks"],"prefix":"10.1177","volume":"26","author":[{"given":"Silvie","family":"Levy","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, The Open University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Gudes","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, The Open University, Israel"},{"name":"Department of Computer Science, Ben-Gurion University of the Negev, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nurit","family":"Gal-Oz","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Sapir Academic College, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,10,13]]},"reference":[{"key":"ref001","unstructured":"A.L.\u00a0Barabasi, Introduction and Keynote to a Networked Self, Routledge, Taylor and Francis Group, New York, NY, 2011, chapter Introduction, page 14."},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.232"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"ref005","unstructured":"D.S.\u00a0Johnson and M.R.\u00a0Garey, Computers and Intractability, W.H. Freeman & Co., New York, NY, 1990, chapter 3, page 64."},{"key":"ref006","unstructured":"D.R.\u00a0Karger, 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, ACM, New York, 1993, pp.\u00a021\u201330."},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2010.08.015"},{"key":"ref009","unstructured":"A.\u00a0Krevl and J.\u00a0Leskovec, SNAP Datasets: Stanford large network dataset collection, 2014, http:\/\/snap.stanford.edu\/data."},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.10.002"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2014.01.002"},{"key":"ref012","unstructured":"Z.\u00a0Papacharissi, A Networked Self, Routledge, Taylor and Francis Group, New York, NY, 2011, p.\u00a0337, chapter 14."},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1109\/POLICY.2002.1011294"},{"key":"ref014","unstructured":"W.\u00a0Peng, R.\u00a0LaRose and K.\u00a0Junghyun, Social Networking Addictive, Compulsive, Problematic, or Just Another Media Habit? Routledge, Taylor and Francis Group, New York, NY, 2011, chapter Introduction, page 24."},{"key":"ref015","unstructured":"R.L.\u00a0Rivest, T.H.\u00a0Cormen and C.E.\u00a0Leiserson, Introduction to Algorithms, MIT Press, Cambridge, Massachusetts, 2009, p.\u00a0581, chapter 27, 1990."},{"key":"ref016","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234534"},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1177\/0165551513509564"},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.11.005"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2583425"}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-171012","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-171012","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-171012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:07Z","timestamp":1777495507000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-171012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,13]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1,8]]}},"alternative-id":["10.3233\/JCS-171012"],"URL":"https:\/\/doi.org\/10.3233\/jcs-171012","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,13]]}}}