{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:55:10Z","timestamp":1743155710297,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031414558"},{"type":"electronic","value":"9783031414565"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-41456-5_29","type":"book-chapter","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T23:02:43Z","timestamp":1694559763000},"page":"379-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Two-Hop Neighborhood Based Berserk Detection Algorithm for\u00a0Probabilistic Model of\u00a0Consensus in\u00a0Distributed Ledger Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4888-7782","authenticated-orcid":false,"given":"Deepanjan","family":"Mitra","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0946-5440","authenticated-orcid":false,"given":"Agostino","family":"Cortesi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3242-680X","authenticated-orcid":false,"given":"Nabendu","family":"Chaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,13]]},"reference":[{"key":"29_CR1","unstructured":"Nakamoto, S., Bitcoin, A.: A peer-to-peer electronic cash system. Bitcoin (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"29_CR2","first-page":"22","volume":"1","author":"V Buterin","year":"2013","unstructured":"Buterin, V.: Ethereum white paper. GitHub Repository 1, 22\u201323 (2013)","journal-title":"GitHub Repository"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1093\/rfs\/hhaa075","volume":"34","author":"F Saleh","year":"2021","unstructured":"Saleh, F.: Blockchain without waste: proof-of-stake. Rev. Financ. Stud. 34(3), 1156\u20131190 (2021)","journal-title":"Rev. Financ. Stud."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chauhan, A., Malviya, O.P., Verma, M., der Singh Mor, T.: Blockchain and scalability. In: 2018 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C), pp. 122\u2013128. IEEE (2018)","DOI":"10.1109\/QRS-C.2018.00034"},{"issue":"10","key":"29_CR6","first-page":"2099","volume":"55","author":"P Chen","year":"2018","unstructured":"Chen, P., Zhiqiang, L., Zhen, L., Long, Yu.: Research on scalability of blockchain technology: problems and methods. J. Comput. Res. Dev. 55(10), 2099 (2018)","journal-title":"J. Comput. Res. Dev."},{"issue":"4","key":"29_CR7","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1214\/aop\/1176996306","volume":"3","author":"RA Holley","year":"1975","unstructured":"Holley, R.A., Liggett, T.M., et al.: Ergodic theorems for weakly inter- acting infinite systems and the voter model. Ann. Probab. 3(4), 643\u2013663 (1975)","journal-title":"Ann. Probab."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BFb0035770","volume-title":"Automata, Languages and Programming","author":"P Feldman","year":"1989","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic algorithm for synchronous Byzantine agreement. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 341\u2013378. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035770"},{"key":"29_CR10","series-title":"Lecture Notes in Networks and Systems","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-030-81523-3_5","volume-title":"Progress in Image Processing, Pattern Recognition and Communication Systems","author":"D Mitra","year":"2022","unstructured":"Mitra, D., Cortesi, A., Chaki, N.: ALEA: an anonymous leader election algorithm for synchronous distributed systems. In: Chora\u015b, M., Chora\u015b, R.S., Kurzy\u0144ski, M., Trajdos, P., Peja\u015b, J., Hyla, T. (eds.) CORES\/IP &C\/ACS -2021. LNNS, vol. 255, pp. 46\u201358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-81523-3_5"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/TDSC.2005.13","volume":"2","author":"R Friedman","year":"2005","unstructured":"Friedman, R., Mostefaoui, A., Raynal, M.: Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems. IEEE Trans. Dependable Secure Comput. 2(1), 46\u201356 (2005)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TSP.2008.2007335","volume":"57","author":"S Marano","year":"2008","unstructured":"Marano, S., Matta, V., Tong, L.: Distributed detection in the presence of Byzantine attacks. IEEE Trans. Signal Process. 57(1), 16\u201329 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"9","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1514","DOI":"10.1109\/TMC.2011.160","volume":"11","author":"E Ayday","year":"2011","unstructured":"Ayday, E., Fekri, F.: An iterative algorithm for trust management and adversary detection for delay-tolerant networks. IEEE Trans. Mob. Comput. 11(9), 1514\u20131531 (2011)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"6","key":"29_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/MNET.2019.1900025","volume":"33","author":"Y Dong","year":"2019","unstructured":"Dong, Y., et al.: Secure distributed on-device learning networks with byzantine adversaries. IEEE Netw. 33(6), 180\u2013187 (2019)","journal-title":"IEEE Netw."},{"issue":"19","key":"29_CR16","doi-asserted-by":"publisher","first-page":"5250","DOI":"10.1109\/TSP.2015.2450191","volume":"63","author":"B Kailkhura","year":"2015","unstructured":"Kailkhura, B., et al.: Distributed Bayesian detection in the presence of Byzantine data. IEEE Trans. Signal Process. 63(19), 5250\u20135263 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jpdc.2020.09.002","volume":"147","author":"Serguei Popov","year":"2021","unstructured":"Popov, Serguei, Buchanan, William J.: FPC-BI: fast probabilistic consensus within Byzantine infrastructures. J. Parallel Distrib. Comput. 147, 77\u201386 (2021). https:\/\/doi.org\/10.1016\/j.jpdc.2020.09.002. ISSN 0743-7315","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"100007","DOI":"10.1016\/j.bcra.2021.100007","volume":"2","author":"A Capossele","year":"2021","unstructured":"Capossele, A., M\u00fcller, S., Penzkofer, A.: Robustness and efficiency of voting consensus protocols within byzantine infrastructures. Blockchain Res. Appl. 2(1), 100007 (2021). https:\/\/doi.org\/10.1016\/j.bcra.2021.100007. ISSN 2096-7209","journal-title":"Blockchain Res. Appl."},{"key":"29_CR19","unstructured":"Popov, S., et al.: The coordicide, pp. 1\u201330 (2020)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-48910-x_21","volume-title":"Advances in Cryptology\u2013EUROCRYPT 1999","author":"R Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295\u2013310. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-x_21"},{"key":"29_CR21","doi-asserted-by":"publisher","unstructured":"Kokoris Kogias, E., Malkhi, D., Spiegelman, A.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (CCS 2020), pp. 1751\u20131767. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3372297.3423364","DOI":"10.1145\/3372297.3423364"},{"key":"29_CR22","doi-asserted-by":"publisher","unstructured":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris-Kogias, L., Ren, L.: Practical asynchronous distributed key generation. In: 2022 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, pp. 2518\u20132534 (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833584","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"104270","DOI":"10.1016\/j.robot.2022.104270","volume":"159","author":"P Mahato","year":"2023","unstructured":"Mahato, P., Saha, S., Chayan, S., Shaghil, M.: Consensus-based, fast and energy-efficient multi-robot task allocation. Robot. Auton. Syst. 159, 104270 (2023). https:\/\/doi.org\/10.1016\/j.robot.2022.104270. ISSN 0921-8890","journal-title":"Robot. Auton. Syst."},{"key":"29_CR24","unstructured":"Olfati-Saber, R., Shamma, J.S.: Consensus filters for sensor networks and distributed sensor fusion. In: Proceedings of the 44th IEEE Conference on Decision and Control. IEEE (2005)"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2018.08.001","volume":"758","author":"S Bonomi","year":"2019","unstructured":"Bonomi, S., Del Pozzo, A., Potop-Butucaru, M., Tixeuil, S.: Approximate agreement under mobile Byzantine faults. Theor. Comput. Sci. 758, 17\u201329 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR26","unstructured":"Gorbunov, S., Wee, H.: Digital signatures for consensus. Cryptology ePrint Archive (2019)"},{"issue":"2-3","key":"29_CR27","first-page":"203","volume":"136","author":"Y-M Tseng","year":"2003","unstructured":"Tseng, Y.-M., Jan, J.-K., Chien, H.-Y.: Digital signature with message recovery using self-certified public keys and its variants. Appl. Math. Comput. 136(2\u20133), 203\u2013214 (2003)","journal-title":"Appl. Math. Comput."},{"issue":"6684","key":"29_CR28","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41456-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T23:07:11Z","timestamp":1694560031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41456-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031414558","9783031414565"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41456-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"218","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":"59","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":"0","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":"27% - 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.01","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":"1.86","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}