{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:31:41Z","timestamp":1743035501989,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819615445"},{"type":"electronic","value":"9789819615452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1545-2_5","type":"book-chapter","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T16:54:46Z","timestamp":1739379286000},"page":"60-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TP-BFT: A Faster Asynchronous BFT Consensus with\u00a0Parallel Structure"],"prefix":"10.1007","author":[{"given":"Shunliang","family":"Ye","sequence":"first","affiliation":[]},{"given":"Qi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Fuan","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Zhihui","family":"Ke","sequence":"additional","affiliation":[]},{"given":"Guoyu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Huawei","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, pp. 405\u2013414 (2008)","DOI":"10.1145\/1400751.1400804"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync hotstuff: simple and practical synchronous state machine replication. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 106\u2013118. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00044"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 337\u2013346 (2019)","DOI":"10.1145\/3293611.3331612"},{"key":"5_CR4","unstructured":"Baek, J., Zheng, Y.: Simple and efficient threshold cryptosystem from the gap diffie-hellman group. In: GLOBECOM\u201903. IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489), vol.\u00a03, pp. 1491\u20131495. IEEE (2003)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00446-002-0083-3","volume":"16","author":"M Ben-Or","year":"2003","unstructured":"Ben-Or, M., El-Yaniv, R.: Resilient-optimal interactive consistency in constant time. Distrib. Comput. 16(4), 249\u2013262 (2003)","journal-title":"Distrib. Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 183\u2013192 (1994)","DOI":"10.1145\/197917.198088"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In: International Workshop on Public Key Cryptography, pp. 31\u201346. Springer (2003)","DOI":"10.1007\/3-540-36288-6_3"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous [(n-1)\/3]-resilient consensus protocol. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"key":"5_CR10","unstructured":"Buterin, V., et\u00a0al.: A next-generation smart contract and decentralized application platform. white paper 3(37), 2\u20131 (2014)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Annual International Cryptology Conference, pp. 524\u2013541. Springer (2001)","DOI":"10.1007\/3-540-44647-8_31"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 123\u2013132 (2000)","DOI":"10.1145\/343477.343531"},{"key":"5_CR13","unstructured":"Cachin, C., Vukoli\u0107, M.: Blockchain consensus protocols in the wild (2017). arXiv preprint arXiv:1707.018731 (2017)"},{"key":"5_CR14","unstructured":"Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OsDI, vol. 99, pp. 173\u2013186 (1999)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: Beat: Asynchronous bft made practical. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 2028\u20132041 (2018)","DOI":"10.1145\/3243734.3243812"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Duan, S., Wang, X., Zhang, H.: Fin: Practical signature-free asynchronous common subset in constant time. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 815\u2013829 (2023)","DOI":"10.1145\/3576915.3616633"},{"issue":"2","key":"5_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"G\u0105gol, A., Le\u015bniak, D., Straszak, D., \u015awi\u0119tek, M.: Aleph: efficient atomic broadcast in asynchronous networks with byzantine nodes. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, pp. 214\u2013228 (2019)","DOI":"10.1145\/3318041.3355467"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Gu, R., Chen, B., Huang, D.: Primary node selection algorithm of pbft based on anomaly detection and reputation model. In: Proceedings of the 11th International Conference on Computer Engineering and Networks, pp. 1613\u20131622. Springer (2022)","DOI":"10.1007\/978-981-16-6554-7_178"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Speeding dumbo: pushing asynchronous bft closer to practice. Cryptology ePrint Archive (2022)","DOI":"10.14722\/ndss.2022.24385"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous bft protocols. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 803\u2013818 (2020)","DOI":"10.1145\/3372297.3417262"},{"key":"5_CR22","unstructured":"Hanke, T., Movahedi, M., Williams, D.: Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 (2018)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Kursawe, K., Shoup, V.: Optimistic asynchronous atomic broadcast. In: International Colloquium on Automata, Languages, and Programming, pp. 204\u2013215. Springer (2005)","DOI":"10.1007\/11523468_17"},{"key":"5_CR24","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. In: Concurrency: the Works of Leslie Lamport, pp. 203\u2013226 (2019)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Lei, K., Zhang, Q., Xu, L., Qi, Z.: Reputation-based byzantine fault-tolerance for consortium blockchain. In: 2018 IEEE 24th international conference on parallel and distributed systems (ICPADS). pp. 604\u2013611. IEEE (2018)","DOI":"10.1109\/PADSW.2018.8644933"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q.: Bolt-dumbo transformer: asynchronous consensus as fast as the pipelined bft. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 2159\u20132173 (2022)","DOI":"10.1145\/3548606.3559346"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of bft protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TDSC.2008.76","volume":"8","author":"H Moniz","year":"2008","unstructured":"Moniz, H., Neves, N.F., Correia, M., Verissimo, P.: Ritas: services for randomized intrusion tolerance. IEEE Trans. Dependable Secure Comput. 8(1), 122\u2013136 (2008)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"5_CR29","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review, p. 21260 (2008)"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp. 403\u2013409. IEEE (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Ramasamy, H.V., Cachin, C.: Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In: International Conference on Principles of Distributed Systems, pp. 88\u2013102. Springer (2006)","DOI":"10.1007\/11795490_9"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Wang, H., Tan, W.: Block proposer election method based on verifiable random function in consensus mechanism. In: 2020 IEEE International Conference on Progress in Informatics and Computing (PIC), pp. 304\u2013308. IEEE (2020)","DOI":"10.1109\/PIC50277.2020.9350766"},{"key":"5_CR33","unstructured":"Yang, L., Park, S.J., Alizadeh, M., Kannan, S., Tse, D.: Dispersedledger: High-throughput byzantine consensus on variable bandwidth networks. arXiv preprint arXiv:2110.04371 (2021)"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: Bft consensus in the lens of blockchain. arXiv preprint arXiv:1803.05069 (2018)","DOI":"10.1145\/3293611.3331591"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, H., Duan, S.: Pace: Fully parallelizable bft from reproposable byzantine agreement. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 3151\u20133164 (2022)","DOI":"10.1145\/3548606.3559348"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1545-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T16:55:24Z","timestamp":1739379324000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1545-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819615445","9789819615452"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1545-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ica3pp2024.scimeeting.cn\/en\/web\/index\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}