{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:59:47Z","timestamp":1784995187819,"version":"3.55.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229626","type":"print"},{"value":"9783031229633","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22963-3_4","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"95-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Multi-Client Functional Encryption with\u00a0Fine-Grained Access Control"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3867-4209","authenticated-orcid":false,"given":"Ky","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1136-4064","authenticated-orcid":false,"given":"Duong Hieu","family":"Phan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6668-683X","authenticated-orcid":false,"given":"David","family":"Pointcheval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Bellare, M., Neven, G.: Robust encryption. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 480\u2013497. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_28","DOI":"10.1007\/978-3-642-11799-2_28"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Bourse, F., De Caro, A., Pointcheval, D.: Simple functional encryption schemes for inner products. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 733\u2013751. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_33","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"4_CR3","unstructured":"Abdalla, M., Bourse, F., De Caro, A., Pointcheval, D.: Better security for functional encryption for inner product evaluations. Cryptology ePrint Archive, Report 2016\/011 (2016). https:\/\/eprint.iacr.org\/2016\/011"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Catalano, D., Gay, R., Ursu, B.: Inner-product functional encryption with fine-grained access control. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 467\u2013497. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_16","DOI":"10.1007\/978-3-030-64840-4_16"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kitagawa, F., Modi, A., Nishimaki, R., Yamada, S., Yamakawa, T.: Bounded functional encryption for turing machines: Adaptive security from general assumptions. Cryptology ePrint Archive, Report 2022\/316 (2022). https:\/\/ia.cr\/2022\/316","DOI":"10.1007\/978-3-031-22318-1_22"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products, from standard assumptions. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part III. LNCS, vol. 9816, pp. 333\u2013362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_12","DOI":"10.1007\/978-3-662-53015-3_12"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Maitra, M., Vempati, N.S., Yamada, S.: Functional encryption for turing machines with dynamic bounded collusion from LWE. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 239\u2013269. Springer, Heidelberg, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_9","DOI":"10.1007\/978-3-030-84259-8_9"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Ananth, P., Sahai, A.: Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 152\u2013181. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_6","DOI":"10.1007\/978-3-319-56620-7_6"},{"key":"4_CR9","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-19379-8_6"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Baltico, C.E.Z., Catalano, D., Fiore, D., Gay, R.: Practical functional encryption for quadratic functions with applications to predicate encryption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 67\u201398. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_3","DOI":"10.1007\/978-3-319-63688-7_3"},{"key":"4_CR11","unstructured":"Beimel, A.: Secure Schemes for Secret Sharing and Key Distribution. Ph.D. thesis, Technion - Israel Institute of Technology, Haifa, Israel (June 1996). https:\/\/www.cs.bgu.ac.il\/~beimel\/Papers\/thesis.pdf"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Bellare, M., O\u2019Neill, A.: Semantically-secure functional encryption: Possibility results, impossibility results and the quest for a general definition. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 13. LNCS, vol. 8257, pp. 218\u2013234. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-319-02937-5_12","DOI":"10.1007\/978-3-319-02937-5_12"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO\u201988. LNCS, vol. 403, pp. 27\u201335. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3","DOI":"10.1007\/0-387-34799-2_3"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Bourse, F., Lipmaa, H.: CCA-secure inner-product functional encryption from projective hash functions. In: Fehr, S. (ed.) PKC 2017, Part II. LNCS, vol. 10175, pp. 36\u201366. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_2","DOI":"10.1007\/978-3-662-54388-7_2"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Boneh, D., Franklin, M.K.: 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","DOI":"10.1007\/3-540-44647-8_13"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Boneh, D., Gentry, C., Hamburg, M.: Space-efficient identity based encryption without pairings. In: 48th FOCS. pp. 647\u2013657. IEEE Computer Society Press (2007). https:\/\/doi.org\/10.1109\/FOCS.2007.64","DOI":"10.1109\/FOCS.2007.64"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: Definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Practical fully secure unrestricted inner product functional encryption modulo p. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part II. LNCS, vol. 11273, pp. 733\u2013764. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_25","DOI":"10.1007\/978-3-030-03329-3_25"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., Wee, H.: Shorter IBE and signatures via asymmetric pairings. In: Abdalla, M., Lange, T. (eds.) PAIRING 2012. LNCS, vol. 7708, pp. 122\u2013140. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_8","DOI":"10.1007\/978-3-642-36334-4_8"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Chotard, J., Dufour Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Decentralized multi-client functional encryption for inner product. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part II. LNCS, vol. 11273, pp. 703\u2013732. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_24","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Chotard, J., Dufour Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Multi-client functional encryption with repetition for inner product. Cryptology ePrint Archive, Report 2018\/1021 (2018). https:\/\/eprint.iacr.org\/2018\/1021","DOI":"10.1007\/978-3-030-03329-3_24"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Chotard, J., Dufour-Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Dynamic decentralized functional encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part I. LNCS, vol. 12170, pp. 747\u2013775. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_25","DOI":"10.1007\/978-3-030-56784-2_25"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C Cocks","year":"2001","unstructured":"Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_32"},{"key":"4_CR24","unstructured":"Delerabl\u00e9e, C., Gouriou, L., Pointcheval, D.: Key-policy ABE with delegation of rights. Cryptology ePrint Archive, Report 2021\/867 (2021). https:\/\/ia.cr\/2021\/867"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Gay, R.: A new paradigm for public-key functional encryption for degree-2 polynomials. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020, Part I. LNCS, vol. 12110, pp. 95\u2013120. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_4","DOI":"10.1007\/978-3-030-45374-9_4"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Gordon, S.D., Goyal, V., Jain, A., Katz, J., Liu, F.H., Sahai, A., Shi, E., Zhou, H.S.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"4_CR28","unstructured":"Gordon, S.D., Katz, J., Liu, F.H., Shi, E., Zhou, H.S.: Multi-input functional encryption. Cryptology ePrint Archive, Report 2013\/774 (2013). https:\/\/eprint.iacr.org\/2013\/774"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006. pp. 89\u201398. ACM Press (2006). https:\/\/doi.org\/10.1145\/1180405.1180418, available as Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Lai, Q., Liu, F.H., Wang, Z.: New lattice two-stage sampling technique and its applications to functional encryption - stronger security and smaller ciphertexts. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 498\u2013527. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_18","DOI":"10.1007\/978-3-030-77870-5_18"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Lewko, A.B., Waters, B.: New techniques for dual system encryption and fully secure HIBE with short ciphertexts. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 455\u2013479. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_27","DOI":"10.1007\/978-3-642-11799-2_27"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Libert, B., Titiu, R.: Multi-client functional encryption for linear functions in the standard model from LWE. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 520\u2013551. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_18","DOI":"10.1007\/978-3-030-34618-8_18"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 599\u2013629. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20","DOI":"10.1007\/978-3-319-63688-7_20"},{"key":"4_CR34","unstructured":"Nguyen, K., Phan, D.H., Pointcheval, D.: Multi-client functional encryption with fine-grained access control. Cryptology ePrint Archive, Report 2022\/215 (2022). https:\/\/eprint.iacr.org\/2022\/215"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Takashima, K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 191\u2013208. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_11","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"Okamoto, T., Takashima, K.: Adaptively attribute-hiding (hierarchical) inner product encryption. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 591\u2013608. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_35","DOI":"10.1007\/978-3-642-29011-4_35"},{"key":"4_CR37","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-34961-4_22"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Sahai, A., Waters, B.: Attribute-based encryption with non-monotonic access structures. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) ACM CCS 2007. pp. 195\u2013203. ACM Press (2007). https:\/\/doi.org\/10.1145\/1315245.1315270","DOI":"10.1145\/1315245.1315270"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Pal, T., Dutta, R.: Attribute-based access control for inner product functional encryption from LWE. In: LATIN 2021 (2021)","DOI":"10.1007\/978-3-030-88238-9_7"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.R.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27","DOI":"10.1007\/11426639_27"},{"issue":"11","key":"4_CR41","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO\u201984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1984)","DOI":"10.1007\/3-540-39568-7_5"},{"key":"4_CR43","doi-asserted-by":"publisher","unstructured":"Waters, B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 619\u2013636. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_36","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"4_CR44","doi-asserted-by":"publisher","unstructured":"Wee, H.: Broadcast encryption with size $${N}^{1\/3}$$ and more from $$k$$-lin. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 155\u2013178. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_6","DOI":"10.1007\/978-3-030-84259-8_6"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22963-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:03:07Z","timestamp":1769216587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22963-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229626","9783031229633"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22963-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"364","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":"98","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":"27% - 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":"10","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"}]}}