{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T14:41:36Z","timestamp":1775227296383,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030752446","type":"print"},{"value":"9783030752453","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-75245-3_19","type":"book-chapter","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T15:04:51Z","timestamp":1619795091000},"page":"512-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Universal Proxy Re-Encryption"],"prefix":"10.1007","author":[{"given":"Nico","family":"D\u00f6ttling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-00862-7_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"G Ateniese","year":"2009","unstructured":"Ateniese, G., Benson, K., Hohenberger, S.: Key-private proxy re-encryption. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 279\u2013294. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_19"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-03515-4_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"Y Aono","year":"2013","unstructured":"Aono, Y., Boyen, X., Phong, L.T., Wang, L.: Key-private proxy re-encryption under LWE. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 1\u201318. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03515-4_1"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-45374-9_7","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"T Agrikola","year":"2020","unstructured":"Agrikola, T., Couteau, G., Hofheinz, D.: The usefulness of sparsifiable inputs: how to avoid subexponential iO. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 187\u2013219. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_7"},{"key":"19_CR4","unstructured":"Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved Proxy re-encryption schemes with applications to secure distributed storage. In: NDSS 2005 (2005)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Blaze","year":"1998","unstructured":"Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127\u2013144. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054122"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012)","journal-title":"J. ACM"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-319-78381-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Lombardi, A., Segev, G., Vaikuntanathan, V.: Anonymous IBE, leakage resilience and circular security from new assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 535\u2013564. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_20"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-54631-0_6","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"N Chandran","year":"2014","unstructured":"Chandran, N., Chase, M., Liu, F.-H., Nishimaki, R., Xagawa, K.: Re-encryption, functional re-encryption, and multi-hop re-encryption: a framework for achieving obfuscation-based security and instantiations from lattices. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 95\u2013112. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_6"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-28914-9_23","volume-title":"Theory of Cryptography","author":"N Chandran","year":"2012","unstructured":"Chandran, N., Chase, M., Vaikuntanathan, V.: Functional re-encryption and collusion-resistant obfuscation. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 404\u2013421. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_23"},{"key":"19_CR11","first-page":"185","volume":"2007","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Hohenberger, S.: Chosen-ciphertext secure proxy re-encryption. ACM CCS 2007, 185\u2013194 (2007)","journal-title":"ACM CCS"},{"issue":"6","key":"19_CR12","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1137\/18M1164834","volume":"47","author":"A Cohen","year":"2018","unstructured":"Cohen, A., Holmgren, J., Nishimaki, R., Vaikuntanathan, V., Wichs, D.: Watermarking cryptographic capabilities. SIAM J. Comput. 47(6), 2157\u20132202 (2018)","journal-title":"SIAM J. Comput."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-46497-7_19","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 468\u2013497. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Cohen, A.: What about bob? the inadequacy of CPA security for proxy reencryption. In: PKC 2019, Part II. LNCS, vol. 11443, pp. 287\u2013316 (2019)","DOI":"10.1007\/978-3-030-17259-6_10"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-53018-4_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"G Couteau","year":"2016","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Encryption switching protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 308\u2013338. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_12"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Chow, S.S.M., Weng, J., Yang, Y., Deng, R.H.: Efficient unidirectional proxy re-encryption. In: AFRICACRYPT 10. LNCS, vol. 6055, pp. 316\u2013332 (2010)","DOI":"10.1007\/978-3-642-12678-9_19"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-030-21548-4_4","volume-title":"Information Security and Privacy","author":"A Davidson","year":"2019","unstructured":"Davidson, A., Deo, A., Lee, E., Martin, K.: Strong post-compromise secure proxy re-encryption. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 58\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_4"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-76578-5_8","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"D Derler","year":"2018","unstructured":"Derler, D., Krenn, S., Lor\u00fcnser, T., Ramacher, S., Slamanig, D., Striecks, C.: Revisiting proxy re-encryption: forward secrecy, improved security, and applications. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 219\u2013250. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_8"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89641-8_1","volume-title":"Cryptology and Network Security","author":"RH Deng","year":"2008","unstructured":"Deng, R.H., Weng, J., Liu, S., Chen, K.: Chosen-ciphertext secure proxy re-encryption without pairings. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol. 5339, pp. 1\u201317. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89641-8_1"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theor. 31, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-17259-6_11","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Kamath, C., Klein, K., Pietrzak, K.: Adaptively secure proxy re-encryption. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 317\u2013346. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_11"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-662-46497-7_20","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 498\u2013527. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_20"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR27","unstructured":"Gaddam, S., Sinha, R., Luykx, A.: Applying proxy-re-encryption to payments. Real World Crypto 2019 (2019). https:\/\/rwc.iacr.org\/2019\/slides\/Applying_PRE_Payments.pdf"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-662-49096-9_18","volume-title":"Theory of Cryptography","author":"J Hesse","year":"2016","unstructured":"Hesse, J., Hofheinz, D., Rupp, A.: Reconfigurable cryptography: a flexible approach to long-term security. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 416\u2013445. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_18"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-27954-6_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"G Hanaoka","year":"2012","unstructured":"Hanaoka, G., Kawai, Y., Kunihiro, N., Matsuda, T., Weng, J., Zhang, R., Zhao, Y.: Generic construction of chosen ciphertext secure proxy re-encryption. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 349\u2013364. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27954-6_22"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46803-6_1","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Hohenberger","year":"2015","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Universal signature aggregators. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 3\u201334. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_1"},{"issue":"4","key":"19_CR31","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/s00145-010-9077-7","volume":"24","author":"S Hohenberger","year":"2010","unstructured":"Hohenberger, S., Rothblum, G.N., Shelat, A., Vaikuntanathan, V.: Securely obfuscating re-encryption. J. Cryptol. 24(4), 694\u2013719 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9077-7","journal-title":"J. Cryptol."},{"key":"19_CR32","unstructured":"Ivan, A., Dodis, Y.: Proxy cryptography revisited. In: NDSS\u00a02003 (2003)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-49162-7_9","volume-title":"Public Key Cryptography","author":"M Jakobsson","year":"1999","unstructured":"Jakobsson, M.: On quorum controlled asymmetric proxy re-encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 112\u2013121. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49162-7_9"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Libert, B., Vergnaud, D.: Unidirectional chosen-ciphertext secure proxy re-encryption. In: PKC 2008. LNCS, vol. 4939, pp. 360\u2013379 (2008)","DOI":"10.1007\/978-3-540-78440-1_21"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Nishimaki, R., Xagawa, K.: Key-private proxy re-encryption from lattices, revisited. IEICE Trans. 98-A(1), 100\u2013116 (2015)","DOI":"10.1587\/transfun.E98.A.100"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Polyakov, Y., Rohloff, K., Sahu, G., Vaikuntanathan, V.: Fast proxy re-encryption for publish\/subscribe systems. ACM Trans. Priv. Secur. 20(4), 14:1\u201314:31 (2017)","DOI":"10.1145\/3128607"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Shao, J., Cao, Z.: CCA-secure proxy re-encryption without pairings. In: PKC 2009. LNCS, vol. 5443, pp. 357\u2013376 (2009)","DOI":"10.1007\/978-3-642-00468-1_20"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75245-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T00:07:10Z","timestamp":1714435630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75245-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752446","9783030752453"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75245-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2021\/","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":"Web-Submission-and-Review","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"156","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":"52","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":"33% - 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,5","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}