{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:00Z","timestamp":1750221000349,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:00:00Z","timestamp":1564963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"The National Key R&D Program of China","award":["2018YFB0203803"],"award-info":[{"award-number":["2018YFB0203803"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1711263, U1801266"],"award-info":[{"award-number":["U1711263, U1801266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Guangdong, China","award":["2018A030313492, 2018B030312002"],"award-info":[{"award-number":["2018A030313492, 2018B030312002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,5]]},"DOI":"10.1145\/3337821.3337885","type":"proceedings-article","created":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T12:34:36Z","timestamp":1564058076000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["COMBFT"],"prefix":"10.1145","author":[{"given":"Yingyao","family":"Rong","sequence":"first","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weigang","family":"Wu","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiguang","family":"Chen","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,8,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.70"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/121132.121164"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_36"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare Ran Canetti and Hugo Krawczyk. 1996. Keying Hash Functions for Message Authentication. (1996) 1--15.   Mihir Bellare Ran Canetti and Hugo Krawczyk. 1996. Keying Hash Functions for Message Authentication. (1996) 1--15.","DOI":"10.1007\/3-540-68697-5_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. 1996. The exact security of digital signatures-how to sign with RSA and Rabin. (1996) 399--416.   Mihir Bellare and Phillip Rogaway. 1996. The exact security of digital signatures-how to sign with RSA and Rabin. (1996) 399--416.","DOI":"10.1007\/3-540-68339-9_34"},{"key":"e_1_3_2_1_6_1","volume-title":"Practical Byzantine fault tolerance. operating systems design and implementation","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov . 1999. Practical Byzantine fault tolerance. operating systems design and implementation ( 1999 ), 173--186. Miguel Castro and Barbara Liskov. 1999. Practical Byzantine fault tolerance. operating systems design and implementation (1999), 173--186."},{"key":"e_1_3_2_1_7_1","unstructured":"Allen Clement Edmund L Wong Lorenzo Alvisi Michael Dahlin and Mirco Marchetti. 2009. Making Byzantine fault tolerant systems tolerate Byzantine faults. (2009) 153--168.   Allen Clement Edmund L Wong Lorenzo Alvisi Michael Dahlin and Mirco Marchetti. 2009. Making Byzantine fault tolerant systems tolerate Byzantine faults. (2009) 153--168."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2312331"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294267"},{"key":"e_1_3_2_1_13_1","unstructured":"L. Lamport. 2005. Generalized consensus and Paxos. (2005) http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64631.  L. Lamport. 2005. Generalized consensus and Paxos. (2005) http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64631."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0155-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2517350"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/183019.183033"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886780"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2009.36"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.221"}],"event":{"name":"ICPP 2019: 48th International Conference on Parallel Processing","sponsor":["University of Tsukuba University of Tsukuba"],"location":"Kyoto Japan","acronym":"ICPP 2019"},"container-title":["Proceedings of the 48th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3337821.3337885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3337821.3337885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:41Z","timestamp":1750206341000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3337821.3337885"}},"subtitle":["Conflicting-Order-Match based Byzantine Fault Tolerance Protocol with High Efficiency and Robustness"],"short-title":[],"issued":{"date-parts":[[2019,8,5]]},"references-count":22,"alternative-id":["10.1145\/3337821.3337885","10.1145\/3337821"],"URL":"https:\/\/doi.org\/10.1145\/3337821.3337885","relation":{},"subject":[],"published":{"date-parts":[[2019,8,5]]},"assertion":[{"value":"2019-08-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}