{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:38:11Z","timestamp":1777549091699,"version":"3.51.4"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306198","type":"print"},{"value":"9783031306204","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-30620-4_20","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T11:03:05Z","timestamp":1681470185000},"page":"605-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Broadcast, Trace and\u00a0Revoke with\u00a0Optimal Parameters from\u00a0Polynomial Hardness"],"prefix":"10.1007","author":[{"given":"Shweta","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simran","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anshu","family":"Yadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shota","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new techniques for bootstrapping and instantiation. In: Eurocrypt (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7","DOI":"10.1007\/978-3-030-17653-2_7"},{"key":"20_CR2","unstructured":"Agrawal, S., Kumari, S., Yadav, A., Yamada, S.: Trace and revoke with optimal parameters from polynomial hardness. Cryptology ePrint Archive (2022). https:\/\/eprint.iacr.org\/2022\/1347.pdf"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Maitra, M.: Fe and iO for turing machines from minimal assumptions. In: Beimel, A., Dziembowski, S. (eds.) Theory of Cryptography. TCC 2018. LNCS, vol. 11240. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_18","DOI":"10.1007\/978-3-030-03810-6_18"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Pellet-Mary, A.: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE. In: Eurocrypt (2020)","DOI":"10.1007\/978-3-030-45721-1_5"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Wichs, D., Yamada, S.: Optimal broadcast encryption from LWE and pairings in the standard model. In: TCC (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_6","DOI":"10.1007\/978-3-030-64375-1_6"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Yamada, S.: Optimal broadcast encryption from pairings and LWE. In: EUROCRYPT (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_2","DOI":"10.1007\/978-3-030-45721-1_2"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Ananth, P., Brakerski, Z., Segev, G., Vaikuntanathan, V.: From selective to adaptive security in functional encryption. In: CRYPTO (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_32","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: CRYPTO (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-19379-8_6","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"N Attrapadung","year":"2011","unstructured":"Attrapadung, N., Libert, B., de Panafieu, E.: Expressive key-policy attribute-based encryption with constant-size ciphertexts. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 90\u2013108. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_6"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (Im)possibility of obfuscating programs. In: CRYPTO (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: IEEE Symposium on Security and Privacy, pp. 321\u2013334 (2007). https:\/\/doi.org\/10.1109\/SP.2007.11","DOI":"10.1109\/SP.2007.11"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. In: FOCS (2015)","DOI":"10.1007\/978-3-662-49096-9_4"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: EUROCRYPT (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: CRYPTO (2005). https:\/\/doi.org\/10.1007\/11535218_16","DOI":"10.1007\/11535218_16"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Boneh, D., Waters, B., Zhandry, M.: Low overhead broadcast encryption from multilinear maps. In: CRYPTO (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_12","DOI":"10.1007\/978-3-662-44371-2_12"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/978-3-662-44371-2_27","volume":"79","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica 79(4), 1233\u20131285 (2017). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27","journal-title":"Algorithmica"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (without random oracles). In: CRYPTO (2006). https:\/\/doi.org\/10.1007\/11818175_17","DOI":"10.1007\/11818175_17"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/978-3-662-49896-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Z Brakerski","year":"2016","unstructured":"Brakerski, Z., Komargodski, I., Segev, G.: Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 852\u2013880. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_30"},{"issue":"1","key":"20_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00145-017-9255-y","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Segev, G.: Function-private functional encryption in the private-key setting. J. Cryptol. 31(1), 202\u2013225 (2018). https:\/\/doi.org\/10.1007\/s00145-017-9255-y","journal-title":"J. Cryptol."},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Caro, A.D., Iovino, V., Jain, A., O\u2019Neill, A., Paneth, O., Persiano, G.: On the achievability of simulation-based security for functional encryption. In: CRYPTO (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_29","DOI":"10.1007\/978-3-642-40084-1_29"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Chen, Y., Vaikuntanathan, V., Waters, B., Wee, H., Wichs, D.: Traitor-tracing from LWE made simple and attribute-based. In: TCC (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_13","DOI":"10.1007\/978-3-030-03810-6_13"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: CRYPTO (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2","DOI":"10.1007\/978-3-319-63715-0_2"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: CRYPTO (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_25","DOI":"10.1007\/3-540-48658-5_25"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Coron, J., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: CRYPTO (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26","DOI":"10.1007\/978-3-642-40041-4_26"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Devadas, L., Quach, W., Vaikuntanathan, V., Wee, H., Wichs, D.: Succinct LWE sampling, random polynomials, and obfuscation. In: TCC (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_9","DOI":"10.1007\/978-3-030-90453-1_9"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO (1993). https:\/\/doi.org\/10.1007\/3-540-48329-2_40","DOI":"10.1007\/3-540-48329-2_40"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: EUROCRYPT (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Garg, S., Pandey, O., Srinivasan, A.: Revisiting the cryptographic hardness of finding a Nash equilibrium. In: CRYPTO (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_20","DOI":"10.1007\/978-3-662-53008-5_20"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Garg, S., Pandey, O., Srinivasan, A., Zhandry, M.: Breaking the sub-exponential barrier in Obfustopia. In: EUROCRYPT (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_6","DOI":"10.1007\/978-3-319-56617-7_6"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: STOC (2021). https:\/\/doi.org\/10.1145\/3406325.3451070","DOI":"10.1145\/3406325.3451070"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute based encryption for circuits. In: STOC (2013). https:\/\/doi.org\/10.1145\/2488608.2488677","DOI":"10.1145\/2488608.2488677"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: FOCS (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.62","DOI":"10.1109\/FOCS.2017.62"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Collusion resistant traitor tracing from learning with errors. In: STOC (2018). https:\/\/doi.org\/10.1145\/3188745.3188844","DOI":"10.1145\/3188745.3188844"},{"key":"20_CR34","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: New approaches to traitor tracing with embedded identities. In: TCC (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_6","DOI":"10.1007\/978-3-030-36033-7_6"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Goyal, R., Quach, W., Waters, B., Wichs, D.: Broadcast and trace with $$n^\\epsilon $$ ciphertext size from standard assumptions. In: Crypto (2019). https:\/\/eprint.iacr.org\/2019\/636","DOI":"10.1007\/978-3-030-26954-8_27"},{"key":"20_CR36","doi-asserted-by":"publisher","unstructured":"Goyal, R., Vusirikala, S., Waters, B.: Collusion resistant broadcast and trace from positional witness encryption. In: PKC (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_1","DOI":"10.1007\/978-3-030-17259-6_1"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Lou, P., Sahai, A.: Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum IO. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30545-0_8"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: STOC (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"20_CR39","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over large fields, DLIN, and constant depth PRGs. In: EUROCRYPT (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"20_CR40","doi-asserted-by":"publisher","unstructured":"Kim, S., Wu, D.J.: Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions. In: ASIACRYPT (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_3","DOI":"10.1007\/978-3-030-64834-3_3"},{"issue":"2","key":"20_CR41","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-319-56620-7\\_5","volume":"33","author":"I Komargodski","year":"2020","unstructured":"Komargodski, I., Segev, G.: From minicrypt to Obfustopia via private-key functional encryption. J. Cryptol. 33(2), 406\u2013458 (2020). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_5","journal-title":"J. Cryptol."},{"key":"20_CR42","doi-asserted-by":"publisher","unstructured":"Lin, H., Pass, R., Seth, K., Telang, S.: Output-compressing randomized encodings and applications. In: TCC (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_5","DOI":"10.1007\/978-3-662-49096-9_5"},{"issue":"6","key":"20_CR43","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10207-010-0121-2","volume":"9","author":"M Naor","year":"2010","unstructured":"Naor, M., Pinkas, B.: Efficient trace and revoke schemes. Int. J. Inf. Secur. 9(6), 411\u2013424 (2010). https:\/\/doi.org\/10.1007\/s10207-010-0121-2","journal-title":"Int. J. Inf. Secur."},{"key":"20_CR44","doi-asserted-by":"publisher","unstructured":"Nishimaki, R., Wichs, D., Zhandry, M.: Anonymous traitor tracing: how to embed arbitrary information in a key. In: EUROCRYPT (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_14","DOI":"10.1007\/978-3-662-49896-5_14"},{"key":"20_CR45","doi-asserted-by":"publisher","unstructured":"Takashima, K.: Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption. In: SCN (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_17","DOI":"10.1007\/978-3-319-10879-7_17"},{"key":"20_CR46","doi-asserted-by":"crossref","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Crypto (2022)","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"20_CR47","doi-asserted-by":"crossref","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and null-IO from evasive LWE. In: Asiacrypt (2022)","DOI":"10.1007\/978-3-031-22963-3_7"},{"key":"20_CR48","doi-asserted-by":"publisher","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Eurocrypt (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"20_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"},{"key":"20_CR50","doi-asserted-by":"publisher","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: FOCS (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.61","DOI":"10.1109\/FOCS.2017.61"},{"key":"20_CR51","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: New techniques for traitor tracing: Size $$ {N}^{1\/3}$$ and more from pairings. In: CRYPTO (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_22","DOI":"10.1007\/978-3-030-56784-2_22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30620-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:32Z","timestamp":1744754612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30620-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306198","9783031306204"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30620-4_20","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":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.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":"415","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":"109","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":"16","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)"}}]}}