{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:34:49Z","timestamp":1770226489501,"version":"3.49.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229626","type":"print"},{"value":"9783031229633","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22963-3_26","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"774-805","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Practical Provably Secure Flooding for\u00a0Blockchains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-3838","authenticated-orcid":false,"given":"Chen-Da","family":"Liu-Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5900-336X","authenticated-orcid":false,"given":"Christian","family":"Matt","sequence":"additional","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0080-8670","authenticated-orcid":false,"given":"Guilherme","family":"Rito","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6931-4740","authenticated-orcid":false,"given":"S\u00f8ren Eller","family":"Thomsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"26_CR1","unstructured":"Bitnodes.io (2022). https:\/\/bitnodes.io\/. Accessed 16 Sept 2022"},{"key":"26_CR2","unstructured":"ethernodes.org (2022). https:\/\/ethernodes.org\/. Accessed 16 Sept 2022"},{"key":"26_CR3","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: IEEE Symposium on Security and Privacy, pp. 106\u2013118. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00044"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1109\/TNSM.2021.3069502","volume":"18","author":"B Alangot","year":"2021","unstructured":"Alangot, B., Reijsbergen, D., Venugopalan, S., Szalachowski, P., Yeo, K.S.: Decentralized and lightweight approach to detect eclipse attacks on proof of work blockchains. IEEE Trans. Netw. Serv. Manag. 18(2), 1659\u20131672 (2021)","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Apostolaki, M., Zohar, A., Vanbever, L.: Hijacking bitcoin: Routing attacks on cryptocurrencies. In: IEEE Symposium on Security and Privacy, pp. 375\u2013392. IEEE (2017)","DOI":"10.1109\/SP.2017.29"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Badertscher, C., Ga\u017ei, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 913\u2013930. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243848","DOI":"10.1145\/3243734.3243848"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Hamou, A., Peres, Y., Salez, J.: Weighted sampling without replacement. Braz. J. Probab. Stat. 32(3), 657\u2013669 (2018). https:\/\/www.jstor.org\/stable\/26496522","DOI":"10.1214\/17-BJPS359"},{"key":"26_CR8","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, 2nd edn. Cambridge University Press (2001). https:\/\/doi.org\/10.1017\/CBO9780511814068","DOI":"10.1017\/CBO9780511814068"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Chandran, N., Chongchitmate, W., Garay, J.A., Goldwasser, S., Ostrovsky, R., Zikas, V.: The hidden graph model: communication locality and optimal resiliency with adaptive faults. In: ITCS, pp. 153\u2013162. ACM (2015)","DOI":"10.1145\/2688073.2688102"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-14162-1_21","volume-title":"Automata, Languages and Programming","author":"N Chandran","year":"2010","unstructured":"Chandran, N., Garay, J., Ostrovsky, R.: Improved fault tolerance and secure computation on sparse networks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 249\u2013260. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_21"},{"issue":"4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s00145-013-9176-3","volume":"28","author":"N Chandran","year":"2015","unstructured":"Chandran, N., Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation with edge corruptions. J. Cryptol. 28(4), 745\u2013768 (2015)","journal-title":"J. Cryptol."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2019.02.001","volume":"777","author":"J Chen","year":"2019","unstructured":"Chen, J., Micali, S.: Algorand: a secure and efficient distributed ledger. Theor. Comput. Sci. 777, 155\u2013183 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Coretti, S., Kiayias, A., Moore, C., Russell, A.: The generals\u2019 scuttlebutt: byzantine-resilient gossip protocols. Cryptology ePrint Archive, Report 2022\/541 (2022). https:\/\/ia.cr\/2022\/541","DOI":"10.1145\/3548606.3560638"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-030-32101-7_2","volume-title":"Financial Cryptography and Data Security","author":"P Daian","year":"2019","unstructured":"Daian, P., Pass, R., Shi, E.: Snow White: robustly reconfigurable consensus and applications to provably secure proof of stake. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 23\u201341. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_2"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-57990-6_2","volume-title":"Security and Cryptography for Networks","author":"T Dinsdale-Young","year":"2020","unstructured":"Dinsdale-Young, T., Magri, B., Matt, C., Nielsen, J.B., Tschudi, D.: Afgjort: a partially synchronous finality layer for blockchains. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 24\u201344. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_2"},{"issue":"4","key":"26_CR17","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."},{"issue":"5","key":"26_CR18","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Comput. 17(5), 975\u2013988 (1988)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"26_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF02579431","volume":"2","author":"TI Fenner","year":"1982","unstructured":"Fenner, T.I., Frieze, A.M.: On the connectivity of random $$m$$-orientable graphs and digraphs. Combinatorica 2(4), 347\u2013359 (1982). https:\/\/doi.org\/10.1007\/BF02579431","journal-title":"Combinatorica"},{"key":"26_CR20","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. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_10"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78967-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"JA Garay","year":"2008","unstructured":"Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 307\u2013323. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_18"},{"key":"26_CR22","unstructured":"Heilman, E., Kendler, A., Zohar, A., Goldberg, S.: Eclipse attacks on bitcoin\u2019s peer-to-peer network. In: USENIX Security Symposium, pp. 129\u2013144. USENIX Association (2015)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-45724-2_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Jayanti","year":"2020","unstructured":"Jayanti, S., Raghuraman, S., Vyas, N.: Efficient constructions for almost-everywhere secure computation. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 159\u2013183. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_6"},{"issue":"3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TPDS.2003.1189583","volume":"14","author":"A Kermarrec","year":"2003","unstructured":"Kermarrec, A., Massouli\u00e9, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. 14(3), 248\u2013258 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: FOCS, pp. 87\u201398. IEEE (2006)","DOI":"10.1109\/FOCS.2006.77"},{"key":"26_CR26","unstructured":"Liu-Zhang, C.D., Matt, C., Maurer, U., Rito, G., Thomsen, S.E.: Practical provably secure flooding for blockchains. Cryptology ePrint Archive, Paper 2022\/608 (2022). https:\/\/eprint.iacr.org\/2022\/608"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Mansour, Y., Reiter, M.K.: On diffusing updates in a byzantine environment. In: SRDS, pp. 134\u2013143. IEEE (1999)","DOI":"10.1109\/RELDIS.1999.805090"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-45414-4_5","volume-title":"Distributed Computing","author":"D Malkhi","year":"2001","unstructured":"Malkhi, D., Pavlov, E., Sella, Y.: Optimal unconditional information diffusion. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 63\u201377. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45414-4_5"},{"key":"26_CR29","unstructured":"Marcus, Y., Heilman, E., Goldberg, S.: Low-resource eclipse attacks on ethereum\u2019s peer-to-peer network (2018). https:\/\/eprint.iacr.org\/2018\/236"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Matt, C., Nielsen, J.B., Thomsen, S.E.: Formalizing delayed adaptive corruptions and the security of flooding networks. In: Advances in Cryptology - CRYPTO 2022. Springer (2022, to appear)","DOI":"10.1007\/978-3-031-15979-4_14"},{"issue":"1","key":"26_CR31","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-002-0082-4","volume":"16","author":"Y Minsky","year":"2003","unstructured":"Minsky, Y., Schneider, F.B.: Tolerating malicious gossip. Distrib. Comput. 16(1), 49\u201368 (2003)","journal-title":"Distrib. Comput."},{"key":"26_CR32","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentralized Bus. Rev. 21260 (2008)"},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Nayak, K., Kumar, S., Miller, A., Shi, E.: Stubborn mining: generalizing selfish mining and combining with an eclipse attack. In: EuroS &P, pp. 305\u2013320. IEEE (2016)","DOI":"10.1109\/EuroSP.2016.32"},{"key":"26_CR34","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: FruitChains: a fair blockchain. In: PODC, pp. 315\u2013324. ACM (2017)","DOI":"10.1145\/3087801.3087809"},{"key":"26_CR35","unstructured":"Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: DISC. LIPIcs, vol. 91, pp. 39:1\u201339:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"26_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78375-8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Pass","year":"2018","unstructured":"Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_1"},{"key":"26_CR37","doi-asserted-by":"publisher","unstructured":"Rohrer, E., Tschorsch, F.: Kadcast: a structured approach to broadcast in blockchain networks. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, AFT 2019, pp. 199\u2013213. ACM (2019). https:\/\/doi.org\/10.1145\/3318041.3355469","DOI":"10.1145\/3318041.3355469"},{"key":"26_CR38","doi-asserted-by":"crossref","unstructured":"Tran, M., Choi, I., Moon, G.J., Vu, A.V., Kang, M.S.: A stealthier partitioning attack against bitcoin peer-to-peer network. In: IEEE Symposium on Security and Privacy, pp. 894\u2013909. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00027"},{"key":"26_CR39","unstructured":"Tsimos, G., Loss, J., Papamanthou, C.: Gossiping for communication-efficient broadcast. Cryptology ePrint Archive, Report 2020\/894 (2020). https:\/\/ia.cr\/2020\/894"},{"issue":"2","key":"26_CR40","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"E Upfal","year":"1994","unstructured":"Upfal, E.: Tolerating a linear number of faults in networks of bounded degree. Inf. Comput. 115(2), 312\u2013320 (1994)","journal-title":"Inf. Comput."},{"key":"26_CR41","doi-asserted-by":"crossref","unstructured":"Xu, G., et al.: Am I eclipsed? A smart detector of eclipse attacks for ethereum. Comput. Secur. 88, 101604 (2020)","DOI":"10.1016\/j.cose.2019.101604"},{"issue":"7\u20138","key":"26_CR42","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.peva.2013.03.001","volume":"70","author":"O Yagan","year":"2013","unstructured":"Yagan, O., Makowski, A.M.: On the scalability of the random pairwise key predistribution scheme: gradual deployment and key ring sizes. Perform. Eval. 70(7\u20138), 493\u2013512 (2013). https:\/\/doi.org\/10.1016\/j.peva.2013.03.001","journal-title":"Perform. Eval."},{"key":"26_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, S., Lee, J.: Eclipse-based stake-bleeding attacks in POS blockchain systems. In: BSCI, pp. 67\u201372. ACM (2019)","DOI":"10.1145\/3327960.3332391"},{"key":"26_CR44","doi-asserted-by":"crossref","unstructured":"Zheng, H., Tran, T., Arden, O.: Total eclipse of the enclave: detecting eclipse attacks from inside tees. In: IEEE ICBC, pp. 1\u20135. IEEE (2021)","DOI":"10.1109\/ICBC51069.2021.9461081"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22963-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:03:33Z","timestamp":1769216613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22963-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229626","9783031229633"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22963-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","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":"98","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":"27% - 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":"10","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}