{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:18:31Z","timestamp":1743027511490,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031371042"},{"type":"electronic","value":"9783031371059"}],"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-37105-9_38","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T23:04:56Z","timestamp":1687993496000},"page":"572-583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Combination of P-BFT and RAFT: A New Approach to Building Networks that Provide Reliability and Security"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Bogdanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadezhda","family":"Shchegoleva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valery","family":"Khvatov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennady","family":"Dik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jasur","family":"Kiyamov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandr","family":"Dik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,29]]},"reference":[{"key":"38_CR1","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, pp. 173\u2013186 (1999)"},{"key":"38_CR2","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. CRC Press, Boca Raton (2014)","edition":"2"},{"key":"38_CR3","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008).https:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"3","key":"38_CR4","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)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-031-10536-4_14","volume-title":"Computational Science and Its Applications - ICCSA 2022 Workshops, ICCSA 2022","author":"A Bogdanov","year":"2022","unstructured":"Bogdanov, A., et al.: A multilayer approach to the security of blockchain networks of the future. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Garau, C. (eds.) Computational Science and Its Applications - ICCSA 2022 Workshops, ICCSA 2022. Lecture Notes in Computer Science, vol. 13377, pp. 205\u2013216. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10536-4_14"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Vukoli\u0107, M.: The quest for scalable blockchain fabric: proof-of-work vs. BFT replication. In: IEEE International Conference on Blockchain, pp. 112\u2013121 (2015)","DOI":"10.1007\/978-3-319-39028-4_9"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Xie, S., Dai, H., Chen, X., Wang, H.: An overview of blockchain technology: architecture, consensus, and future trends. In: IEEE International Congress on Big Data, pp. 557\u2013564 (2017)","DOI":"10.1109\/BigDataCongress.2017.85"},{"issue":"2","key":"38_CR8","first-page":"107","volume":"32","author":"R Guerraoui","year":"2019","unstructured":"Guerraoui, R., Kouznetsov, P., Vukoli\u0107, M.: The Paxos-Killer: fault-tolerant Byzantine consensus using linked transactions. Distrib. Comput. 32(2), 107\u2013125 (2019)","journal-title":"Distrib. Comput."},{"key":"38_CR9","unstructured":"Miller, A., Juels, A., Shi, E., Parno, B.: The perils of zero knowledge protocols for blockchains. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (CCS), pp. 905\u2013917 (2017)"},{"issue":"1","key":"38_CR10","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/s00145-015-9220-6","volume":"30","author":"D Dolev","year":"2017","unstructured":"Dolev, D., Fichman, V., Lotker, Z.: The making of a fastest Byzantine fault-tolerant consensus algorithm. J. Cryptol. 30(1), 242\u2013270 (2017)","journal-title":"J. Cryptol."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Vadhan, S.: Verifiable random functions. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 120\u2013130 (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-39028-4_9","volume-title":"Open Problems in Network Security","author":"M Vukoli\u0107","year":"2016","unstructured":"Vukoli\u0107, M.: The quest for scalable blockchain fabric: proof-of-work vs. BFT replication. In: Camenisch, J., Kesdo\u011fan, D. (eds.) iNetSec 2015. LNCS, vol. 9591, pp. 112\u2013125. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39028-4_9"},{"key":"38_CR13","unstructured":"Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: USENIX Annual Technical Conference, pp. 305\u2013320 (2014)"},{"issue":"2","key":"38_CR14","first-page":"51","volume":"47","author":"HG Howard","year":"2016","unstructured":"Howard, H.G., Malkhi, D.: A brief survey of practical Byzantine fault tolerance. ACM SIGACT News 47(2), 51\u201359 (2016)","journal-title":"ACM SIGACT News"},{"issue":"2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37105-9_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T04:32:11Z","timestamp":1736569931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37105-9_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031371042","9783031371059"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37105-9_38","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":"29 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Custom based on Cyberchair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"283","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":"67","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":"13","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":"24% - 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":"2.5","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":"8,5","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)"}},{"value":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}