{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:29:48Z","timestamp":1752460188012},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209506"},{"type":"electronic","value":"9783030209513"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-20951-3_14","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:02:48Z","timestamp":1560711768000},"page":"156-168","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An Access Control Model for Data Security in Online Social Networks Based on Role and User Credibility"],"prefix":"10.1007","author":[{"given":"Nadav","family":"Voloch","sequence":"first","affiliation":[]},{"given":"Priel","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Mor","family":"Elmakies","sequence":"additional","affiliation":[]},{"given":"Ehud","family":"Gudes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,19]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Sayaf, R., Clarke, D.: Access control models for online social networks. Social Network Engineering for Secure Web Data and Services, pp. 32\u201365 (2012)\u200f","DOI":"10.4018\/978-1-4666-3926-3.ch003"},{"key":"14_CR2","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-41483-6_16"},{"issue":"4","key":"14_CR3","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TDSC.2015.2406705","volume":"13","author":"Y Cheng","year":"2016","unstructured":"Cheng, Y., Park, J., Sandhu, R.: An access control model for online social networks using user-to-user relationships. IEEE Trans. Dependable Secure Comput. 13(4), 424\u2013436 (2016)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-94147-9_5","volume-title":"Cyber Security Cryptography and Machine Learning","author":"E Gudes","year":"2018","unstructured":"Gudes, E., Voloch, N.: An information-flow control model for online social networks based on user-attribute credibility and connection-strength factors. In: Dinur, I., Dolev, S., Lodha, S. (eds.) CSCML 2018. LNCS, vol. 10879, pp. 55\u201367. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-94147-9_5"},{"key":"14_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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-61176-1_13"},{"key":"14_CR6","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."},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/2.485845","volume":"29","author":"RS Sandhu","year":"1996","unstructured":"Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. Computer 29(2), 38\u201347 (1996)","journal-title":"Computer"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Lavi, T., Gudes, E.: Trust-based dynamic RBAC. In: Proceedings of the 2nd International Conference on Information Systems Security and Privacy (ICISSP) 2016, pp. 317\u2013324 (2016)","DOI":"10.5220\/0005687503170324"},{"key":"14_CR9","volume-title":"An Access Control Model for Facebook-Style Social Network Systems","author":"M Anwar","year":"2010","unstructured":"Anwar, M., Zhao, Z., Fong, P.W.: An Access Control Model for Facebook-Style Social Network Systems. University of Calgary, Calgary (2010)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Park, J., Sandhu, R.: Relationship-based access control for online social networks: beyond user-to-user relationships. In: 2012 International Conference on Privacy, Security, Risk and Trust (PASSAT), and 2012 International Conference on Social Computing (SocialCom), pp. 646\u2013655. IEEE (2012)","DOI":"10.1109\/SocialCom-PASSAT.2012.57"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Fong, P.W.: Relationship-based access control: protection model and policy language. In: Proceedings of the first ACM Conference on Data and Application Security and Privacy, pp. 191\u2013202. ACM (2011)\u200f","DOI":"10.1145\/1943513.1943539"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Crampton, J., Sellwood, J.: Path conditions and principal matching: a new approach to access control. In: Proceedings of the 19th ACM Symposium on Access Control Models and Technologies, pp. 187\u2013198. ACM (2014)\u200f","DOI":"10.1145\/2613087.2613094"},{"key":"14_CR13","series-title":"Smart Innovation, Systems and Technologies","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-30927-9_20","volume-title":"Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems: Volume 2","author":"A Kumar","year":"2016","unstructured":"Kumar, A., Rathore, N.C.: Relationship strength based access control in online social networks. In: Satapathy, S.C., Das, S. (eds.) Proceedings of First International Conference on Information and Communication Technology for Intelligent Systems: Volume 2. SIST, vol. 51, pp. 197\u2013206. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-30927-9_20"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Ali, B., Villegas, W., Maheswaran, M.: A trust based approach for protecting user data in social networks. In: Proceedings of the 2007 Conference of the Center for Advanced Studies on Collaborative Research, pp. 288\u2013293. IBM Corp. (2007)","DOI":"10.1145\/1321211.1321251"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Wang, H., Sun, L.: Trust-involved access control in collaborative open social networks. In: 2010 4th International Conference on Network and System Security (NSS), pp. 239\u2013246. IEEE (2010)","DOI":"10.1109\/NSS.2010.13"},{"key":"14_CR16","unstructured":"Misra, G., Such, J.M., Balogun, H.: IMPROVE-identifying minimal PROfile VEctors for similarity-based access control. In: Trustcom\/BigDataSE\/ISPA, 2016 IEEE, pp. 868\u2013875. IEEE (2016)"},{"key":"14_CR17","unstructured":"Facebook help: roles. \n                    https:\/\/www.facebook.com\/help\/323502271070625\/"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"150292","DOI":"10.1098\/rsos.150292","volume":"3","author":"RI Dunbar","year":"2016","unstructured":"Dunbar, R.I.: Do online social media cut through the constraints that limit the size of offline social networks? Roy. Soc. Open Sci. 3(1), 150292 (2016)","journal-title":"Roy. Soc. Open Sci."},{"key":"14_CR19","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., Zeng, Z., Chen, Z., Yu, Y., Rong, C.: Detecting spammers on social networks. Neurocomputing 159, 27\u201334 (2015)","journal-title":"Neurocomputing"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00296-0_5","volume-title":"Noise Reduction in Speech Processing","author":"J Benesty","year":"2009","unstructured":"Benesty, J., Chen, J., Huang, Y., Cohen, I.: Pearson correlation coefficient. In: Cohen, I., Huang, Y., Chen, J., Benesty, J. (eds.) Noise Reduction in Speech Processing, pp. 1\u20134. Springer, Heidelberg (2009). \n                    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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20951-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:07:18Z","timestamp":1560712038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20951-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209506","9783030209513"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20951-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 May 2019","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~fradmin\/cscml19\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - 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"}},{"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"}},{"value":"n\/a","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}