{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:35:05Z","timestamp":1784874905104,"version":"3.55.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030884178","type":"print"},{"value":"9783030884185","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88418-5_16","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T21:04:30Z","timestamp":1632949470000},"page":"327-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Revocable Policy-Based Chameleon Hash"],"prefix":"10.1007","author":[{"given":"Shengmin","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianting","family":"Ning","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinhua","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guowen","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaming","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert H.","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"16_CR1","unstructured":"General data protection regulation. https:\/\/gdpr-info.eu\/"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chase, M.: FAME: fast attribute-based message encryption. In: CCS, pp. 665\u2013682 (2017)","DOI":"10.1145\/3133956.3134014"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Chou, D.H., de\u00a0Medeiros, B., Tsudik, G.: Sanitizable signatures. In: ESORICS, vol.\u00a03679, pp. 159\u2013177 (2005)","DOI":"10.1007\/11555827_10"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Magri, B., Venturi, D., Andrade, E.R.: Redactable blockchain - or - rewriting history in bitcoin and friends. In: EuroS&P, pp. 111\u2013126 (2017)","DOI":"10.1109\/EuroSP.2017.37"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Attrapadung, N.: Dual system encryption framework in prime-order groups via computational pair encodings. In: ASIACRYPT, pp. 591\u2013623 (2016)","DOI":"10.1007\/978-3-662-53890-6_20"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Attrapadung, N., Imai, H.: Attribute-based encryption supporting direct\/indirect revocation modes. In: IMA, pp. 278\u2013300 (2009)","DOI":"10.1007\/978-3-642-10868-6_17"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: IEEE S&P, pp. 321\u2013334 (2007)","DOI":"10.1109\/SP.2007.11"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Bilzhause, A., P\u00f6hls, H.C., Samelin, K.: Position paper: the past, present, and future of sanitizable and redactable signatures. In: ARES, pp. 87:1\u201387:9 (2017)","DOI":"10.1145\/3098954.3104058"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Goyal, V., Kumar, V.: Identity-based encryption with efficient revocation. In: CCS, pp. 417\u2013426 (2008)","DOI":"10.1145\/1455770.1455823"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Efficient selective-id secure identity-based encryption without random oracles. In: EUROCRYPT, vol.\u00a03027, pp. 223\u2013238 (2004)","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Goh, E.: Hierarchical identity based encryption with constant size ciphertext. In: EUROCRYPT, vol.\u00a03494, pp. 440\u2013456 (2005)","DOI":"10.1007\/11426639_26"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-17253-4_6","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"X Bultel","year":"2019","unstructured":"Bultel, X., Lafourcade, P., Lai, R.W.F., Malavolta, G., Schr\u00f6der, D., Thyagarajan, S.A.K.: Efficient invisible and unlinkable sanitizable signatures. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11442, pp. 159\u2013189. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_6"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-662-54388-7_6","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"J Camenisch","year":"2017","unstructured":"Camenisch, J., Derler, D., Krenn, S., P\u00f6hls, H.C., Samelin, K., Slamanig, D.: Chameleon-hashes with ephemeral trapdoors. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10175, pp. 152\u2013182. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_6"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Cui, H., Deng, R.H., Li, Y., Qin, B.: Server-aided revocable attribute-based encryption. In: ESORICS, vol.\u00a09879, pp. 570\u2013587 (2016)","DOI":"10.1007\/978-3-319-45741-3_29"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Derler, D., Samelin, K., Slamanig, D., Striecks, C.: Fine-grained and controlled rewriting in blockchains: Chameleon-hashing gone attribute-based. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23066"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Deuber, D., Magri, B., Thyagarajan, S.A.K.: Redactable blockchain in the permissionless setting. In: IEEE SP, pp. 124\u2013138 (2019)","DOI":"10.1109\/SP.2019.00039"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-93387-0_11","volume-title":"Applied Cryptography and Network Security","author":"M Fischlin","year":"2018","unstructured":"Fischlin, M., Harasser, P.: Invisible sanitizable signatures and public-key encryption are equivalent. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 202\u2013220. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_11"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-662-49384-7_12","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"N Fleischhacker","year":"2016","unstructured":"Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schr\u00f6der, D., Simkin, M.: Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 301\u2013330. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_12"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: CCS, pp. 89\u201398 (2006)","DOI":"10.1145\/1180405.1180418"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-38980-1_22","volume-title":"Applied Cryptography and Network Security","author":"A Guillevic","year":"2013","unstructured":"Guillevic, A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 357\u2013372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_22"},{"key":"16_CR23","unstructured":"Kohno, T., Stubblefield, A., Rubin, A.D., Wallach, D.S.: Analysis of an electronic voting system. In: IEEE S&P, p. 27 (2004)"},{"key":"16_CR24","unstructured":"Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS (2000)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In: EUROCRYPT, vol.\u00a06110, pp. 62\u201391 (2010)","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-319-93387-0_27","volume-title":"Applied Cryptography and Network Security","author":"JK Liu","year":"2018","unstructured":"Liu, J.K., Yuen, T.H., Zhang, P., Liang, K.: Time-based direct revocable ciphertext-policy attribute-based encryption with short revocation list. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 516\u2013534. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_27"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-662-58387-6_23","volume-title":"Financial Cryptography and Data Security","author":"R Matzutt","year":"2018","unstructured":"Matzutt, R., et al.: A quantitative analysis of the impact of arbitrary blockchain content on bitcoin. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 420\u2013438. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58387-6_23"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Matzutt, R., Hohlfeld, O., Henze, M., Rawiel, R., Ziegeldorf, J.H., Wehrle, K.: POSTER: i don\u2019t want that content! on the risks of exploiting bitcoin\u2019s blockchain as a content store. In: CCS, pp. 1769\u20131771 (2016)","DOI":"10.1145\/2976749.2989059"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Naor","year":"2001","unstructured":"Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41\u201362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_3"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-34961-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Okamoto","year":"2012","unstructured":"Okamoto, T., Takashima, K.: Fully secure unbounded inner-product and attribute-based encryption. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 349\u2013366. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_22"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-030-02641-7_25","volume-title":"Cryptology and Network Security","author":"B Qin","year":"2018","unstructured":"Qin, B., Zhao, Q., Zheng, D., Cui, H.: Server-aided revocable attribute-based encryption resilient to decryption key exposure. In: Capkun, S., Chow, S.S.M. (eds.) CANS 2017. LNCS, vol. 11261, pp. 504\u2013514. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02641-7_25"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Rouselakis, Y., Waters, B.: Practical constructions and new proof methods for large universe attribute-based encryption. In: CCS, pp. 463\u2013474 (2013)","DOI":"10.1145\/2508859.2516672"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-32009-5_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A Sahai","year":"2012","unstructured":"Sahai, A., Seyalioglu, H., Waters, B.: Dynamic credentials and ciphertext delegation for attribute-based encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 199\u2013217. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_13"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-030-40186-3_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"K Samelin","year":"2020","unstructured":"Samelin, K., Slamanig, D.: Policy-based sanitizable signatures. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 538\u2013563. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_23"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-36362-7_14","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"JH Seo","year":"2013","unstructured":"Seo, J.H., Emura, K.: Revocable identity-based encryption revisited: security model and construction. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 216\u2013234. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_14"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Tian, Y., Li, N., Li, Y., Szalachowski, P., Zhou, J.: Policy-based chameleon hash for blockchain rewriting with black-box accountability. In: ACSAC, pp. 813\u2013828 (2020)","DOI":"10.1145\/3427228.3427247"},{"key":"16_CR37","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ins.2018.11.031","volume":"479","author":"S Xu","year":"2019","unstructured":"Xu, S., Yang, G., Mu, Y.: Revocable attribute-based encryption with decryption key exposure resistance and ciphertext delegation. Inf. Sci. 479, 116\u2013134 (2019)","journal-title":"Inf. Sci."},{"issue":"8","key":"16_CR38","doi-asserted-by":"publisher","first-page":"2101","DOI":"10.1109\/TIFS.2018.2810065","volume":"13","author":"S Xu","year":"2018","unstructured":"Xu, S., Yang, G., Mu, Y., Deng, R.H.: Secure fine-grained access control and data sharing for dynamic groups in the cloud. IEEE Trans. Inf. Forensics Secur. 13(8), 2101\u20132113 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"16_CR39","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.future.2019.02.051","volume":"97","author":"S Xu","year":"2019","unstructured":"Xu, S., Yang, G., Mu, Y., Liu, X.: A secure IoT cloud storage system with fine-grained access control and decryption key exposure resistance. Future Gener. Comput. Syst. 97, 284\u2013294 (2019)","journal-title":"Future Gener. Comput. Syst."},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Xu, S., Zhang, Y., Li, Y., Liu, X., Yang, G.: Generic construction of ElGama-type attribute-based encryption schemes with revocability and dual-policy. In: SecureComm, vol.\u00a0305, pp. 184\u2013204 (2019)","DOI":"10.1007\/978-3-030-37231-6_10"},{"key":"16_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-24177-7_8","volume-title":"Computer Security \u2013 ESORICS 2015","author":"Y Yang","year":"2015","unstructured":"Yang, Y., Liu, J.K., Liang, K., Choo, K.-K.R., Zhou, J.: Extended proxy-assisted approach: achieving revocable fine-grained encryption of cloud data. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9327, pp. 146\u2013166. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24177-7_8"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88418-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T21:16:02Z","timestamp":1632950162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88418-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030884178","9783030884185"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88418-5_16","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":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2021.athene-center.de\/index.php","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"351","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":"71","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":"20% - 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.07","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":"6.06","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":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}