{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:38:49Z","timestamp":1775817529398,"version":"3.50.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031547690","type":"print"},{"value":"9783031547706","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54770-6_10","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"237-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generic Construction of\u00a0Forward Secure Public Key Authenticated Encryption with\u00a0Keyword Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8969-3581","authenticated-orcid":false,"given":"Keita","family":"Emura","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M Abdalla","year":"2008","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. 21(3), 350\u2013391 (2008)","journal-title":"J. Cryptol."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: EUROCRYPT, pp. 553\u2013572 (2010)","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: CRYPTO, pp. 98\u2013115 (2010)","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"P.S.L.M., Barreto, Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: SCN, pp. 257\u2013267 (2002). https:\/\/doi.org\/10.1007\/3-540-36413-7_19","DOI":"10.1007\/3-540-36413-7_19"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Selected Areas in Cryptography, pp. 319\u2013331 (2005). https:\/\/doi.org\/10.1007\/11693383_2","DOI":"10.1007\/11693383_2"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Blackstone, L., Kamara, S., Moataz, T.: Revisiting leakage abuse attacks. The Internet Society, in NDSS (2020)","DOI":"10.14722\/ndss.2020.23103"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Blazy, O., Kiltz, E., Pan, J.: (hierarchical) identity-based encryption from affine message authentication. In: CRYPTO, pp. 408\u2013425 (2014)","DOI":"10.1007\/978-3-662-44371-2_23"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: EUROCRYPT, pp. 506\u2013522 (2004)","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: CRYPTO, pp. 213\u2013229 (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Boyen, X., Li, Q.: Towards tightly secure lattice short signature and id-based encryption. In: ASIACRYPT, pp. 404\u2013434 (2016)","DOI":"10.1007\/978-3-662-53890-6_14"},{"key":"10_CR11","unstructured":"Calderini, M., Longo, R., Sala, M., Villa, I.: Searchable encryption with randomized ciphertext and randomized keyword search. IACR Cryptol. ePrint Arch., 945 (2022)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00145-006-0442-5","volume":"20","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. J. Cryptol. 20(3), 265\u2013294 (2007)","journal-title":"J. Cryptol."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Ray, I., Li, N., Kruegel, C., editors, ACM CCS, pp. 668\u2013679 (2015)","DOI":"10.1145\/2810103.2813700"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25(4), 601\u2013639 (2012)","journal-title":"J. Cryptol."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Chen, J., Lim, H.W., Ling, S., Wang, H., Wee, H.: Shorter IBE and signatures via asymmetric pairings. Pairing-Based Crypt. 122\u2013140 (2012)","DOI":"10.1007\/978-3-642-36334-4_8"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Cheng, L., Meng, F.: Security analysis of Pan et al\u2019.s public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability. J. Syst. Archit. 119, 102248 (2021)","DOI":"10.1016\/j.sysarc.2021.102248"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Cheng, L., Meng, F.: Public key authenticated encryption with keyword search from LWE. In: ESORICS, pp. 303\u2013324 (2022)","DOI":"10.1007\/978-3-031-17140-6_15"},{"key":"10_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119060","volume":"640","author":"L Cheng","year":"2023","unstructured":"Cheng, L., Meng, F.: Public key authenticated searchable encryption against frequency analysis attacks. Inf. Sci. 640, 119060 (2023)","journal-title":"Inf. Sci."},{"key":"10_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119454","volume":"647","author":"L Cheng","year":"2023","unstructured":"Cheng, L., Qin, J., Feng, F., Meng, F.: Security-enhanced public-key authenticated searchable encryption. Inf. Sci. 647, 119454 (2023)","journal-title":"Inf. Sci."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Chi, T., Qin, B., Zheng, D.: An efficient searchable public-key authenticated encryption for cloud-assisted medical internet of things. Wireless Commun. Mobile Comput. 2020, 8816172:1\u20138816172:11 (2020)","DOI":"10.1155\/2020\/8816172"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Emura, K.: Generic construction of public-key authenticated encryption with keyword search revisited: stronger security and efficient construction. In: ACM APKC, pp. 39\u201349 (2022)","DOI":"10.1145\/3494105.3526237"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TDSC.2017.2754247","volume":"17","author":"K Emura","year":"2020","unstructured":"Emura, K., Hayashi, T., Ishida, A.: Group signatures with time-bound keys revisited: a new model, an efficient construction, and its implementation. IEEE Trans. Dependable Secure Comput. 17(2), 292\u2013305 (2020)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Practical identity-based encryption without random oracles. In: EUROCRYPT, pp. 445\u2013464 (2006)","DOI":"10.1007\/11761679_27"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: ACM STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., Silverberg, A.: Hierarchical id-based cryptography. In: Zheng, Y., editor, ASIACRYPT, pp. 548\u2013566 (2002)","DOI":"10.1007\/3-540-36178-2_34"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.03.038","volume":"403","author":"Q Huang","year":"2017","unstructured":"Huang, Q., Li, H.: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf. Sci. 403, 1\u201314 (2017)","journal-title":"Inf. Sci."},{"key":"10_CR27","unstructured":"Saiful Islam, M., Kuzu, M., Kantarcioglu, M.: Ramification, attack and mitigation. In: NDSS. The Internet Society, Access Pattern Disclosure on Searchable Encryption (2012)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Hafizul Islam, S.K., Mishra, N., Biswas, S., Keswani, B., Zeadally, S.: An efficient and forward-secure lattice-based searchable encryption scheme for the big-data era. Comput. Electr. Eng. 96, 107533 (2021)","DOI":"10.1016\/j.compeleceng.2021.107533"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Jager, T., Kurek, R., Niehues, D.: Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance. In: Public-Key Cryptography, pp. 596\u2013626 (2021)","DOI":"10.1007\/978-3-030-75245-3_22"},{"issue":"9","key":"10_CR30","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1093\/comjnl\/bxac075","volume":"66","author":"Z Jiang","year":"2023","unstructured":"Jiang, Z., Zhang, K., Wang, L., Ning, J.: Forward secure public-key authenticated encryption with conjunctive keyword search. Comput. J. 66(9), 2265\u20132278 (2023)","journal-title":"Comput. J."},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Jutla, C.S., Roy, A.: Shorter quasi-adaptive NIZK proofs for linear subspaces. In: ASIACRYPT, pp. 1\u201320 (2013)","DOI":"10.1007\/978-3-642-42033-7_1"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Kasamatsu, K., Matsuda, T., Emura, K., Attrapadung, N., Hanaoka, G., Imai, H.: Time-specific encryption from forward-secure encryption. In: SCN, pp. 184\u2013204 (2012)","DOI":"10.1007\/978-3-642-32928-9_11"},{"issue":"5","key":"10_CR33","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10207-015-0304-y","volume":"15","author":"K Kasamatsu","year":"2016","unstructured":"Kasamatsu, K., Matsuda, T., Emura, K., Attrapadung, N., Hanaoka, G., Imai, H.: Time-specific encryption from forward-secure encryption: generic and direct constructions. Int. J. Inf. Secur. 15(5), 549\u2013571 (2016)","journal-title":"Int. J. Inf. Secur."},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Katsumata, S.: On the untapped potential of encoding predicates by arithmetic circuits and their applications. In: ASIACRYPT, pp. 95\u2013125 (2017)","DOI":"10.1007\/978-3-319-70700-6_4"},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-020-09371-y","volume":"34","author":"S Katsumata","year":"2021","unstructured":"Katsumata, S., Yamada, S., Yamakawa, T.: Tighter security proofs for GPV-IBE in the quantum random oracle model. J. Cryptol. 34(1), 5 (2021)","journal-title":"J. Cryptol."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Kim, H., Hahn, C., Hur, J.: Forward secure public key encryption with keyword search for cloud-assisted IoT. In: IEEE CLOUD, pp. 549\u2013556 (2020)","DOI":"10.1109\/CLOUD49709.2020.00083"},{"issue":"2","key":"10_CR37","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10623-016-0303-7","volume":"85","author":"K Kurosawa","year":"2017","unstructured":"Kurosawa, K., Phong, L.T.: Anonymous and leakage resilient IBE and IPE. Des. Codes Crypt. 85(2), 273\u2013298 (2017)","journal-title":"Des. Codes Crypt."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Langrehr, R., Pan, J.: Hierarchical identity-based encryption with tight multi-challenge security. In: Public-Key Cryptography, pp.153\u2013183 (2020)","DOI":"10.1007\/978-3-030-45374-9_6"},{"issue":"2","key":"10_CR39","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10623-013-9868-6","volume":"74","author":"K Lee","year":"2015","unstructured":"Lee, K., Park, J.H., Lee, D.H.: Anonymous HIBE with short ciphertexts: full security in prime order groups. Designs, Codes Crypt. 74(2), 395\u2013425 (2015)","journal-title":"Designs, Codes Crypt."},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Lewko, A.B.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: EUROCRYPT, pp. 318\u2013335 (2012)","DOI":"10.1007\/978-3-642-29011-4_20"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Lin, H.-Y., Tzeng, W.-G.: An efficient solution to the millionaires\u2019 problem based on homomorphic encryption. In: ACNS, pp. 456\u2013466 (2005)","DOI":"10.1007\/11496137_31"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Liu, J.K., Chu, C.-K., Chow, S.S.M., Huang, X., Ho Au, M., Zhou, J.: Time-bound anonymous authentication for roaming networks. IEEE Trans. Inf. Forensics Secur. 10(1), 178\u2013189 (2015)","DOI":"10.1109\/TIFS.2014.2366300"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Liu, Z.-Y., Tseng, Y.-F., Tso, R., Mambo, M., Chen, y.-C.: Public-key authenticated encryption with keyword search: cryptanalysis, enhanced security, and quantum-resistant instantiation. In: IACR Cryptology ePrint Archive, p. 1008 (2021)","DOI":"10.1093\/comjnl\/bxab119"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Liu, Z.-Y., Tseng, Y.-F., Tso, R., Mambo, M., Chen, Y.-C.: Public-key authenticated encryption with keyword search: cryptanalysis, enhanced security, and quantum-resistant instantiation. In: ACM ASIACCS, pp. 423\u2013436 (2022)","DOI":"10.1145\/3488932.3497760"},{"issue":"4","key":"10_CR45","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1049\/iet-ifs.2018.5315","volume":"13","author":"M Noroozi","year":"2019","unstructured":"Noroozi, M., Eslami, Z.: Public key authenticated encryption with keyword search: revisited. IET Inf. Secur. 13(4), 336\u2013342 (2019)","journal-title":"IET Inf. Secur."},{"key":"10_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2021.102075","volume":"115","author":"X Pan","year":"2021","unstructured":"Pan, X., Li, F.: Public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability. J. Syst. Architect. 115, 102075 (2021)","journal-title":"J. Syst. Architect."},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Paterson, K.G., Quaglia, E.A.: Time-specific encryption. In: SCN, pp. 1\u201316 (2010)","DOI":"10.1007\/978-3-642-15317-4_1"},{"key":"10_CR48","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ins.2019.12.063","volume":"516","author":"Yu Baodong Qin","year":"2020","unstructured":"Baodong Qin, Yu., Chen, Q.H., Liu, X., Zheng, D.: Public-key authenticated encryption with keyword search revisited: security model and constructions. Inf. Sci. 516, 515\u2013528 (2020)","journal-title":"Inf. Sci."},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Qin, B., Cui, H., Zheng, X., Zheng, D.: Improved security model for public-key authenticated encryption with keyword search. In: ProvSec, pp. 19\u201338 (2021)","DOI":"10.1007\/978-3-030-90402-9_2"},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Ramanna, S.C., Sarkar, P.: Anonymous constant-size ciphertext HIBE from asymmetric pairings. In: IMACC, pp. 344\u2013363 (2013)","DOI":"10.1007\/978-3-642-45239-0_20"},{"key":"10_CR51","doi-asserted-by":"crossref","unstructured":"Ramanna, S.C., Sarkar, P.: Efficient (anonymous) compact HIBE from standard assumptions. In: ProvSec, pp. 243\u2013258 (2014)","DOI":"10.1007\/978-3-319-12475-9_17"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Sanders, O.: Improving revocation for group signature with redactable signature. In: Public-Key Cryptography, pp. 301\u2013330 (2021)","DOI":"10.1007\/978-3-030-75245-3_12"},{"key":"10_CR53","unstructured":"Xiaodong Song, D., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44\u201355 (2000)"},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Tang, Q.: Towards forward security properties for PEKS and IBE. In: ACISP, pp. 127\u2013144 (2015)","DOI":"10.1007\/978-3-319-19962-7_8"},{"key":"10_CR56","doi-asserted-by":"crossref","unstructured":"Xu, S., Cao, Y., Chen, X., Yiu, S.-M., Zhao, Y.: Post-quantum public-key authenticated searchable encryption with forward security: general construction, implementation, and applications. In: IACR Cryptology ePrint Archive, p. 591 (2023)","DOI":"10.1007\/978-981-97-0942-7_14"},{"key":"10_CR57","doi-asserted-by":"crossref","unstructured":"Yamada, S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: CRYPTO, pp. 161\u2013193 (2017)","DOI":"10.1007\/978-3-319-63697-9_6"},{"key":"10_CR58","doi-asserted-by":"crossref","unstructured":"Yu, X., Xu, L., Huang, X., Xu, C.: An efficient lattice-based encrypted search scheme with forward security. In: Network and System Security, pp. 712\u2013726 (2022)","DOI":"10.1007\/978-3-031-23020-2_40"},{"issue":"1","key":"10_CR59","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/TCC.2019.2944367","volume":"10","author":"M Zeng","year":"2022","unstructured":"Zeng, M., Qian, H., Chen, J., Zhang, K.: Forward secure public key encryption with keyword search for outsourced cloud storage. IEEE Trans. Cloud Comput. 10(1), 426\u2013438 (2022)","journal-title":"IEEE Trans. Cloud Comput."},{"issue":"3","key":"10_CR60","first-page":"1019","volume":"18","author":"X Zhang","year":"2021","unstructured":"Zhang, X., Chunxiang, X., Wang, H., Zhang, Y., Wang, S.: FS-PEKS: lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things. IEEE Trans. Dependable Secure Comput. 18(3), 1019\u20131032 (2021)","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54770-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:14:03Z","timestamp":1709655243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","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":"230","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":"54","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":"23% - 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":"4","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-6","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)"}}]}}