{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:08:46Z","timestamp":1743102526132,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710698"},{"type":"electronic","value":"9783031710704"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71070-4_7","type":"book-chapter","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:41Z","timestamp":1725897761000},"page":"139-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Round Efficient Byzantine Agreement from\u00a0VDFs"],"prefix":"10.1007","author":[{"given":"Poulami","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Eckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Loss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monosij","family":"Maitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Communication complexity of Byzantine agreement, revisited. In: Robinson, P., Ellen, F. (eds.) 38th ACM PODC, pp. 317\u2013326. ACM (2019)","key":"7_CR1","DOI":"10.1145\/3293611.3331629"},{"key":"7_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"},{"doi-asserted-by":"crossref","unstructured":"Aggarwal, A., et al.: Bootstrapping public blockchains without a trusted setup. In: Robinson, P., Ellen, F. (eds.) 38th ACM PODC, pp. 366\u2013368. ACM (2019)","key":"7_CR3","DOI":"10.1145\/3293611.3331570"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-662-48000-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Andrychowicz","year":"2015","unstructured":"Andrychowicz, M., Dziembowski, S.: PoW-based distributed cryptography with no trusted setup. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 379\u2013399. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_19"},{"doi-asserted-by":"crossref","unstructured":"van Baarsen, A., Stevens, M.: On time-lock cryptographic assumptions in abelian hidden-order groups. IACR Cryptology ePrint Archive, p. 1184 (2021)","key":"7_CR5","DOI":"10.1007\/978-3-030-92075-3_13"},{"doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., et al. (eds.) ACM CCS 1993, pp. 62\u201373. ACM Press (1993)","key":"7_CR6","DOI":"10.1145\/168588.168596"},{"unstructured":"\u201cBitcoin: A peer-to-peer electronic cash system\u201d (2008)","key":"7_CR7"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Bonneau, J., B\u00fcnz, B., Fisch, B.: Verifiable delay functions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 757\u2013788. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_25"},{"doi-asserted-by":"crossref","unstructured":"Buterin, V.: Ethereum white paper (2013)","key":"7_CR9","DOI":"10.1186\/1687-2770-2013-180"},{"unstructured":"Cohen, B., Pietrzak, K.: The chia network blockchain. Technical report, Chia Network (2019)","key":"7_CR10"},{"unstructured":"Cohen, R., et al.: Adaptively secure broadcast in resource-restricted cryptography. Cryptology ePrint Archive, Report 2021\/775 (2021). https:\/\/eprint.iacr.org\/2021\/775","key":"7_CR11"},{"unstructured":"Das, P., et al.: Round efficient Byzantine agreement from VDFs. Cryptology ePrint Archive, Paper 2022\/823 (2022). https:\/\/eprint.iacr.org\/2022\/823","key":"7_CR12"},{"issue":"4","key":"7_CR13","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."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"JR Douceur","year":"2002","unstructured":"Douceur, J.R.: The Sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251\u2013260. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_24"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_10"},{"doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for Byzantine agreement. In: 20th ACM STOC, pp. 148\u2013161. ACM Press (1988)","key":"7_CR16","DOI":"10.1145\/62212.62225"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part I. LNCS, vol. 11921, pp. 248\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-319-76581-5_17","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"C Ganesh","year":"2018","unstructured":"Ganesh, C., Kondi, Y., Patra, A., Sarkar, P.: Efficient adaptively secure zero-knowledge from garbled circuits. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 499\u2013529. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_17"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-319-76581-5_16","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"JA Garay","year":"2018","unstructured":"Garay, J.A., Kiayias, A., Leonardos, N., Panagiotakos, G.: Bootstrapping the blockchain, with applications to consensus and fast PKI setup. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part II. LNCS, vol. 10770, pp. 465\u2013495. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76581-5_16"},{"key":"7_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-031-58734-4_4","volume-title":"EUROCRYPT 2024, Part III","author":"J Garay","year":"2024","unstructured":"Garay, J., Kiayias, A., Shen, Y.: Proof-of-work-based consensus in expected-constant time. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part III. LNCS, vol. 14653, pp. 96\u2013125. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58734-4_4"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-45724-2_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J Garay","year":"2020","unstructured":"Garay, J., Kiayias, A., Ostrovsky, R.M., Panagiotakos, G., Zikas, V.: Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 129\u2013158. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_5"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The bitcoin backbone protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"7_CR23","series-title":"IFIP \u2014 The International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-0-387-35568-9_18","volume-title":"Secure Information Networks","author":"M Jakobsson","year":"1999","unstructured":"Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols(extended abstract). In: Preneel, B. (ed.) Secure Information Networks. ITIFIP, vol. 23, pp. 258\u2013272. Springer, Boston, MA (1999). https:\/\/doi.org\/10.1007\/978-0-387-35568-9_18"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for Byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 445\u2013462. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_27"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-64381-2_14","volume-title":"Theory of Cryptography","author":"J Katz","year":"2020","unstructured":"Katz, J., Loss, J., Xu, J.: On the security of time-lock puzzles and timed commitments. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 390\u2013413. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_14"},{"unstructured":"Katz, J., et al.: Pseudonymous broadcast and secure computation from cryptographic puzzles. Cryptology ePrint Archive, Report 2014\/857 (2014). https:\/\/eprint.iacr.org\/2014\/857","key":"7_CR26"},{"doi-asserted-by":"crossref","unstructured":"Kerber, T.: Ouroboros crypsinous: privacy-preserving proof-of-stake. In: IEEE Symposium on Security and Privacy, SP 2019, San Francisco, CA, USA, 19\u201323 May, pp. 157\u2013174. IEEE (2019)","key":"7_CR27","DOI":"10.1109\/SP.2019.00063"},{"unstructured":"Micali, S.: Very simple and efficient Byzantine agreement. In: Papadimitriou, C.H. (ed.) ITCS 2017, vol. 4266. 67: LIPIcs, pp. 6:1\u20136:1 (2017)","key":"7_CR28"},{"unstructured":"Micali, S., Vaikuntanathan, V.: Optimal and player-replaceable consensus with an honest majority (2017)","key":"7_CR29"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-319-56614-6_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Pass","year":"2017","unstructured":"Pass, R., Seeman, L., Shelat, A.: Analysis of the blockchain protocol in asynchronous networks. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 643\u2013673. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_22"},{"unstructured":"Pietrzak, K.: Proofs of catalytic space. In: Blum, A. (ed.) ITCS 2019. LIPIcs, vol. 124, pp. 59:1\u201359:25 (2019)","key":"7_CR31"},{"doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: 24th FOCS, pp. 403\u2013409. IEEE Computer Society Press (1983)","key":"7_CR32","DOI":"10.1109\/SFCS.1983.48"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-030-64375-1_15","volume-title":"Theory of Cryptography","author":"J Wan","year":"2020","unstructured":"Wan, J., Xiao, H., Devadas, S., Shi, E.: Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 412\u2013456. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_15"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_13"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71070-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:03:42Z","timestamp":1725897822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71070-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710698","9783031710704"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71070-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"10 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"11 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}