{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:37:23Z","timestamp":1743097043368,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578770"},{"type":"electronic","value":"9783030578787"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57878-7_3","type":"book-chapter","created":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T14:03:04Z","timestamp":1598623384000},"page":"40-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Biometric-Authenticated Searchable Encryption"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gardham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Manulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin C\u0103t\u0103lin","family":"Dr\u0103gan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,29]]},"reference":[{"key":"3_CR1","unstructured":"Biometric presentation attack detection: Standard ISO\/IEC WD 30107\u20133:2017. International Organization for Standardization, Geneva, CH (2017)"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M Abdalla","year":"2007","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. 21(3), 350\u2013391 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9006-6","journal-title":"J. Cryptol."},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/MSP.2015.116","volume":"13","author":"Z Akhtar","year":"2015","unstructured":"Akhtar, Z., Micheloni, C., Foresti, G.L.: Biometric liveness detection: challenges and research opportunities. IEEE Secur. Priv. 13(5), 63\u201372 (2015)","journal-title":"IEEE Secur. Priv."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/11602897_35","volume-title":"Information and Communications Security","author":"L Ballard","year":"2005","unstructured":"Ballard, L., Kamara, S., Monrose, F.: Achieving efficient conjunctive keyword searches over encrypted data. In: Qing, S., Mao, W., L\u00f3pez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 414\u2013426. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602897_35"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-68697-5_1","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1\u201315. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_1"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-11145-7_14","volume-title":"Information and Communications Security","author":"M Blanton","year":"2009","unstructured":"Blanton, M., Hudelson, W.M.P.: Biometric-based non-transferable anonymous credentials. In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol. 5927, pp. 165\u2013180. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11145-7_14"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535\u2013554. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_29"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Boyen, X.: Reusable cryptographic fuzzy extractors. In: ACM CCS 2004, pp. 82\u201391. ACM (2004)","DOI":"10.1145\/1030083.1030096"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11426639_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X Boyen","year":"2005","unstructured":"Boyen, X., Dodis, Y., Katz, J., Ostrovsky, R., Smith, A.: Secure remote authentication using biometric data. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 147\u2013163. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_9"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H., Kindarji, B.: Error-tolerant searchable encryption. In: IEEE ICC 2009, pp. 1\u20136 (2009)","DOI":"10.1109\/ICC.2009.5199004"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-662-44381-1_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"J Camenisch","year":"2014","unstructured":"Camenisch, J., Lehmann, A., Lysyanskaya, A., Neven, G.: Memento: how to reconstruct your secrets from a single password in a hostile environment. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 256\u2013275. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_15"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-49890-3_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Canetti","year":"2016","unstructured":"Canetti, R., Fuller, B., Paneth, O., Reyzin, L., Smith, A.: Reusable fuzzy extractors for low-entropy distributions. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 117\u2013146. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_5"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22Nd ACM SIGSAC Conference on Computer and Communications Security, CCS 2015, pp. 668\u2013679. ACM (2015)","DOI":"10.1145\/2810103.2813700"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Cash","year":"2013","unstructured":"Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Ro\u015fu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_20"},{"issue":"4","key":"3_CR16","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1109\/TIFS.2015.2510822","volume":"11","author":"R Chen","year":"2016","unstructured":"Chen, R., Mu, Y., Yang, G., Guo, F., Wang, X.: Dual-server public-key encryption with keyword search for secure cloud storage. Trans. Inf. Forensics Secur. 11(4), 789\u2013798 (2016)","journal-title":"Trans. Inf. Forensics Secur."},{"issue":"5","key":"3_CR17","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011). A preliminary version appeared in ACM CCS 2006","journal-title":"J. Comput. Secur."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TCSVT.2003.818350","volume":"14","author":"J Daugman","year":"2004","unstructured":"Daugman, J.: How iris recognition works. IEEE Trans. Circ. Syst. Video Technol. 14(1), 21\u201330 (2004)","journal-title":"IEEE Trans. Circ. Syst. Video Technol."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11818175_14","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y Dodis","year":"2006","unstructured":"Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 232\u2013250. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_14"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_31"},{"key":"3_CR21","unstructured":"FIDO Alliance: FIDO 2.0. Technical report (2015). https:\/\/fidoalliance.org\/specifications. Accessed 03 Mar 2019"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-319-14054-4_12","volume-title":"Security Standardisation Research","author":"N Fleischhacker","year":"2014","unstructured":"Fleischhacker, N., Manulis, M., Azodi, A.: A modular framework for multi-factor authentication and key exchange. In: Chen, L., Mitchell, C. (eds.) SSR 2014. LNCS, vol. 8893, pp. 190\u2013214. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14054-4_12"},{"key":"3_CR23","unstructured":"Fuller, B., Simhadri, S., Steel, J.: Reusable authentication from the iris. Cryptology ePrint Archive, Report 2017\/1177 (2017). https:\/\/eprint.iacr.org\/2017\/1177"},{"key":"3_CR24","unstructured":"Gardham, D., Dr\u0103gan, C-C., Manulis, M.: Biometric Authenticated Searchable Encryption. Cryptology ePrint Archive, Report 2020\/017 (2020). https:\/\/eprint.iacr.org\/2020\/017"},{"issue":"4","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Huang, K., Manulis, M., Chen, L.: Password authenticated keyword search. In: PAC 2017, pp. 129\u2013140 (2017)","DOI":"10.1109\/PAC.2017.11"},{"key":"3_CR27","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS 2012 (2012)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Jain, A.K., Ross, A., Prabhakar, S.: Fingerprint matching using minutiae and texture features. In: ICIP 2001, pp. 282\u2013285 (2001)","DOI":"10.1109\/ICIP.2001.958106"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Juels, A., Wattenberg, M.: A fuzzy commitment scheme. In: ACM CCS 1999, pp. 28\u201336 (1999)","DOI":"10.1145\/319709.319714"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Kellaris, G., Kollios, G., Nissim, K., O\u2019Neill, A.: Generic attacks on secure outsourced databases. In: ACM CCS 2016, pp. 1329\u20131340 (2016)","DOI":"10.1145\/2976749.2978386"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-14623-7_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H Krawczyk","year":"2010","unstructured":"Krawczyk, H.: Cryptographic extraction and key derivation: the HKDF scheme. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 631\u2013648. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_34"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-31550-8_5","volume-title":"Trusted Systems","author":"V Kuchta","year":"2016","unstructured":"Kuchta, V., Manulis, M.: Public key encryption with distributed keyword search. In: Yung, M., Zhang, J., Yang, Z. (eds.) INTRUST 2015. LNCS, vol. 9565, pp. 62\u201383. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31550-8_5"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2013.11.021","volume":"265","author":"C Liu","year":"2014","unstructured":"Liu, C., Zhu, L., Wang, M., Tan, Y.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. 265, 176\u2013188 (2014)","journal-title":"Inf. Sci."},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Naveed, M., Kamara, S., Wright, C.V.: Inference attacks on property-preserving encrypted databases. In: ACM SIGSAC 2015, pp. 644\u2013655 (2015)","DOI":"10.1145\/2810103.2813651"},{"issue":"12","key":"3_CR36","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.1109\/JPROC.2003.819611","volume":"91","author":"L O\u2019Gorman","year":"2003","unstructured":"O\u2019Gorman, L.: Comparing passwords, tokens, and biometrics for user authentication. Proc. IEEE 91(12), 2021\u20132040 (2003)","journal-title":"Proc. IEEE"},{"issue":"3","key":"3_CR37","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10207-015-0294-9","volume":"15","author":"C \u00d6rencik","year":"2016","unstructured":"\u00d6rencik, C., Selcuk, A., Savas, E., Kantarcioglu, M.: Multi-keyword search over encrypted data with scoring and search pattern obfuscation. Int. J. Inf. Secur. 15(3), 251\u2013269 (2016)","journal-title":"Int. J. Inf. Secur."},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-31815-6_7","volume-title":"Information Security Applications","author":"DJ Park","year":"2005","unstructured":"Park, D.J., Kim, K., Lee, P.J.: Public key encryption with conjunctive field keyword search. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 73\u201386. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31815-6_7"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-68914-0_17","volume-title":"Applied Cryptography and Network Security","author":"D Pointcheval","year":"2008","unstructured":"Pointcheval, D., Zimmer, S.: Multi-factor authenticated key exchange. In: Bellovin, S.M., Gennaro, R., Keromytis, A., Yung, M. (eds.) ACNS 2008. LNCS, vol. 5037, pp. 277\u2013295. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68914-0_17"},{"issue":"2","key":"3_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MSECP.2003.1193209","volume":"1","author":"S Prabhakar","year":"2003","unstructured":"Prabhakar, S., Pankanti, S., Jain, A.K.: Biometric recognition: security and privacy concerns. IEEE Secur. Priv. 1(2), 33\u201342 (2003)","journal-title":"IEEE Secur. Priv."},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Rogaway, P., Bellare, M.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: ACM CCS 2007, pp. 172\u2013184 (2007)","DOI":"10.1145\/1315245.1315268"},{"issue":"11","key":"3_CR43","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS 2014. The Internet Society (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-24174-6_18","volume-title":"Computer Security \u2013 ESORICS 2015","author":"X Yi","year":"2015","unstructured":"Yi, X., Hao, F., Chen, L., Liu, J.K.: Practical threshold password-authenticated secret sharing protocol. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9326, pp. 347\u2013365. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_18"},{"key":"3_CR46","first-page":"707","volume":"2016","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. USENIX Secur. 2016, 707\u2013720 (2016)","journal-title":"USENIX Secur."}],"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-030-57878-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T19:35:54Z","timestamp":1723491354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57878-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578770","9783030578787"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57878-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 August 2020","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/ACNS2020","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"214","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":"46","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":"21% - 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.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 pandemy the confernce was helt virtually.","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)"}}]}}