{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:09Z","timestamp":1778065149665,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819973552","type":"print"},{"value":"9789819973569","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-7356-9_5","type":"book-chapter","created":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T09:03:24Z","timestamp":1697706204000},"page":"69-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["PAE: Towards More Efficient and\u00a0BBB-Secure AE from\u00a0a\u00a0Single Public Permutation"],"prefix":"10.1007","author":[{"given":"Arghya","family":"Bhattacharjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ritam","family":"Bhaumik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avijit","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eik","family":"List","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,20]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-662-46706-0_9","volume-title":"Fast Software Encryption","author":"E Andreeva","year":"2015","unstructured":"Andreeva, E., et al.: APE: authenticated permutation-based encryption for lightweight cryptography. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 168\u2013186. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_9"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-34621-8_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"E Andreeva","year":"2019","unstructured":"Andreeva, E., Lallemand, V., Purnal, A., Reyhanitabar, R., Roy, A., Viz\u00e1r, D.: Forkcipher: a new primitive for authenticated encryption of very short messages. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 153\u2013182. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_6"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Beierle, C., et al.: Schwaemm and esch: lightweight authenticated encryption and hashing using the sparkle permutation family (2021)","DOI":"10.46586\/tosc.v2020.iS1.208-261"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"DJ Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 32\u201349. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11502760_3"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Beyne, T., Chen, Y.L., Dobraunig, C., Mennink, B.: Dumbo, jumbo, and delirium: parallel authenticated encryption for the lightweight circus. IACR Trans. Symmetric Cryptol. 2020(S1), 5\u201330 (2020)","DOI":"10.46586\/tosc.v2020.iS1.5-30"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-99277-4_8","volume-title":"Selected Areas in Cryptography","author":"T Beyne","year":"2022","unstructured":"Beyne, T., Chen, Y.L., Dobraunig, C., Mennink, B.: Multi-user security of the elephant v2 authenticated encryption mode. In: AlTawy, R., H\u00fclsing, A. (eds.) SAC 2021. LNCS, vol. 13203, pp. 155\u2013178. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_8"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, A., Bhaumik, R., Dutta, A., List, E.: PAE: towards more efficient and BBB-secure AE from a single public permutation. Cryptology ePrint Archive, Paper 2023\/978 (2023)","DOI":"10.1007\/978-981-99-7356-9_5"},{"key":"5_CR8","series-title":"LNCS","volume-title":"Selected Areas in Cryptography","author":"A Bhattacharjee","year":"2022","unstructured":"Bhattacharjee, A., Bhaumik, R., Nandi, M.: A sponge-based PRF with good multi-user security. In: Smith, B., Wu, H. (eds.) Selected Areas in Cryptography. LNCS, Springer, Cham (2022)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-031-22912-1_8","volume-title":"Progress in Cryptology","author":"A Bhattacharjee","year":"2022","unstructured":"Bhattacharjee, A., Bhaumik, R., Nandi, M.: Offset-based BBB-secure tweakable block-ciphers with updatable caches. In: Isobe, T., Sarkar, S. (eds.) INDOCRYPT 2022. LNCS, vol. 13774, pp. 171\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_8"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-22912-1_9","volume-title":"Progress in Cryptology","author":"A Bhattacharjee","year":"2022","unstructured":"Bhattacharjee, A., Chakraborti, A., Datta, N., Mancillas-L\u00f3pez, C., Nandi, M.: ISAP+: ISAP with fast authentication. In: Isobe, T., Sarkar, S. (eds.) INDOCRYPT 2022. LNCS, vol. 13774, pp. 195\u2013219. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22912-1_9"},{"issue":"6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1007\/s10623-022-01045-z","volume":"90","author":"A Bhattacharjee","year":"2022","unstructured":"Bhattacharjee, A., Dutta, A., List, E., Nandi, M.: CENCPP$$^*$$: beyond-birthday-secure encryption from public permutations. Des. Codes Cryptogryphy 90(6), 1381\u20131425 (2022)","journal-title":"Des. Codes Cryptogryphy"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1515\/jmc-2020-0018","volume":"15","author":"A Bhattacharjee","year":"2021","unstructured":"Bhattacharjee, A., L\u00f3pez, C.M., List, E., Nandi, M.: The oribatida v1.3 family of lightweight authenticated encryption schemes. J. Math. Cryptol. 15(1), 305\u2013344 (2021)","journal-title":"J. Math. Cryptol."},{"key":"5_CR13","unstructured":"Bhaumik, R., Chailloux, A., Frixons, P., Mennink, B., Naya-Plasencia, M.: Block cipher doubling for a post-quantum world. IACR Cryptology ePrint Archive, p. 1342 (2022)"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"218","DOI":"10.46586\/tches.v2018.i2.218-241","volume":"2018","author":"A Chakraborti","year":"2018","unstructured":"Chakraborti, A., Datta, N., Nandi, M., Yasuda, K.: Beetle family of lightweight and secure authenticated encryption ciphers. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(2), 218\u2013241 (2018)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-031-22963-3_13","volume-title":"Advances in Cryptology","author":"YL Chen","year":"2022","unstructured":"Chen, Y.L.: A modular approach to the security analysis of two-permutation constructions. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791, pp. 379\u2013409. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_13"},{"issue":"5","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1007\/s12095-022-00571-w","volume":"14","author":"YL Chen","year":"2022","unstructured":"Chen, Y.L., Dutta, A., Nandi, M.: Multi-user BBB security of public permutations based MAC. Cryptogr. Commun. 14(5), 1145\u20131177 (2022)","journal-title":"Cryptogr. Commun."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-26948-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"YL Chen","year":"2019","unstructured":"Chen, Y.L., Lambooij, E., Mennink, B.: How to build pseudorandom functions from public random permutations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 266\u2013293. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_10"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-030-92078-4_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"YL Chen","year":"2021","unstructured":"Chen, Y.L., Mennink, B., Preneel, B.: Categorization of faulty nonce misuse resistant message authentication. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 520\u2013550. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_18"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-53018-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"B Cogliati","year":"2016","unstructured":"Cogliati, B., Seurin, Y.: EWCDM: an efficient, beyond-birthday secure, nonce-misuse resistant MAC. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 121\u2013149. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_5"},{"issue":"S1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"60","DOI":"10.46586\/tosc.v2020.iS1.60-87","volume":"2020","author":"J Daemen","year":"2020","unstructured":"Daemen, J., Hoffert, S., Peeters, M., Van Assche, G., Van Keer, R.: Xoodyak, a lightweight cryptographic scheme. IACR Trans. Symmetric Cryptol. 2020(S1), 60\u201387 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., et al.: ISAP v2.0. IACR Trans. Symmetric Cryptol. 2020(S1), 390\u2013416 (2020)","DOI":"10.46586\/tosc.v2020.iS1.390-416"},{"key":"5_CR22","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2, September 27 2019. Submission to the NIST LwC competition. https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/lightweight-cryptography\/documents\/round-2\/spec-doc-rnd2\/ascon-spec-round2.pdf"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Ascon v1.2: lightweight authenticated encryption and hashing. J. Cryptol. 34(3), 33 (2021)","DOI":"10.1007\/s00145-021-09398-9"},{"key":"5_CR24","unstructured":"Dobraunig, C., Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Reference, highly optimized, masked C and ASM implementations of Ascon (2023). https:\/\/github.com\/ascon\/ascon-c. Accessed 28 June 2023"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-030-51938-4_9","volume-title":"Progress in Cryptology - AFRICACRYPT 2020","author":"A Dutta","year":"2020","unstructured":"Dutta, A., Nandi, M.: BBB secure nonce based MAC using public permutations. In: Nitaj, A., Youssef, A. (eds.) AFRICACRYPT 2020. LNCS, vol. 12174, pp. 172\u2013191. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_9"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-17653-2_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Dutta","year":"2019","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Beyond birthday bound secure MAC in faulty nonce model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 437\u2013466. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_15"},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.46586\/tosc.v2021.i2.31-70","volume":"2021","author":"A Dutta","year":"2021","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Permutation based EDM: an inverse free BBB secure PRF. IACR Trans. Symmetric Cryptol. 2021(2), 31\u201370 (2021)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-42068-0_12","volume-title":"Smart Card Research and Advanced Applications","author":"S Duval","year":"2020","unstructured":"Duval, S., Leurent, G.: Lightweight MACs from universal hash\u00a0functions. In: Bela\u00efd, S., G\u00fcneysu, T. (eds.) CARDIS 2019. LNCS, vol. 11833, pp. 195\u2013215. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-42068-0_12"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53018-4_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"VT Hoang","year":"2016","unstructured":"Hoang, V.T., Tessaro, S.: Key-alternating ciphers and key-length extension: exact bounds and multi-user security. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 3\u201332. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_1"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-319-63697-9_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B., Neves, S.: Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 556\u2013583. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_19"},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"228","DOI":"10.46586\/tosc.v2017.i3.228-252","volume":"2017","author":"B Mennink","year":"2017","unstructured":"Mennink, B., Neves, S.: Optimal PRFs from blockcipher designs. IACR Trans. Symmetric Cryptol. 2017(3), 228\u2013252 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-13858-4_13","volume-title":"Fast Software Encryption","author":"K Minematsu","year":"2010","unstructured":"Minematsu, K.: How to thwart birthday attacks against MACs via small randomness. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 230\u2013249. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13858-4_13"},{"key":"5_CR33","unstructured":"Mouha, N.: Chaskey: a MAC algorithm for microcontrollers - status update and proposal of Chaskey-12. IACR Cryptology ePrint Archive, p. 1182 (2015)"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-13051-4_19","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"N Mouha","year":"2014","unstructured":"Mouha, N., Mennink, B., Van Herrewege, A., Watanabe, D., Preneel, B., Verbauwhede, I.: Chaskey: an efficient MAC algorithm for 32-bit microcontrollers. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 306\u2013323. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_19"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Nir, Y., Langley, A.: RFC 8439: ChaCha20 and Poly1305 for IETF Protocols (2018)","DOI":"10.17487\/RFC8439"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"De Santis, F., Schauer, A., Sigl, G.: ChaCha20-Poly1305 authenticated encryption for high-speed embedded IoT applications. In: Atienza, D., Di Natale, G. (eds.) Design, Automation & Test in Europe Conference & Exhibition, pp. 692\u2013697. IEEE (2017)","DOI":"10.23919\/DATE.2017.7927078"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Turan, M.S., et al.: NIST Internal Report 8454 - Status Report on the Final Round of the NIST Lightweight Cryptography Standardization Process. Technical report, US National Institute of Standards and Technology (2023)","DOI":"10.6028\/NIST.IR.8454"},{"key":"5_CR38","first-page":"1","volume":"2021","author":"P Zhang","year":"2021","unstructured":"Zhang, P.: Permutation-based lightweight authenticated cipher with beyond conventional security. Secur. Commun. Netw. 2021, 1\u20139 (2021)","journal-title":"Secur. Commun. Netw."}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7356-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T05:23:38Z","timestamp":1703395418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7356-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819973552","9789819973569"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7356-9_5","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":"20 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"18 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icics23.nankai.edu.cn\/index.php","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"181","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":"38","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":"6","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":"21% - 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.33","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":"4.93","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)"}}]}}