{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:07:54Z","timestamp":1742940474107,"version":"3.40.3"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031449192"},{"type":"electronic","value":"9783031449208"}],"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-44920-8_4","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T07:02:17Z","timestamp":1696057337000},"page":"54-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["SoK: X-assisted BFT Consensus Protocols"],"prefix":"10.1007","author":[{"given":"Gang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Nixon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,1]]},"reference":[{"key":"4_CR1","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Tech. Rep, Manubot (2008)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3436728","volume":"54","author":"T Distler","year":"2021","unstructured":"Distler, T.: Byzantine fault-tolerant state-machine replication from a systems perspective. ACM Comput. Surv. (CSUR) 54(1), 1\u201338 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Maric, O., Sprenger, C., Basin, D.: Consensus refined. In: 2015 45th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, pp. 391\u2013402. IEEE (2015)","DOI":"10.1109\/DSN.2015.38"},{"key":"4_CR4","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one fault process. YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE, Technical report (1982)"},{"issue":"2\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-002-0081-5","volume":"16","author":"J Aspnes","year":"2003","unstructured":"Aspnes, J.: Randomized protocols for asynchronous consensus. Distrib. Comput. 16(2\u20133), 165\u2013175 (2003)","journal-title":"Distrib. Comput."},{"key":"4_CR6","unstructured":"Wang, G.: Sok: understanding BFT consensus in the age of blockchains. Cryptology ePrint Archive (2021)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Gueta, G.G., et al.: Sbft: a scalable and decentralized trust infrastructure. In: 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568\u2013580. IEEE (2019)","DOI":"10.1109\/DSN.2019.00063"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Behl, J., Distler, T., Kapitza, R.: Hybrids on steroids: Sgx-based high performance bft. In: Proceedings of the Twelfth European Conference on Computer Systems, pp. 222\u2013237 (2017)","DOI":"10.1145\/3064176.3064213"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2018.2860009","volume":"68","author":"J Liu","year":"2018","unstructured":"Liu, J., Li, W., Karame, G.O., Asokan, N.: Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Trans. Comput. 68(1), 139\u2013151 (2018)","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"4_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/1323293.1294280","volume":"41","author":"B-G Chun","year":"2007","unstructured":"Chun, B.-G., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. ACM SIGOPS Operating Syst. Rev. 41(6), 189\u2013204 (2007)","journal-title":"ACM SIGOPS Operating Syst. Rev."},{"key":"4_CR11","unstructured":"Levin, D., Douceur, J.R., Lorch, J.R., Moscibroda, T.: Trinc: small trusted hardware for large distributed systems. In: NSDI, vol. 9, pp. 1\u201314 (2009)"},{"key":"4_CR12","unstructured":"Kinney, S.L.: Trusted platform module basics: using TPM in embedded systems. Elsevier (2006)"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"GS Veronese","year":"2011","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C., Verissimo, P.: Efficient byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16\u201330 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR14","unstructured":"Ryan, M.: Introduction to the tpm 1.2. DRAFT of March, vol. 24 (2009)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kapitza, R., et al.: Cheapbft: resource-efficient byzantine fault tolerance. In: Proceedings of the 7th ACM European Conference on Computer Systems, pp. 295\u2013308 (2012)","DOI":"10.1145\/2168836.2168866"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"McKeen, F., et al.: Innovative instructions and software model for isolated execution. Hasp@ isca, vol. 10, no. 1 (2013)","DOI":"10.1145\/2487726.2488368"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Gunn, L.J., Liu, J., Vavala, B., Asokan, N.: Making speculative BFT resilient with trusted monotonic counters. In: 2019 38th Symposium on Reliable Distributed Systems (SRDS), pp. 133\u201313 309. IEEE (2019)","DOI":"10.1109\/SRDS47363.2019.00024"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: Tbft: understandable and efficient byzantine fault tolerance using trusted execution environment. arXiv preprint arXiv:2102.01970 (2021)","DOI":"10.1109\/ICC45855.2022.9839169"},{"key":"4_CR19","unstructured":"Yandamuri, S., Abraham, I., Nayak, K., Reiter, M.K.: Communication-efficient bft using small trusted hardware to tolerate minority corruption. In: 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Wang, W., Deng, S., Niu, J., Reiter, M.K., Zhang, Y.: Engraft: enclave-guarded raft on byzantine faulty nodes. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2841\u20132855 (2022)","DOI":"10.1145\/3548606.3560639"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Ben-David, N., Guerraoui, R., Murat, A., Xygkis, A., Zablotchi, I.: UBFT: microsecond-scale BFT using disaggregated memory. In: Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, vol. 2, pp. 862\u2013877 (2023)","DOI":"10.1145\/3575693.3575732"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Feng, L., Ding, Y., Tan, Y., Fu, X., Wang, K., sheng Chang, J.: Trusted-committee-based secure and scalable BFT consensus for consortium blockchain. In: 2022 18th International Conference on Mobility, Sensing and Networking (MSN), pp. 363\u2013370. IEEE (2022)","DOI":"10.1109\/MSN57253.2022.00066"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Decouchant, J., Kozhaya, D., Rahli, V., Yu, J.: Damysus: streamlined BFT consensus leveraging trusted components. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 1\u201316 (2022)","DOI":"10.1145\/3492321.3519568"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Messadi, I., Becker, M.H., Bleeke, K., Jehl, L., Mokhtar, S.B., Kapitza, R.: Splitbft: improving byzantine fault tolerance safety using trusted compartments. In: Proceedings of the 23rd ACM\/IFIP International Middleware Conference, pp. 56\u201368 (2022)","DOI":"10.1145\/3528535.3531516"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Wang, G., Nixon, M.: Intertrust: towards an efficient blockchain interoperability architecture with trusted services. In: 2021 IEEE International Conference on Blockchain (Blockchain), pp. 150\u2013159. IEEE (2021)","DOI":"10.1109\/Blockchain53845.2021.00029"},{"issue":"2","key":"4_CR26","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."},{"key":"4_CR27","unstructured":"Liu, S., Viotti, P., Cachin, C., Qu\u00e9ma, V., Vukoli\u0107, M.: XFT: practical fault tolerance beyond crashes. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pp. 485\u2013500 (2016)"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/inco.1995.1060","volume":"118","author":"F Cristian","year":"1995","unstructured":"Cristian, F., Aghili, H., Strong, R., Dolev, D.: Atomic broadcast: From simple message diffusion to byzantine agreement. Inf. Comput. 118(1), 158\u2013179 (1995)","journal-title":"Inf. Comput."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. (CSUR) 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"3","key":"4_CR30","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":"4_CR31","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J., et al.: Towards optimal distributed consensus. In: FOCS, vol. 89. Citeseer, pp. 410\u2013415 (1989)","DOI":"10.1109\/SFCS.1989.63511"},{"issue":"4","key":"4_CR32","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS) 20(4), 398\u2013461 (2002)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kne\u017eevi\u0107, N., Qu\u00e9ma, V., Vukoli\u0107, M.: The next 700 bft protocols. In: Proceedings of the 5th European Conference on Computer Systems, pp. 363\u2013376 (2010)","DOI":"10.1145\/1755913.1755950"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Byzantizing paxos by refinement. In: International Symposium on Distributed Computing. Springer, pp. 211\u2013224 (2011)","DOI":"10.1007\/978-3-642-24100-0_22"},{"key":"4_CR35","unstructured":"Sheff, I., Wang, X., van Renesse, R., Myers, A.C.: Heterogeneous paxos. In: 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"4","key":"4_CR36","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1711475.1711494","volume":"40","author":"P Kuznetsov","year":"2010","unstructured":"Kuznetsov, P., Rodrigues, R.: Bftw3: why? when? where? workshop on the theory and practice of byzantine fault tolerance. ACM SIGACT News 40(4), 82\u201386 (2010)","journal-title":"ACM SIGACT News"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Porto, D., et al.: Visigoth fault tolerance. In: Proceedings of the Tenth European Conference on Computer Systems, pp. 1\u201314 (2015)","DOI":"10.1145\/2741948.2741979"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Thambidurai, P., Park, Y.-K.: Interactive consistency with multiple failure modes. In: Proceedings Seventh Symposium on Reliable Distributed Systems. IEEE Computer Society, pp. 93\u201394 (1988)","DOI":"10.1109\/RELDIS.1988.25784"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Clement, A.: Upright cluster services. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 277\u2013290 (2009)","DOI":"10.1145\/1629575.1629602"},{"issue":"5","key":"4_CR40","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1067627.806586","volume":"15","author":"JM Rushby","year":"1981","unstructured":"Rushby, J.M.: Design and verification of secure systems. ACM SIGOPS Operat. Syst. Rev. 15(5), 12\u201321 (1981)","journal-title":"ACM SIGOPS Operat. Syst. Rev."},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C.: Ebawa: efficient byzantine agreement for wide-area networks. In: IEEE 12th International Symposium on High Assurance Systems Engineering. IEEE 2010, pp. 10\u201319 (2010)","DOI":"10.1109\/HASE.2010.19"},{"key":"4_CR42","unstructured":"Anati, I., Gueron, S., Johnson, S., Scarlata, V.: Innovative technology for CPU based attestation and sealing. In: Proceedings of the 2nd International Workshop on Hardware and Architectural Support for security and privacy, vol. 13, p. 7. ACM, New York (2013)"},{"key":"4_CR43","unstructured":"A. ARM: Security technology-building a secure system using trustzone technology. ARM Technical White Paper (2009)"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"R\u00fcsch, S., Bleeke, K., Kapitza, R.: Bloxy: providing transparent and generic bft-based ordering services for blockchains. In: 2019 38th Symposium on Reliable Distributed Systems (SRDS), pp. 305\u201330 509. IEEE (2019)","DOI":"10.1109\/SRDS47363.2019.00043"},{"issue":"2","key":"4_CR45","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jss.2006.03.034","volume":"80","author":"M Correia","year":"2007","unstructured":"Correia, M., Neves, N.F., Lung, L.C., Ver\u00edssimo, P.: Worm-it-a wormhole-based intrusion-tolerant group communication system. J. Syst. Softw. 80(2), 178\u2013197 (2007)","journal-title":"J. Syst. Softw."},{"issue":"2","key":"4_CR46","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJCCBS.2011.041257","volume":"2","author":"M Correia","year":"2011","unstructured":"Correia, M., Veronese, G.S., Neves, N.F., Verissimo, P.: Byzantine consensus in asynchronous message-passing systems: a survey. Int. J. Critical Comput.-Based Syst. 2(2), 141\u2013161 (2011)","journal-title":"Int. J. Critical Comput.-Based Syst."},{"key":"4_CR47","unstructured":"Distler, T., Popov, I., Schr\u00f6der-Preikschat, W., Reiser, H.P., Kapitza, R.: Spare: replicas on hold. In: NDSS (2011)"},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"Garcia, M., Bessani, A., Neves, N.: Lazarus: automatic management of diversity in bft systems. In: Proceedings of the 20th International Middleware Conference, pp. 241\u2013254 (2019)","DOI":"10.1145\/3361525.3361550"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Reiser, H.P., Kapitza, R.: Hypervisor-based efficient proactive recovery. In: 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). IEEE 2007, pp. 83\u201392 (2007)","DOI":"10.1109\/SRDS.2007.25"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous byzantine agreement with expected o (1) rounds, expected $$ o (^{n} 2)$$ communication, and optimal resilience. In: International Conference on Financial Cryptography and Data Security, pp. 320\u2013334. Springer (2019)","DOI":"10.1007\/978-3-030-32101-7_20"},{"issue":"1","key":"4_CR51","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/200836.200870","volume":"42","author":"D Dolev","year":"1995","unstructured":"Dolev, D., Halpern, J.Y., Simons, B., Strong, R.: Dynamic fault-tolerant clock synchronization. J. ACM (JACM) 42(1), 143\u2013185 (1995)","journal-title":"J. ACM (JACM)"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"Simons, B.: An overview of clock synchronization. In: Fault-Tolerant Distributed Computing, pp. 84\u201396 (1990)","DOI":"10.1007\/BFb0042327"},{"key":"4_CR53","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: Bft consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"},{"key":"4_CR54","unstructured":"Bravo, M., Chockler, G., Gotsman, A.: Making byzantine consensus live. In: 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"4_CR55","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: 25th usenix security symposium (usenix security 16), pp. 279\u2013296 (2016)"},{"issue":"4","key":"4_CR56","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Distrib. Comput. 11(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"key":"4_CR57","doi-asserted-by":"crossref","unstructured":"Syta, E., et al.: Keeping authorities \u201chonest or bust\u201d with decentralized witness cosigning. In: IEEE Symposium on Security and Privacy (SP). IEEE 2016, pp. 526\u2013545 (2016)","DOI":"10.1109\/SP.2016.38"},{"key":"4_CR58","unstructured":"Dang, H., Dinh, A., Chang, E.-C., Ooi, B.C.: Chain of trust: can trusted hardware help scaling blockchains? arXiv preprint arXiv:1804.00399 (2018)"},{"issue":"086","key":"4_CR59","first-page":"1","volume":"2016","author":"V Costan","year":"2016","unstructured":"Costan, V., Devadas, S.: Intel sgx explained. IACR Cryptology ePrint Archive 2016(086), 1\u2013118 (2016)","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"4","key":"4_CR60","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MSP.2014.38","volume":"12","author":"J-E Ekberg","year":"2014","unstructured":"Ekberg, J.-E., Kostiainen, K., Asokan, N.: The untapped potential of trusted execution environments on mobile devices. IEEE Secur. Privacy 12(4), 29\u201337 (2014)","journal-title":"IEEE Secur. Privacy"},{"key":"4_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"4_CR62","unstructured":"Stathakopoulous, C., Cachin, C.: Threshold signatures for blockchain systems. Swiss Federal Institute of Technology (2017)"}],"container-title":["Lecture Notes in Computer Science","Blockchain \u2013 ICBC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44920-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:13:45Z","timestamp":1730225625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44920-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031449192","9783031449208"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44920-8_4","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":"1 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICBC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Blockchain","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Honolulu, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"23 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icbc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.servicessociety.org\/icbc","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":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"9","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":"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 (provided by the conference organizers)"}},{"value":"3.0","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":"3.8","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)"}}]}}