{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,25]],"date-time":"2025-12-25T07:26:50Z","timestamp":1766647610936,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031451546"},{"type":"electronic","value":"9783031451553"}],"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-45155-3_44","type":"book-chapter","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T03:02:01Z","timestamp":1699930921000},"page":"459-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["FPCS: Solving n-Spends on\u00a0a\u00a0UTXO-Based DLT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0672-7337","authenticated-orcid":false,"given":"Rafael Cizeski","family":"Nitchai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5076-8048","authenticated-orcid":false,"given":"Serguei","family":"Popov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1250-118X","authenticated-orcid":false,"given":"Sebastian","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,15]]},"reference":[{"key":"44_CR1","doi-asserted-by":"publisher","unstructured":"Popov, S., Buchanan, W.J.: FPC-BI: fast probabilistic consensus within byzantine infrastructures. J. Parallel Distrib. Comput. 147, 77\u201386 (2021). ISSN 0743\u20137315, https:\/\/doi.org\/10.1016\/j.jpdc.2020.09.002","DOI":"10.1016\/j.jpdc.2020.09.002"},{"key":"44_CR2","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-030-63089-8_24","volume-title":"Proceedings of the Future Technologies Conference (FTC) 2020, Volume 2","author":"S M\u00fcller","year":"2021","unstructured":"M\u00fcller, S., Penzkofer, A., Ku\u015bmierz, B., Camargo, D., Buchanan, W.J.: Fast probabilistic consensus with weighted votes. In: Arai, K., Kapoor, S., Bhatia, R. (eds.) FTC 2020. AISC, vol. 1289, pp. 360\u2013378. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-63089-8_24"},{"key":"44_CR3","doi-asserted-by":"publisher","unstructured":"Capossele, A., M\u00fcller, S., Penzkofer, A.: Robustness and efficiency of voting consensus protocols within byzantine infrastructures. Blockchain Res. Appl. 2(1), 00007 (2021). ISSN 2096\u20137209, https:\/\/doi.org\/10.1016\/j.bcra.2021.100007","DOI":"10.1016\/j.bcra.2021.100007"},{"key":"44_CR4","series-title":"Lecture Notes in Networks and Systems","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/978-3-030-80126-7_65","volume-title":"Intelligent Computing","author":"S M\u00fcller","year":"2021","unstructured":"M\u00fcller, S., Penzkofer, A., Camargo, D., Saa, O.: On fairness in voting consensus protocols. In: Arai, K. (ed.) Intelligent Computing. LNNS, vol. 284, pp. 927\u2013939. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80126-7_65"},{"key":"44_CR5","doi-asserted-by":"publisher","unstructured":"Merkle, R.: One Way Hash Functions and DES, pp. 428\u2013446 (1989). https:\/\/doi.org\/10.1007\/0-387-34805-0_40","DOI":"10.1007\/0-387-34805-0_40"},{"issue":"3","key":"44_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00145-005-0318-0","volume":"18","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18(3), 219\u2013246 (2005). https:\/\/doi.org\/10.1007\/s00145-005-0318-0","journal-title":"J. Cryptol."},{"key":"44_CR7","doi-asserted-by":"publisher","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 42\u201351 (1993). https:\/\/doi.org\/10.1145\/167088.167105","DOI":"10.1145\/167088.167105"},{"key":"44_CR8","doi-asserted-by":"publisher","unstructured":"Aguilera, M.K., Toueg, S.: The correctness proof of Ben-Or\u2019s randomized consensus algorithm. Distrib. Comput. 25(5), 371\u2013381 (2012). https:\/\/doi.org\/10.1007\/s00446-012-0162-z","DOI":"10.1007\/s00446-012-0162-z"},{"issue":"1","key":"44_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/RELDIS.2004.1353024","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). https:\/\/doi.org\/10.1109\/RELDIS.2004.1353024","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["Lecture Notes in Networks and Systems","Blockchain and Applications, 5th International Congress"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45155-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T03:07:31Z","timestamp":1699931251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45155-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031451546","9783031451553"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45155-3_44","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BLOCKCHAIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Blockchain and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guimaraes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"12 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"blockchain2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.blockchain-congress.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}