{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:46:26Z","timestamp":1777376786335,"version":"3.51.4"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223174","type":"print"},{"value":"9783031223181","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-22318-1_14","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"384-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Asymptotically Free Broadcast in\u00a0Constant Expected Time via\u00a0Packed VSS"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilad","family":"Asharov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shravani","family":"Patil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"14_CR1","unstructured":"Aws latency monitoring. https:\/\/www.cloudping.co\/grid. Accessed February 2022"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-90453-1_3","volume-title":"Theory of Cryptography","author":"I Abraham","year":"2021","unstructured":"Abraham, I., Asharov, G., Yanai, A.: Efficient perfectly secure computation with optimal resilience. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 66\u201396. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_3"},{"key":"14_CR3","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"},{"key":"14_CR4","unstructured":"Abraham, I., Nayak, K.: Crusader agreement with $$\\le 1\/3$$ error is impossible for $$n \\le 3f$$ if the adversary can simulate. Decentralized Thoughts, Blog Post (2021). https:\/\/tinyurl.com\/decentralizedthougts. Accessed Sept 2021"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: The round complexity of perfect MPC with active security and optimal resiliency. In: FOCS (2020)","DOI":"10.1109\/FOCS46700.2020.00121"},{"key":"14_CR6","unstructured":"Asharov, G., Cohen, R., Shochat, O.: Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW. In: Conference on Information-Theoretic Cryptography - ITC 2022. (To Appear) (2022)"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"Asharov, G., Lindell, Y.: A full proof of the bgw protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2017). https:\/\/doi.org\/10.1007\/s00145-015-9214-4","journal-title":"J. Cryptol."},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: Perfectly-secure multiplication for any t $$<$$ n\/3. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 240\u2013258. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_14","DOI":"10.1007\/978-3-642-22792-9_14"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: completely asynchronous agreement protocols (extended abstract). In: PODC (1983)","DOI":"10.1145\/800221.806707"},{"key":"14_CR11","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, 249\u2013262 (2003). https:\/\/doi.org\/10.1007\/s00446-002-0083-3","journal-title":"Distrib. Comput."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: ACM Symposium on Theory of Computing (1988)","DOI":"10.1145\/62212.62213"},{"key":"14_CR13","volume-title":"Computer Science","author":"P Berman","year":"1992","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Baeza-Yates, R., Manber, U. (eds.) Computer Science. Springer, Boston (1992)"},{"key":"14_CR14","unstructured":"Canetti, R.: Asynchronous secure computation. Technion - Computer Science Department - Technical report (1993)"},{"key":"14_CR15","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis, Citeseer (1996)"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptology"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R., Damgaard, I., Dziembowski, S., Ishai, Y., Malkin, T.: On adaptive vs. non-adaptive security of multiparty protocols. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 262\u2013279. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_17","DOI":"10.1007\/3-540-44987-6_17"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: ACM Symposium on Theory of Computing (1988)","DOI":"10.1007\/3-540-48184-2_43"},{"key":"14_CR20","unstructured":"Chen, J.: Optimal error-free multi-valued byzantine agreement. In: DISC (2021)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th Annual Symposium on Foundations of Computer Science (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Coan, B.A., Welch, J.L.: Modular construction of nearly optimal byzantine agreement protocols. In: ACM Symposium on Principles of Distributed Computing (1989)","DOI":"10.1145\/72981.73002"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s00145-018-9279-y","volume":"32","author":"R Cohen","year":"2018","unstructured":"Cohen, R., Coretti, S., Garay, J., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. J. Cryptology 32(3), 690\u2013741 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9279-y","journal-title":"J. Cryptology"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22","DOI":"10.1007\/3-540-45539-6_22"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., David, B., Giacomelli, I., Nielsen, J.B.: Compact VSS and efficient homomorphic UC commitments. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 213\u2013232. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_12","DOI":"10.1007\/978-3-662-45608-8_12"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: ACM CCS Conference on Computer and Communications Security (2021)","DOI":"10.1145\/3460120.3484808"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Dolev, D., Reischuk, R.: Bounds on information exchange for byzantine agreement. In: Symposium on Principles of Distributed Computing (1982)","DOI":"10.1145\/800220.806690"},{"issue":"1","key":"14_CR28","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)"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: ACM Symposium on Theory of Computing (1988)","DOI":"10.1145\/62212.62225"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Feldman, P.N.: Optimal Algorithms for Byzantine Agreement. Ph.D. thesis, Massachusetts Institute of Technology (1988)","DOI":"10.1145\/62212.62225"},{"issue":"4","key":"14_CR31","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Information Processing Letters (1982)","DOI":"10.21236\/ADA105946"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A.: Efficient player-optimal protocols for strong and differential consensus. In: PODC (2003)","DOI":"10.1145\/872035.872066"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: ACM Symposium on Theory of Computing (1992)","DOI":"10.1145\/129712.129780"},{"key":"14_CR35","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, 59\u201377 (2021). https:\/\/doi.org\/10.1007\/s00446-020-00384-1","journal-title":"Distrib. Comput."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: STOC (2001)","DOI":"10.1145\/380752.380853"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In: PODC (1998)","DOI":"10.1145\/277697.277716"},{"issue":"1","key":"14_CR38","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(90)90185-Z","volume":"36","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O., Petrank, E.: The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocols. Inf. Process. Lett. 36(1), 45\u201349 (1990)","journal-title":"Inf. Process. Lett."},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional mpc with guaranteed output delivery. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 85\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143\u2013161. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_12","DOI":"10.1007\/3-540-44448-3_12"},{"key":"14_CR41","doi-asserted-by":"publisher","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","DOI":"10.1007\/11818175_27"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 499\u2013510. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_41","DOI":"10.1007\/978-3-540-70583-3_41"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"14_CR44","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, 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: Sequential composition of protocols without simultaneous termination. In: PODC (2002)","DOI":"10.1145\/571855.571859"},{"key":"14_CR46","unstructured":"Nayak, K., Ren, L., Shi, E., Vaidya, N.H., Xiang, Z.: Improved extension protocols for byzantine broadcast and agreement. arXiv preprint. arXiv:2002.11321 (2020)"},{"key":"14_CR47","doi-asserted-by":"publisher","unstructured":"Patra, A.: Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 34\u201349. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_4","DOI":"10.1007\/978-3-642-25873-2_4"},{"issue":"2","key":"14_CR48","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 (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"key":"14_CR49","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: Symposium on Foundations of Computer Science (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"14_CR50","unstructured":"Shrestha, N., Bhat, A., Kate, A., Nayak, K.: Synchronous distributed key generation without broadcasts. IACR Cryptology ePrint Archive (2021)"},{"issue":"2","key":"14_CR51","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"Turpin, R., Coan, B.A.: Extending binary byzantine agreement to multivalued byzantine agreement. Inf. Process. Lett. 18(2), 73\u201376 (1984)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22318-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:05Z","timestamp":1766278925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_14","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":"21 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"139","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":"60","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":"43% - 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.1","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":"9.9","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"}]}}