{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T09:16:34Z","timestamp":1759482994195,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031649479"},{"type":"electronic","value":"9783031649486"}],"license":[{"start":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T00:00:00Z","timestamp":1728777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T00:00:00Z","timestamp":1728777600000},"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-3-031-64948-6_13","type":"book-chapter","created":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T09:02:09Z","timestamp":1728723729000},"page":"247-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Byzantine Protocols with\u00a0Asymptotically Optimal Communication Complexity"],"prefix":"10.1007","author":[{"given":"Hanzheng","family":"Lyu","sequence":"first","affiliation":[]},{"given":"Shaokang","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Jianyu","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,13]]},"reference":[{"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 (2020)","key":"13_CR1","DOI":"10.1109\/SP40000.2020.00044"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-32101-7_20","volume-title":"Financial Cryptography and Data Security","author":"I Abraham","year":"2019","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: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 320\u2013334. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_20"},{"unstructured":"Abraham, I., Nayak, K., Ren, L., Xiang, Z.: Byzantine agreement, broadcast and state machine replication with optimal good-case latency. arXiv e-prints (2020)","key":"13_CR3"},{"doi-asserted-by":"crossref","unstructured":"Abraham, I., Nayak, K., Ren, L., Xiang, Z.: Good-case latency of byzantine broadcast: a complete categorization. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC 2021, pp. 331\u2013341. New York, NY, USA (2021)","key":"13_CR4","DOI":"10.1145\/3465084.3467899"},{"doi-asserted-by":"publisher","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Baeza-Yates, R., Manber, U. (eds.) Computer Science, pp. 313\u2013321. Springer, Boston, MA (1992). https:\/\/doi.org\/10.1007\/978-1-4615-3422-8_27","key":"13_CR5","DOI":"10.1007\/978-1-4615-3422-8_27"},{"doi-asserted-by":"crossref","unstructured":"Bhat, A., Shrestha, N., Kate, A., Nayak, K.: RandPiper \u2013 reconfiguration-friendly random beacons with quadratic communication. Cryptology ePrint Archive, Report 2020\/1590 (2020)","key":"13_CR6","DOI":"10.1145\/3460120.3484574"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"issue":"3","key":"13_CR8","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)","journal-title":"J. Cryptol."},{"unstructured":"Chan, T.H.H., Pass, R., Shi, E.: Pili : a simple , fast , and robust family of blockchain protocols (2019)","key":"13_CR9"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D Dolev","year":"1982","unstructured":"Dolev, D., Fischer, M.J., Fowler, R., Lynch, N.A., Strong, H.R.: An efficient algorithm for Byzantine agreement without authentication. Inf. Control 52(3), 257\u2013274 (1982)","journal-title":"Inf. Control"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine agreement. J. ACM (JACM) 32(1), 191\u2013204 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued Byzantine agreement. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 163\u2013168 (2006)","key":"13_CR13","DOI":"10.1145\/1146381.1146407"},{"doi-asserted-by":"crossref","unstructured":"Ganesh, C., Patra, A.: Broadcast extensions with optimal communication and round complexity. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 371\u2013380 (2016)","key":"13_CR14","DOI":"10.1145\/2933057.2933082"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00446-020-00384-1","volume":"34","author":"C Ganesh","year":"2021","unstructured":"Ganesh, C., Patra, A.: Optimal extension protocols for Byzantine broadcast and agreement. Distrib. Comput. 34(1), 59\u201377 (2021)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1179\u20131194. ACM (2018)","key":"13_CR16","DOI":"10.1145\/3243734.3243859"},{"unstructured":"Hanke, T., Movahedi, M., Williams, D.: Dfinity technology overview series, consensus system. arXiv preprint arXiv:1805.04548 (2018)","key":"13_CR17"},{"doi-asserted-by":"publisher","unstructured":"Hirt, M., Raykov, P.: Multi-valued Byzantine broadcast: The $$t< n$$ case. In: Sarkar, P., Iwata, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2014, ASIACRYPT 2014, LNCS, vol. 8874. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_24","key":"13_CR18","DOI":"10.1007\/978-3-662-45608-8_24"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Liang, G., Vaidya, N.: Error-free multi-valued consensus with Byzantine failures. In: Proceedings of the 30th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 11\u201320 (2011)","key":"13_CR20","DOI":"10.1145\/1993806.1993809"},{"doi-asserted-by":"crossref","unstructured":"Lyu, H., Niu, J., Gai, F., Feng, C.: Publish or perish: defending withholding attack in Dfinity consensus. In: 2021 17th International Conference on Mobility, Sensing and Networking (MSN), pp. 404\u2013411. IEEE (2021)","key":"13_CR21","DOI":"10.1109\/MSN53354.2021.00068"},{"unstructured":"Momose, A., Ren, L.: Optimal communication complexity of authenticated Byzantine agreement. arXiv preprint arXiv:2007.13175 (2020)","key":"13_CR22"},{"key":"13_CR23","first-page":"1569","volume":"2020","author":"A Momose","year":"2020","unstructured":"Momose, A., Ren, L.: Optimal communication complexity of Byzantine agreement, revisited. IACR Cryptol. ePrint Arch. 2020, 1569 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for Byzantine broadcast and agreement. In: 34th International Symposium on Distributed Computing, DISC 2020, 12\u201316 October 2020, Virtual Conference. LIPIcs, vol.\u00a0179, pp. 28:1\u201328:17 (2020)","key":"13_CR24"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-34578-5_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"E Shi","year":"2019","unstructured":"Shi, E.: Streamlined blockchains: a simple and elegant approach (A tutorial and survey). In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 3\u201317. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_1"},{"doi-asserted-by":"crossref","unstructured":"Shrestha, N., Abraham, I., Ren, L., Nayak, K.: On the optimality of optimistic responsiveness. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 839\u2013857 (2020)","key":"13_CR27","DOI":"10.1145\/3372297.3417284"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64948-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T09:06:56Z","timestamp":1728724016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64948-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,13]]},"ISBN":["9783031649479","9783031649486"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64948-6_13","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024,10,13]]},"assertion":[{"value":"13 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"50","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":"28% - 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","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":"2","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)"}}]}}