{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:34:04Z","timestamp":1777473244604,"version":"3.51.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319941462","type":"print"},{"value":"9783319941479","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94147-9_5","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T03:40:43Z","timestamp":1529120443000},"page":"55-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An Information-Flow Control Model for Online Social Networks Based on User-Attribute Credibility and Connection-Strength Factors"],"prefix":"10.1007","author":[{"given":"Ehud","family":"Gudes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadav","family":"Voloch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,17]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-41483-6_16","volume-title":"Data and Applications Security and Privacy XXX","author":"S Levy","year":"2016","unstructured":"Levy, S., Gudes, E., Gal-Oz, N.: Sharing-habits based privacy control in social networks. In: Ranise, S., Swarup, V. (eds.) DBSec 2016. LNCS, vol. 9766, pp. 217\u2013232. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41483-6_16"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.comcom.2014.01.002","volume":"41","author":"A Ranjbar","year":"2014","unstructured":"Ranjbar, A., Maheswaran, M.: Using community structure to control information sharing in online social networks. Comput. Commun. 41, 11\u201321 (2014)","journal-title":"Comput. Commun."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.cose.2014.10.012","volume":"49","author":"Y Li","year":"2015","unstructured":"Li, Y., Li, Y., Yan, Q., Deng, R.H.: Privacy leakage analysis in online social networks. Comput. Secur. 49, 239\u2013254 (2015)","journal-title":"Comput. Secur."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bokobza, Y., Paradise, A., Rapaport, G., Puzis, R., Shapira, B., Shabtai, A.: Leak sinks: the threat of targeted social eavesdropping. In: 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 375\u2013382. IEEE (2015)\u200f","DOI":"10.1145\/2808797.2808891"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-61176-1_13","volume-title":"Data and Applications Security and Privacy XXXI","author":"VT Patil","year":"2017","unstructured":"Patil, V.T., Shyamasundar, R.K.: Undoing of privacy policies on Facebook. In: Livraga, G., Zhu, S. (eds.) DBSec 2017. LNCS, vol. 10359, pp. 239\u2013255. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61176-1_13"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Misra, G., Such, J.M., Balogun, H.: Improve-identifying minimal profile vectors for similarity-based access control. In: 2016 IEEE Trustcom\/BigDataSE\/I SPA, pp. 868\u2013875. IEEE (2016)","DOI":"10.1109\/TrustCom.2016.0150"},{"key":"5_CR7","unstructured":"Benevenuto, F., et al.: Detecting spammers on Twitter. In: Collaboration, Electronic Messaging, Anti-abuse and Spam Conference (CEAS), vol. 6 (2010)\u200f"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.neucom.2015.02.047","volume":"159","author":"X Zheng","year":"2015","unstructured":"Zheng, X., et al.: Detecting spammers on social networks. Neurocomputing 159, 27\u201334 (2015)","journal-title":"Neurocomputing"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Han Veiga, M., Eickhoff, C.: A cross-platform collection of social network profiles. In: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM (2016)\u200f","DOI":"10.1145\/2911451.2914666"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.knosys.2017.11.040","volume":"142","author":"Yehonatan Cohen","year":"2018","unstructured":"Cohen, Y., Gordon, D., Hendler, D.: Early detection of spamming accounts in large-scale service provider networks. Knowl. Based Syst. 142, 241\u2013255 (2017)\u200f","journal-title":"Knowledge-Based Systems"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.knosys.2017.11.011","volume":"141","author":"Y Cohen","year":"2018","unstructured":"Cohen, Y., Hendler, D., Rubin, A.: Detection of malicious webmail attachments based on propagation patterns. Knowl. Based Syst. 141, 67\u201379 (2018)","journal-title":"Knowl. Based Syst."},{"key":"5_CR12","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":"5_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"Jack Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM. 19(2), 248\u2013264 (1972). Association for Computing Machinery","journal-title":"Journal of the ACM"},{"key":"5_CR14","unstructured":"Dinic, Y.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Doklady Akademii nauk SSSR 11, 1277\u20131280 (1970)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00296-0_5","volume-title":"Noise Reduction in Speech Processing","author":"Jacob Benesty","year":"2009","unstructured":"Benesty, J., et al.: Pearson correlation coefficient. In: Cohen, I., Huang, Y., Chen, J., Benesty, J.: Noise Reduction in Speech Processing, pp. 1\u20134. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00296-0_5"}],"container-title":["Lecture Notes in Computer Science","Cyber Security Cryptography and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94147-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:37:33Z","timestamp":1709825853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94147-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319941462","9783319941479"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94147-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security Cryptography and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beer-Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~fradmin\/cscml18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","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":"16","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":"6","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":"29% - 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","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)"}}]}}