{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T12:09:46Z","timestamp":1777723786906,"version":"3.51.4"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385568","type":"print"},{"value":"9783031385575","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38557-5_2","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"39-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Bingo: Adaptivity and\u00a0Asynchrony in\u00a0Verifiable Secret Sharing and\u00a0Distributed Key Generation"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Jovanovic","sequence":"additional","affiliation":[]},{"given":"Mary","family":"Maller","sequence":"additional","affiliation":[]},{"given":"Sarah","family":"Meiklejohn","sequence":"additional","affiliation":[]},{"given":"Gilad","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, pp. 88\u201397 (2002)","DOI":"10.1145\/586110.586124"},{"key":"2_CR2","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, 219\u2013246 (2005)","journal-title":"J. Cryptol."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-030-77870-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"K Gurkan","year":"2021","unstructured":"Gurkan, K., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Aggregatable distributed key generation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 147\u2013176. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_6"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Efficient Asynchronous verifiable secret sharing and multiparty computation. J. Cryptol. 28(1), 49\u2013109 (2015). https:\/\/doi.org\/10.1007\/s00145-013-9172-7","DOI":"10.1007\/s00145-013-9172-7"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Syta, E., et al.: Scalable Bias-Resistant Distributed Randomness. In: 38th IEEE Symposium on Security and Privacy, San Jose, CA, May 2017","DOI":"10.1109\/SP.2017.45"},{"key":"2_CR6","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, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 699\u2013710. ACM (1992)","DOI":"10.1145\/129712.129780"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 52\u201361 (1993)","DOI":"10.1145\/167088.167109"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311\u2013326. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_22"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-030-90453-1_2","volume-title":"Theory of Cryptography","author":"A Chopard","year":"2021","unstructured":"Chopard, A., Hirt, M., Liu-Zhang, C.-D.: On communication-efficient asynchronous MPC with adaptive security. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 35\u201365. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_2"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"2_CR13","unstructured":"Daian, P., et al.: Flash Boys 2.0: Frontrunning, Transaction Reordering, and Consensus Instability in Decentralized Exchanges. In: IEEE Symposium on Security and Privacy (2020)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Qin, K., Zhou, L., Gervais, A.: Quantifying blockchain extractable value: how dark is the forest? In: IEEE Symposium on Security and Privacy (2022)","DOI":"10.1109\/SP46214.2022.9833734"},{"key":"2_CR15","unstructured":"Bowe, S., Gabizon, A., Miers, I.: Scalable Multi-party Computation for ZK-SNARK Parameters in the Random Beacon Model. Cryptology ePrint Archive, Paper 2017\/1050 (2017)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 33\u201362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Kokoris Kogias, E., Malkhi, D., Spiegelman, A.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: CCS 2020: 2020 ACM SIGSAC Conference on Computer and Communications Security (2020)","DOI":"10.1145\/3372297.3423364"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Bacho, R., Loss, J.: On the adaptive security of the threshold BLS signature scheme. In: Proceedings of ACM CCS 2022 (2022)","DOI":"10.1145\/3548606.3560656"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"R Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98\u2013116. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_7"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg. I.: Constant-size commitments to polynomials and their applications. In: Advances in Cryptology - ASIACRYPT 2010, pp. 177\u2013194 (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-030-92078-4_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"M Kohlweiss","year":"2021","unstructured":"Kohlweiss, M., Maller, M., Siim, J., Volkhov, M.: Snarky ceremonies. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 98\u2013127. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_4"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Abraham, I., Asharov, G., Patil, S., Patra, A.: Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. In: IACR Cryptol. ePrint Arch. (2022). https:\/\/eprint.iacr.org\/2022\/1266","DOI":"10.1007\/978-3-031-22318-1_14"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-022-09434-2","volume":"35","author":"I Abraham","year":"2022","unstructured":"Abraham, I., Asharov, G., Yanai, A.: Efficient perfectly secure computation with optimal resilience. J. Cryptol. 35(4), 27 (2022)","journal-title":"J. Cryptol."},{"key":"2_CR26","unstructured":"Kate, A., Miller, A., Yurek, T.: Brief Note: Asynchronous Verifiable Secret Sharing with Optimal Resilience and Linear Amortized Overhead (2019). arXiv: 1902.06095 [cs.CR]"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Backes, M., Datta, A., Kate, A.: Asynchronous computational VSS with reduced communication complexity. In: Topics in Cryptology \u2013 CT-RSA 2013, pp. 259\u2013276 (2013)","DOI":"10.1007\/978-3-642-36095-4_17"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"AlHaddad, N., Varia, M., Zhang., H.: High-threshold AVSS with optimal communication complexity. In: Financial Cryptography and Data Security, pp. 479\u2013498 (2021)","DOI":"10.1007\/978-3-662-64331-0_25"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Yurek, T., Luo, L., Fairoze, J., Kate, A., Miller, A.K.: hbACSS: how to robustly share many secrets. In: Proceedings of the Network and Distributed System Security Symposium (NDSS) 2022 (2022)","DOI":"10.14722\/ndss.2022.23120"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Kate, A., Huang, Y., Goldberg, I.: Distributed key generation in the wild. In: Proceedings of ICDCS (2009)","DOI":"10.1109\/ICDCS.2009.21"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Reaching consensus for asynchronous distributed key generation. In: PODC 2021: ACM Symposium on Principles of Distributed Computing 2021, pp. 363\u2013373 (2021)","DOI":"10.1145\/3465084.3467914"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris-Kogias, L., Ren, L.: Practical asynchronous distributed key generation. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 2518\u20132534 (2022)","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"2_CR33","unstructured":"Groth, J., Shoup, V.: Design and analysis of a distributed ECDSA signing service. In: Cryptology ePrint Archive (2022). https:\/\/eprint.iacr.org\/2022\/506"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00145-006-0347-3","volume":"20","author":"R Gennaro","year":"2007","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2007)","journal-title":"J. Cryptol."},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 148\u2013161. ACM (1988)","DOI":"10.1145\/62212.62225"},{"key":"2_CR36","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), pp. 14:1\u201314:17 (2018)"},{"key":"2_CR37","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: 11th Innovations in Theoretical Computer Science Conference, ITCS, pp. 5:1\u20135:32 (2020)"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Bootle","year":"2016","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334 (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory. 63(1), 428\u2013468 (2017). https:\/\/doi.org\/10.1109\/TIT.2016.2614685","DOI":"10.1109\/TIT.2016.2614685"},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-61204-1_27","volume-title":"Applied Cryptography and Network Security","author":"I Cascudo","year":"2017","unstructured":"Cascudo, I., David, B.: Scrape: scalable randomness attested by\u00a0public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 537\u2013556. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27"},{"key":"2_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-64840-4_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"I Cascudo","year":"2020","unstructured":"Cascudo, I., David, B.: ALBATROSS: publicly AttestabLe BATched randomness based on secret sharing. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 311\u2013341. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_11"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: CCS 2021: 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705\u20132721 (2021)","DOI":"10.1145\/3460120.3484808"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Abraham, I., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G.: Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation (2022). https:\/\/eprint.iacr.org\/2022\/1759","DOI":"10.1007\/978-3-031-38557-5_2"},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"issue":"2","key":"2_CR46","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"2_CR47","doi-asserted-by":"crossref","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The one- more-RSA-inversion problems and the security of Chaum\u2019s blind signature scheme. J. Cryptol. 163 (2003)","DOI":"10.1007\/3-540-46088-8_25"},{"key":"2_CR48","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra (3rd edn.) Cambridge University Press (2013). ISBN: 978-1-107-03903-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38557-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:13Z","timestamp":1753567333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38557-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385568","9783031385575"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38557-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","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":"124","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":"26% - 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":"15","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)"}}]}}