{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:04:51Z","timestamp":1757624691498,"version":"3.44.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"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-3-032-01878-6_2","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:08:56Z","timestamp":1755367736000},"page":"37-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Leader Election with\u00a0Poly-Logarithmic Communication Per Party"],"prefix":"10.1007","author":[{"given":"Amey","family":"Bhangale","sequence":"first","affiliation":[]},{"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[]},{"given":"Sravya","family":"Yandamuri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abraham, I.,\u00a0Hubert Chan, T.-H., Dolev, D., Nayak, K., Pass, R., Ren, L., Shi, E.: Communication complexity of byzantine agreement, revisited. In: Robinson, P., Ellen, F. (eds.) 38th ACM PODC, pp. 317\u2013326. ACM (2019)","key":"2_CR1","DOI":"10.1145\/3293611.3331629"},{"doi-asserted-by":"crossref","unstructured":"Alon, N., Naor, M.: Coin-flipping games immune against linear-sized coalitions (extended abstract). In: 31st FOCS, pp. 46\u201354. IEEE Computer Society Press (1990)","key":"2_CR2","DOI":"10.1109\/FSCS.1990.89523"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Cohen, R., Goel, A.: Breaking the $$o (\\sqrt{n})$$-bit barrier: byzantine agreement with polylog bits per party. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 319\u2013330 (2021)","key":"2_CR3","DOI":"10.1145\/3465084.3467897"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S0963548321000249","volume":"31","author":"G Brito","year":"2022","unstructured":"Brito, G., Dumitriu, I., Harris, K.D.: Spectral gap in random bipartite biregular graphs and applications. Comb. Probabil. Comput. 31(2), 229\u2013267 (2022)","journal-title":"Comb. Probabil. Comput."},{"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: Research and Applications, pp. 313\u2013321. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/978-1-4615-3422-8_27","key":"2_CR5","DOI":"10.1007\/978-1-4615-3422-8_27"},{"key":"2_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-64375-1_13","volume-title":"TCC 2020, Part I","author":"E Blum","year":"2020","unstructured":"Blum, E., Katz, J., Liu-Zhang, C.-D., Loss, J.: Asynchronous byzantine agreement with subquadratic communication. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 353\u2013380. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_13"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Linial, N.: Collective coin flipping, robust voting schemes and minima of banzhaf values. In: 26th FOCS, pp. 408\u2013416. IEEE Computer Society Press (1985)","key":"2_CR7","DOI":"10.1109\/SFCS.1985.15"},{"doi-asserted-by":"crossref","unstructured":"Bhangale, A., Liu-Zhang, C.D., Loss, J., Nayak, K., Yandamuri, S.: Leader election with poly-logarithmic communication per party. Cryptology ePrint Archive, Paper 2025\/1016 (2025)","key":"2_CR8","DOI":"10.1007\/978-3-032-01878-6_2"},{"doi-asserted-by":"crossref","unstructured":"Boppana, R.B., Narayanan, B.O.: The biased coin problem. In: 25th ACM STOC, pp. 252\u2013257. ACM Press (1993)","key":"2_CR9","DOI":"10.1145\/167088.167164"},{"doi-asserted-by":"crossref","unstructured":"Cohen, S., Keidar, I., Spiegelman, A.: Not a coincidence: sub-quadratic asynchronous byzantine agreement whp. In: 34th International Symposium on Distributed Computing (2020)","key":"2_CR10","DOI":"10.1145\/3382734.3405708"},{"unstructured":"Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OsDI, vol. 99, pp. 173\u2013186 (1999)","key":"2_CR11"},{"issue":"1","key":"2_CR12","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)"},{"doi-asserted-by":"crossref","unstructured":"Feige, U.: Noncryptographic selection protocols. In: 40th FOCS, pp. 142\u2013153. IEEE Computer Society Press (1999)","key":"2_CR13","DOI":"10.1109\/SFFCS.1999.814586"},{"key":"2_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-030-26948-7_18","volume-title":"CRYPTO 2019, Part I","author":"Y Guo","year":"2019","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 499\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_18"},{"unstructured":"Haemers, W.H.: Interlacing eigenvalues and graphs, vol. FEW 675 of Research memorandum\/Tilburg University, Department of Economics, vol. 19, p. viii (1994)","key":"2_CR15"},{"doi-asserted-by":"crossref","unstructured":"Huang, S.E., Pettie, S., Zhu, L.: Byzantine agreement in polynomial time with near-optimal resilience. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 502\u2013514 (2022)","key":"2_CR16","DOI":"10.1145\/3519935.3520015"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3639454","volume":"71","author":"S-E Huang","year":"2024","unstructured":"Huang, S.-E., Pettie, S., Zhu, L.: Byzantine agreement with optimal resilience via statistical fraud detection. J. ACM 71(2), 1\u201337 (2024)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Breaking the $$O(n^2)$$ bit barrier: scalable byzantine agreement with an adaptive adversary. In: Richa, A.W., Guerraoui, R. (eds.) 29th ACM PODC, pp. 420\u2013429. ACM (2010)","key":"2_CR18","DOI":"10.1145\/1835698.1835798"},{"doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Scalable leader election. In: 17th SODA, pp. 990\u2013999. ACM-SIAM (2006)","key":"2_CR19","DOI":"10.1145\/1109557.1109667"},{"doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 87\u201398. IEEE (2006)","key":"2_CR20","DOI":"10.1109\/FOCS.2006.77"},{"issue":"3","key":"2_CR21","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."},{"unstructured":"Micali, S.: Very simple and efficient byzantine agreement. In: Papadimitriou, C.H. (ed.) ITCS 2017. LIPIcs, vol. 4266, pp. 6:1\u20136:1, 67 (2017)","key":"2_CR22"},{"doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rajagopalan, S., Vazirani, U.V.: Simple and efficient leader election in the full information model. In: 26th ACM STOC, pp. 234\u2013242. ACM Press (1994)","key":"2_CR23","DOI":"10.1145\/195058.195141"},{"key":"2_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-70697-9_14","volume-title":"ASIACRYPT 2017, Part II","author":"R Pass","year":"2017","unstructured":"Pass, R., Shi, E.: The sleepy model of consensus. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 380\u2013409. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_14"},{"doi-asserted-by":"crossref","unstructured":"Russell, A., Zuckerman, D.: Perfect information leader election in log*n + O(1) rounds. In: 39th FOCS, pp. 576\u2013583. IEEE Computer Society Press (1998)","key":"2_CR25","DOI":"10.1109\/SFCS.1998.743508"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:13:37Z","timestamp":1757430817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_2","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":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}