{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T20:42:51Z","timestamp":1770237771544,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001602","name":"science foundation ireland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National University Ireland, Galway"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Social bots can cause social, political, and economical disruptions by spreading rumours. The state-of-the-art methods to prevent social bots from spreading rumours are centralised and such solutions may not be accepted by users who may not trust a centralised solution being biased. In this paper, we developed a decentralised method to prevent social bots. In this solution, the users of a social network create a secure and privacy-preserving decentralised social network and may accept social media content if it is sent by its neighbour in the decentralised social network. As users only choose their trustworthy neighbours from the social network to be part of its neighbourhood in the decentralised social network, it prevents the social bots to influence a user to accept and share a rumour. We prove that the proposed solution can significantly reduce the number of users who are share rumour.<\/jats:p>","DOI":"10.1007\/s13278-021-00819-y","type":"journal-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T17:02:21Z","timestamp":1634835741000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Rumour prevention in social networks with layer 2 blockchains"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6579-724X","authenticated-orcid":false,"given":"Subhasis","family":"Thakur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John G.","family":"Breslin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"key":"819_CR7","doi-asserted-by":"publisher","unstructured":"Alzanin SM, Azmi AM (2018) Detecting rumors in social media: a survey. Proc Comput Sci 142:294\u2013300. Arabic Computational Linguistics. https:\/\/doi.org\/10.1016\/j.procs.2018.10.495. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050918322014","DOI":"10.1016\/j.procs.2018.10.495"},{"key":"819_CR8","doi-asserted-by":"publisher","unstructured":"Bahri L, Carminati B, Ferrari E (2018) Decentralized privacy preserving services for online social networks. Online Social Networks and Media 6:18\u201325. https:\/\/doi.org\/10.1016\/j.osnem.2018.02.001. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2468696417301040","DOI":"10.1016\/j.osnem.2018.02.001"},{"key":"819_CR9","doi-asserted-by":"publisher","unstructured":"Chunaev P (2020) Community detection in node-attributed social networks: a survey. Computer Science Review 37. https:\/\/doi.org\/10.1016\/j.cosrev.2020.100286.https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1574013720303865","DOI":"10.1016\/j.cosrev.2020.100286."},{"key":"819_CR10","doi-asserted-by":"publisher","unstructured":"Comito C (2020) Next: a framework for next-place prediction on location based social networks. Knowl Based Syst 204:106205. https:\/\/doi.org\/10.1016\/j.knosys.2020.106205. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S095070512030424X","DOI":"10.1016\/j.knosys.2020.106205"},{"key":"819_CR11","doi-asserted-by":"crossref","unstructured":"Comito C, Forestiero A, Pizzuti C (2019) Word embedding based clustering to detect topics in social media. In: 2019 IEEE\/WIC\/ACM international conference on web intelligence (WI), pp 192\u2013199","DOI":"10.1145\/3350546.3352518"},{"key":"819_CR12","doi-asserted-by":"crossref","unstructured":"Dongqi Fu, Liri Fang (2016) Blockchain-based trusted computing in social network. In: 2016 2nd IEEE international conference on computer and communications (ICCC), pp 19\u201322","DOI":"10.1109\/CompComm.2016.7924656"},{"key":"819_CR2","unstructured":"Dpos consensus algorithm\u2014the missing white paper. https:\/\/steemit.com\/dpos\/@dantheman\/dpos-consensus-algorithm-this-missing-white-paper. Accessed: 17-02-2021"},{"key":"819_CR13","unstructured":"Foresting: rewarding lifestyle social media (2019). https:\/\/cdn.foresting.io\/pdf\/whitepaper\/FORESTING_Whitepaper_Eng_Ver.1.0.pdf?ver0.2"},{"key":"819_CR14","doi-asserted-by":"publisher","unstructured":"Freni P, Ferro E, Ceci G (2020) Fixing social media with the blockchain. In: Proceedings of the 6th EAI international conference on smart objects and technologies for social good, GoodTechs \u201920. Association for Computing Machinery, New York, NY, USA, pp 175\u2013180. https:\/\/doi.org\/10.1145\/3411170.3411246","DOI":"10.1145\/3411170.3411246"},{"key":"819_CR15","doi-asserted-by":"crossref","unstructured":"Guidi B (2020) When blockchain meets online social networks. Pervasive Mobile Comput 62:101131","DOI":"10.1016\/j.pmcj.2020.101131"},{"key":"819_CR16","doi-asserted-by":"publisher","unstructured":"Guidi B, Clemente V, Garc\u00eda T, Ricci L (2020) A rewarding model for the next generation social media. In: Proceedings of the 6th EAI international conference on smart objects and technologies for social good, GoodTechs \u201920, pp 169\u2013174. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3411170.3411247","DOI":"10.1145\/3411170.3411247"},{"issue":"2","key":"819_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: A survey. SIGMOD Rec. 42(2):17\u201328. https:\/\/doi.org\/10.1145\/2503792.2503797","journal-title":"SIGMOD Rec."},{"issue":"1","key":"819_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/TDSC.2016.2522436","volume":"15","author":"J Jiang","year":"2018","unstructured":"Jiang J, Wen S, Yu S, Xiang Y, Zhou W (2018) Rumor source identification in social networks with time-varying topology. IEEE Trans Depend Secure Comput 15(1):166\u2013179. https:\/\/doi.org\/10.1109\/TDSC.2016.2522436","journal-title":"IEEE Trans Depend Secure Comput"},{"issue":"6","key":"819_CR19","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/TCSS.2019.2941650","volume":"6","author":"L Jiang","year":"2019","unstructured":"Jiang L, Zhang X (2019) Bcosn: A blockchain-based decentralized online social network. IEEE Trans Comput Social Syst 6(6):1454\u20131466","journal-title":"IEEE Trans Comput Social Syst"},{"key":"819_CR20","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201903, p. 137\u2013146. Association for Computing Machinery, New York, NY, USA.https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"819_CR21","unstructured":"Kiayias A, Livshits B, Mosteiro AM, Litos OST (2018) A puff of steem: security analysis of decentralized content curation. CoRR arXiv:abs\/1810.01719"},{"issue":"1","key":"819_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0168344","volume":"12","author":"S Kwon","year":"2017","unstructured":"Kwon S, Cha M, Jung K (2017) Rumor detection over varying time windows. PLOS ONE 12(1):1\u201319. https:\/\/doi.org\/10.1371\/journal.pone.0168344","journal-title":"PLOS ONE"},{"key":"819_CR23","unstructured":"Lendvai P, Reichel UD (2016) Contradiction detection for rumorous claims. arXiv:abs\/1611.02588"},{"key":"819_CR24","unstructured":"Leskovec J, Mcauley J (2012) Learning to discover social circles in ego networks. In: F.\u00a0Pereira, C.J.C. Burges, L.\u00a0Bottou, K.Q. Weinberger (eds.) Advances in neural information processing systems, vol.\u00a025. Curran Associates, Inc. (2012). https:\/\/proceedings.neurips.cc\/paper\/2012\/file\/7a614fd06c325499f1680b9896beedeb-Paper.pdf"},{"key":"819_CR25","doi-asserted-by":"publisher","unstructured":"Li C, Palanisamy B (2019) Incentivized blockchain-based social media platforms: a case study of steemit. In: Proceedings of the 10th ACM conference on web science, WebSci \u201919, p. 145\u2013154. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3292522.3326041","DOI":"10.1145\/3292522.3326041"},{"key":"819_CR26","doi-asserted-by":"publisher","unstructured":"Liang G, He W, Xu C, Chen L, Zeng J (2015) Rumor identification in microblogging systems based on users\u2019 behavior. IEEE Trans Comput Soc Syst 2(3):99\u2013108. https:\/\/doi.org\/10.1109\/TCSS.2016.2517458","DOI":"10.1109\/TCSS.2016.2517458"},{"key":"819_CR27","doi-asserted-by":"publisher","unstructured":"Liu X, Nourbakhsh A, Li Q, Fang R, Shah S (2015) Real-time rumor debunking on twitter. In: Proceedings of the 24th ACM international on conference on information and knowledge management, CIKM \u201915, p. 1867\u20131870. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/2806416.2806651","DOI":"10.1145\/2806416.2806651"},{"key":"819_CR28","unstructured":"Ltd S (2018) The socialx ecosystem takes the social media experience to the next level (2018). https:\/\/socialx.network\/wp-content\/uploads\/2018\/ 09\/Whitepaper- SocialX- v1.1.pdf"},{"key":"819_CR29","doi-asserted-by":"publisher","unstructured":"McCreadie R, Macdonald C, Ounis I (2015) Crowdsourced rumour identification during emergencies. In: Proceedings of the 24th international conference on world wide web, WWW \u201915 Companion, pp 965\u2013970. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/2740908.2742573","DOI":"10.1145\/2740908.2742573"},{"key":"819_CR30","unstructured":"Minds: the crypto social network (2019). https:\/\/cdn-assets.minds.com\/front\/dist\/en\/assets\/documents\/Whitepaper-v0.5.pdf"},{"key":"819_CR3","unstructured":"Mith. https:\/\/mith.io\/en-US\/. Accessed: 17-02-2021"},{"key":"819_CR4","unstructured":"Most americans think social media sites censor political viewpoints. https:\/\/www.pewresearch.org\/internet\/2020\/08\/19\/most-americans-think-social-media-sites-censor-political-viewpoints\/. Accessed: 17-02-2021"},{"key":"819_CR31","unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. www.bitcoin.org"},{"key":"819_CR32","doi-asserted-by":"publisher","unstructured":"Pathak AR, Mahajan A, Singh K, Patil A, Nair A (2020) Analysis of techniques for rumor detection in social media. Proc Comput Sci 167:2286 \u2013 2296. https:\/\/doi.org\/10.1016\/j.procs.2020.03.281. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S187705092030747X. International Conference on Computational Intelligence and Data Science","DOI":"10.1016\/j.procs.2020.03.281"},{"key":"819_CR33","unstructured":"Poon J, Dryja T (2016) The bitcoin lightning network: scalable off-chain instant payments. https:\/\/lightning.network\/lightning-network-paper.pdf"},{"key":"819_CR34","doi-asserted-by":"publisher","unstructured":"Salem S, Banitaan S, Aljarah I, Brewer JE, Alroobi R (2011) Discovering communities in social networks using topology and attributes. In: 2011 10th International conference on machine learning and applications and workshops, vol\u00a01, pp 40\u201343. https:\/\/doi.org\/10.1109\/ICMLA.2011.57","DOI":"10.1109\/ICMLA.2011.57"},{"key":"819_CR35","doi-asserted-by":"publisher","unstructured":"Schreckenberger C, Beckmann S, Bartelt C (2018) Next place prediction: a systematic literature review. In: Proceedings of the 2nd ACM SIGSPATIAL workshop on prediction of human mobility, PredictGIS 2018, pp 37\u201345. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3283590.3283596","DOI":"10.1145\/3283590.3283596"},{"key":"819_CR36","doi-asserted-by":"publisher","unstructured":"Shao C, Ciampaglia GL, Flammini A, Menczer F (2016) Hoaxy: A platform for tracking online misinformation. In: Proceedings of the 25th international conference companion on world wide web, WWW \u201916 companion, pp 745\u2013750. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE. https:\/\/doi.org\/10.1145\/2872518.2890098","DOI":"10.1145\/2872518.2890098"},{"key":"819_CR5","unstructured":"Social media: Is it really biased against us republicans? https:\/\/www.bbc.com\/news\/technology-54698186. Accessed: 17-02-2021"},{"key":"819_CR37","doi-asserted-by":"publisher","unstructured":"Takayasu M, Sato K, Sano Y, Yamada K, Miura W, Takayasu H (2015) Rumor diffusion and convergence during the 3.11 earthquake: a twitter case study. PLOS ONE 10(4):1\u201318. https:\/\/doi.org\/10.1371\/journal.pone.0121443","DOI":"10.1371\/journal.pone.0121443"},{"key":"819_CR1","unstructured":"The cost of fake news for the s&p 500. https:\/\/seekingalpha.com\/article\/4129355-cost-of-fake-news-for-s-and-p-500. Accessed: 17-02-2021"},{"key":"819_CR6","unstructured":"The economic cost of bad actors on the internet: fake news in 2019. https:\/\/www.cheq.ai\/fakenews. Accessed: 17-02-2021"},{"key":"819_CR38","doi-asserted-by":"publisher","unstructured":"Tong GA, Wu W, Guo L, Li D, Liu C, Liu B, Du DZ (2017) An efficient randomized algorithm for rumor blocking in online social networks. In: IEEE INFOCOM 2017\u2014IEEE conference on computer communications, pp 1\u20139. https:\/\/doi.org\/10.1109\/INFOCOM.2017.8056957","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"819_CR39","doi-asserted-by":"publisher","unstructured":"Ur Rahman M, Guidi B, Baiardi F (2020) Blockchain-based access control management for decentralized online social networks. J Parall Distrib Comput 144:41\u201354. https:\/\/doi.org\/10.1016\/j.jpdc.2020.05.011.http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731520302902","DOI":"10.1016\/j.jpdc.2020.05.011."},{"key":"819_CR40","doi-asserted-by":"crossref","unstructured":"Xu Q, Song Z, Mong Goh RS, Li Y (2018) Building an ethereum and ipfs-based decentralized social network system. In: 2018 IEEE 24th international conference on parallel and distributed systems (ICPADS), pp 1\u20136","DOI":"10.1109\/PADSW.2018.8645058"},{"key":"819_CR41","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-030-59016-1_52","volume-title":"Wireless algorithms, systems, and applications","author":"F Yang","year":"2020","unstructured":"Yang F, Pu Y, Hu C, Zhou Y (2020) A blockchain-based privacy-preserving mechanism for attribute matching in social networks. In: Yu D, Dressler F, Yu J (eds) Wireless algorithms, systems, and applications. Springer International Publishing, Cham, pp 627\u2013639"},{"key":"819_CR42","doi-asserted-by":"publisher","first-page":"150902","DOI":"10.1109\/ACCESS.2020.3016986","volume":"8","author":"F Yang","year":"2020","unstructured":"Yang F, Wang Y, Fu C, Hu C, Alrawais A (2020) An efficient blockchain-based bidirectional friends matching scheme in social networks. IEEE Access 8:150902\u2013150913","journal-title":"IEEE Access"},{"issue":"2","key":"819_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3161603","volume":"51","author":"A Zubiaga","year":"2018","unstructured":"Zubiaga A, Aker A, Bontcheva K, Liakata M, Procter R (2018) Detection and resolution of rumours in social media. ACM Comput Surv 51(2):1\u201336. https:\/\/doi.org\/10.1145\/3161603","journal-title":"ACM Comput Surv"},{"key":"819_CR44","doi-asserted-by":"publisher","unstructured":"Zubiaga A, Aker A, Bontcheva K, Liakata M, Procter R (2018) Detection and resolution of rumours in social media: a survey. ACM Comput Surv 51(2). https:\/\/doi.org\/10.1145\/3161603","DOI":"10.1145\/3161603"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00819-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00819-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00819-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T14:37:50Z","timestamp":1637419070000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00819-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,21]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["819"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00819-y","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,21]]},"assertion":[{"value":"11 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"104"}}