{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:27:38Z","timestamp":1780633658586,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":48,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987320","type":"print"},{"value":"9789819987337","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-981-99-8733-7_10","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T08:02:20Z","timestamp":1702800140000},"page":"307-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["WhatsUpp with\u00a0Sender Keys? Analysis, Improvements and\u00a0Security Proofs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4864-1125","authenticated-orcid":false,"given":"David","family":"Balb\u00e1s","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9379-1678","authenticated-orcid":false,"given":"Daniel","family":"Collins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phillip","family":"Gajland","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Celi, S., Dowling, B., Jones, D.: Practically-exploitable cryptographic vulnerabilities in matrix. In: 2023 IEEE Symposium on Security and Privacy (2023)","DOI":"10.1109\/SP46215.2023.10351027"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Dowling, B., Jones, D.: Device-oriented group messaging: a formal cryptographic analysis of matrix\u2019 core. In: 2024 IEEE Symposium on Security and Privacy (to appear) (2024)","DOI":"10.1109\/SP54263.2024.00075"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Marekov\u00e1, L., Paterson, K.G., Stepanovs, I.: Four attacks and a proof for telegram. In: 2022 IEEE Symposium on Security and Privacy, pp. 87\u2013106. IEEE Computer Society Press, May 2022. https:\/\/doi.org\/10.1109\/SP46214.2022.9833666","DOI":"10.1109\/SP46214.2022.9833666"},{"key":"10_CR4","unstructured":"Alwen, J., Auerbach, B., Noval, M.C., Klein, K., Pascual-Perez, G., Pietrzak, K.: DeCAF: Decentralizable continuous group key agreement with fast healing. Cryptology ePrint Archive, Report 2022\/559 (2022). https:\/\/eprint.iacr.org\/2022\/559"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Alwen, J., Auerbach, B., Noval, M.C., Klein, K., Pascual-Perez, G., Pietrzak, K., Walter, M.: CoCoA: Concurrent continuous group key agreement. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 815\u2013844. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_28","DOI":"10.1007\/978-3-031-07085-3_28"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Dodis, Y.: The double ratchet: security notions, proofs, and modularization for the Signal protocol. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 129\u2013158. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_5","DOI":"10.1007\/978-3-030-17653-2_5"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 248\u2013277. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_9","DOI":"10.1007\/978-3-030-56784-2_9"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Dodis, Y., Tselekounis, Y.: Modular design of secure group messaging protocols and the security of MLS. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1463\u20131483. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484820","DOI":"10.1145\/3460120.3484820"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Alwen, J., Coretti, S., Jost, D., Mularczyk, M.: Continuous group key agreement with active security. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 261\u2013290. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_10","DOI":"10.1007\/978-3-030-64378-2_10"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Alwen, J., Hartmann, D., Kiltz, E., Mularczyk, M.: Server-aided continuous group key agreement. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 69\u201382. ACM Press (Nov 2022). https:\/\/doi.org\/10.1145\/3548606.3560632","DOI":"10.1145\/3548606.3560632"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Alwen, J., Jost, D., Mularczyk, M.: On the insider security of MLS. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 34\u201368. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_2","DOI":"10.1007\/978-3-031-15979-4_2"},{"key":"10_CR12","unstructured":"Balb\u00e1s, D., Collins, D., Gajland, P.: Analysis and improvements of the sender keys protocol for group messaging. XVII Reuni\u00f3n espa\u00f1ola sobre criptolog\u00eda y seguridad de la informaci\u00f3n. RECSI 2022 265, 25 (2022)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Balb\u00e1s, D., Collins, D., Gajland, P.: WhatsUpp with sender keys? Analysis, improvements and security proofs. Cryptology ePrint Archive, Paper 2023\/1385 (2023). https:\/\/eprint.iacr.org\/2023\/1385. (Full version)","DOI":"10.1007\/978-981-99-8733-7_10"},{"key":"10_CR14","unstructured":"Balb\u00e1s, D., Collins, D., Vaudenay, S.: Cryptographic administration for secure group messaging. In: 2023 USENIX Security Symposium (2023)"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Balli, F., R\u00f6sler, P., Vaudenay, S.: Determining the core primitive for optimally secure ratcheting. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 621\u2013650. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_21","DOI":"10.1007\/978-3-030-64840-4_21"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Barnes, R., Beurdouche, B., Robert, R., Millican, J., Omara, E., Cohn-Gordon, K.: The Messaging Layer Security (MLS) Protocol. RFC 9420 (2023). https:\/\/doi.org\/10.17487\/RFC9420, https:\/\/www.rfc-editor.org\/info\/rfc9420","DOI":"10.17487\/RFC9420"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Bellare, M., Singh, A.C., Jaeger, J., Nyayapati, M., Stepanovs, I.: Ratcheted encryption and key exchange: the security of messaging. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part III. LNCS, vol. 10403, pp. 619\u2013650. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_21","DOI":"10.1007\/978-3-319-63697-9_21"},{"key":"10_CR18","unstructured":"Bhargavan, K., Barnes, R., Rescorla, E.: TreeKEM: asynchronous decentralized key management for large dynamic groups a protocol proposal for messaging layer security (MLS). Research report, Inria Paris, May 2018. https:\/\/hal.inria.fr\/hal-02425247"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Dodis, Y., Garg, S., Grogan, G., Hajiabadi, M., R\u00f6sler, P.: On the worst-case inefficiency of CGKA. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part II. LNCS, vol. 13748, pp. 213\u2013243. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_8","DOI":"10.1007\/978-3-031-22365-5_8"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Dodis, Y., R\u00f6sler, P.: On the price of concurrency in group ratcheting protocols. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part II. LNCS, vol. 12551, pp. 198\u2013228. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_8","DOI":"10.1007\/978-3-030-64378-2_8"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Bienstock, A., Fairoze, J., Garg, S., Mukherjee, P., Raghuraman, S.: A more complete analysis of the Signal double ratchet algorithm. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 784\u2013813. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_27","DOI":"10.1007\/978-3-031-15802-5_27"},{"key":"10_CR22","unstructured":"Blazy, O., Boureanu, I., Lafourcade, P., Onete, C., Robert, L.: How fast do you heal? A taxonomy for post-compromise security in secure-channel establishment. Cryptology ePrint Archive, Report 2022\/1090 (2022). https:\/\/eprint.iacr.org\/2022\/1090"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Brzuska, C., Cornelissen, E., Kohbrok, K.: Security analysis of the MLS key derivation. In: 2022 IEEE Symposium on Security and Privacy, pp. 2535\u20132553. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833678","DOI":"10.1109\/SP46214.2022.9833678"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Canetti, R., Jain, P., Swanberg, M., Varia, M.: Universally composable end-to-end secure messaging. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 3\u201333. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_1","DOI":"10.1007\/978-3-031-15979-4_1"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Chase, M., Perrin, T., Zaverucha, G.: The signal private group system and anonymous credentials supporting efficient verifiable encryption. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1445\u20131459. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417887","DOI":"10.1145\/3372297.3417887"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1914","DOI":"10.1007\/s00145-020-09360-1","volume":"33","author":"K Cohn-Gordon","year":"2020","unstructured":"Cohn-Gordon, K., Cremers, C., Dowling, B., Garratt, L., Stebila, D.: A formal security analysis of the signal messaging protocol. J. Cryptol. 33(4), 1914\u20131983 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09360-1","journal-title":"J. Cryptol."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Cohn-Gordon, K., Cremers, C., Garratt, L., Millican, J., Milner, K.: On ends-to-ends encryption: asynchronous group messaging with strong security guarantees. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1802\u20131819. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243747","DOI":"10.1145\/3243734.3243747"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Cohn-Gordon, K., Cremers, C.J.F., Garratt, L.: On post-compromise security. In: Hicks, M., K\u00f6pf, B. (eds.) CSF 2016 Computer Security Foundations Symposium, pp. 164\u2013178. IEEE Computer Society Press (2016). https:\/\/doi.org\/10.1109\/CSF.2016.19","DOI":"10.1109\/CSF.2016.19"},{"key":"10_CR29","unstructured":"Cong, K., Eldefrawy, K., Smart, N.P., Terner, B.: The key lattice framework for concurrent group messaging. Cryptology ePrint Archive, Report 2022\/1531 (2022). https:\/\/eprint.iacr.org\/2022\/1531"},{"key":"10_CR30","unstructured":"Cremers, C., Hale, B., Kohbrok, K.: The complexities of healing in secure group messaging: why cross-group effects matter. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 1847\u20131864. USENIX Association (2021)"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Davies, G.T., et al.: Security analysis of the whatsapp end-to-end encrypted backup protocol. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology. CRYPTO 2023. LNCS, vol. 14084. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_11","DOI":"10.1007\/978-3-031-38551-3_11"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Durak, F.B., Vaudenay, S.: Bidirectional asynchronous ratcheted key agreement with linear complexity. In: Attrapadung, N., Yagi, T. (eds.) IWSEC 2019. LNCS, vol. 11689, pp. 343\u2013362. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26834-3_20","DOI":"10.1007\/978-3-030-26834-3_20"},{"key":"10_CR33","unstructured":"Galal, T.: yowsup, Code Repository (2021). https:\/\/github.com\/tgalal\/yowsup"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Hashimoto, K., Katsumata, S., Postlethwaite, E., Prest, T., Westerbaan, B.: A concrete treatment of efficient continuous group key agreement via multi-recipient PKEs. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1441\u20131462. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484817","DOI":"10.1145\/3460120.3484817"},{"key":"10_CR35","unstructured":"Internet Engineering Task Force, I.: Messaging layer security, mailing list (2023). https:\/\/mailarchive.ietf.org\/arch\/browse\/mls\/"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Jaeger, J., Stepanovs, I.: Optimal channel security against fine-grained state compromise: the safety of messaging. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 33\u201362. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_2","DOI":"10.1007\/978-3-319-96884-1_2"},{"key":"10_CR37","unstructured":"Jefferys, K.: Session Protocol: Technical implementation details (2020). https:\/\/getsession.org\/blog\/session-protocol-technical-information. Accessed 4 July 2023"},{"key":"10_CR38","unstructured":"Kenneth G. Paterson, Matteo Scarlata, K.T.T.: Three lessons from threema: analysis of a secure messenger. In: 2023 USENIX Security Symposium (2023)"},{"key":"10_CR39","doi-asserted-by":"publisher","unstructured":"Klein, K., et al.: Keep the dirt: Tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy, pp. 268\u2013284. IEEE Computer Society Press, May 2021. https:\/\/doi.org\/10.1109\/SP40001.2021.00035","DOI":"10.1109\/SP40001.2021.00035"},{"key":"10_CR40","unstructured":"Marlinspike, M.: Private Group Messaging (2014). https:\/\/signal.org\/blog\/private-groups\/. Accessed 5 Sep 2023"},{"key":"10_CR41","unstructured":"Marlinspike, M., Perrin, T.: The double ratchet algorithm (2016). https:\/\/signal.org\/docs\/specifications\/doubleratchet\/doubleratchet.pdf"},{"key":"10_CR42","first-page":"10","volume":"283","author":"M Marlinspike","year":"2016","unstructured":"Marlinspike, M., Perrin, T.: The x3dh key agreement protocol. Open Whisper Syst. 283, 10 (2016)","journal-title":"Open Whisper Syst."},{"key":"10_CR43","unstructured":"Marlinspike, M., et al.: Signal protocol (2016). https:\/\/github.com\/signalapp\/libsignal-protocol-java\/tree\/master\/java\/src\/main\/java\/org\/whispersystems\/libsignal"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Pijnenburg, J., Poettering, B.: On secure ratcheting with immediate decryption. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 89\u2013118. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_4","DOI":"10.1007\/978-3-031-22969-5_4"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"Poettering, B., R\u00f6sler, P.: Towards bidirectional ratcheted key exchange. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 3\u201332. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_1","DOI":"10.1007\/978-3-319-96884-1_1"},{"key":"10_CR46","doi-asserted-by":"publisher","unstructured":"R\u00f6sler, P., Mainka, C., Schwenk, J.: More is less: on the end-to-end security of group chats in signal, WhatsApp, and Threema. In: 2018 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 415\u2013429. IEEE, London, UK (2018). https:\/\/doi.org\/10.1109\/EuroSP.2018.00036","DOI":"10.1109\/EuroSP.2018.00036"},{"key":"10_CR47","doi-asserted-by":"publisher","unstructured":"Weidner, M., Kleppmann, M., Hugenroth, D., Beresford, A.R.: Key agreement for decentralized secure group messaging with strong security guarantees. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2024\u20132045. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484542","DOI":"10.1145\/3460120.3484542"},{"key":"10_CR48","unstructured":"WhatsApp: WhatsApp Encryption Overview Technical white paper, vol. 3, October 2020. https:\/\/www.whatsapp.com\/security\/WhatsApp-Security-Whitepaper.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8733-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:59Z","timestamp":1765933379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8733-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987320","9789819987337"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8733-7_10","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":"18 December 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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.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":"375","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":"106","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":"28% - 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":"12","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"}]}}