{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T00:25:59Z","timestamp":1769300759886,"version":"3.49.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030920678","type":"print"},{"value":"9783030920685","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92068-5_14","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T20:34:17Z","timestamp":1638304457000},"page":"403-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Digital Signatures with\u00a0Memory-Tight Security in\u00a0the\u00a0Multi-challenge Setting"],"prefix":"10.1007","author":[{"given":"Denis","family":"Diemert","sequence":"first","affiliation":[]},{"given":"Kai","family":"Gellert","sequence":"additional","affiliation":[]},{"given":"Tibor","family":"Jager","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Lyu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Fouque, P.A., Lyubashevsky, V., Tibouchi, M.: Tightly-secure signatures from lossy identification schemes. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology 2012. EUROCRYPT 2012. LNCS, vol. 7237. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_34","DOI":"10.1007\/978-3-642-29011-4_34"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Fouque, P.A., Lyubashevsky, V., Tibouchi, M.: Tightly secure signatures from lossy identification schemes. J. Cryptol. 29(3), 597\u2013631 (2016)","DOI":"10.1007\/s00145-015-9203-7"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Abe, M., Groth, J., Ohkubo, M.: Separating short structure-preserving signatures from non-interactive assumptions. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology 2011. LNCS, vol. 7073. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_34","DOI":"10.1007\/978-3-642-25385-0_34"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-63688-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Auerbach","year":"2017","unstructured":"Auerbach, B., Cash, D., Fersch, M., Kiltz, E.: Memory-tight reductions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 101\u2013132. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_4"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bader, C., Hofheinz, D., Jager, T., Kiltz, E., Li, Y.: Tightly-secure authenticated key exchange. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of Cryptography. TCC 2015. LNCS, vol. 9014. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_26","DOI":"10.1007\/978-3-662-46494-6_26"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bader, C., Jager, T., Li, Y., Schage, S.: On the impossibility of tight cryptographic reductions. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology 2016. EUROCRYPT 2016. LNCS, vol. 9666. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_10","DOI":"10.1007\/978-3-662-49896-5_10"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: security proofs and improvements. In: EUROCRYPT 2000. LNCS, vol. 1807, pp. 259\u2013274. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-45539-6_18"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Ristenpart, T.: Simulation without the artificial abort: simplified proof and improved concrete security for Waters\u2019 IBE scheme. In: EUROCRYPT 2009. LNCS, vol. 5479, pp. 407\u2013424. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_24","DOI":"10.1007\/978-3-642-01001-9_24"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Ristenpart, T.: Simulation without the artificial abort: simplified proof and improved concrete security for waters\u2019 IBE scheme. Cryptology ePrint Archive, Report 2009\/084 (2009). eprint.iacr.org\/2009\/084","DOI":"10.1007\/978-3-642-01001-9_24"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 93, pp. 62\u201373. ACM Press (1993)","DOI":"10.1145\/168588.168596"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures: how to sign with RSA and Rabin. In: EUROCRYPT\u201996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34","DOI":"10.1007\/3-540-68339-9_34"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-45374-9_9","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"R Bhattacharyya","year":"2020","unstructured":"Bhattacharyya, R.: Memory-tight reductions for practical key encapsulation mechanisms. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 249\u2013278. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_9"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Blazy, O., Kiltz, E., Pan, J.: (Hierarchical) identity-based encryption from affine message authentication. In: CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 408\u2013425. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_23","DOI":"10.1007\/978-3-662-44371-2_23"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30","DOI":"10.1007\/3-540-45682-1_30"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004)","DOI":"10.1007\/s00145-004-0314-9"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Chen, J., Wee, H.: Fully, (almost) tightly secure IBE and dual system groups. In: CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 435\u2013460. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_25","DOI":"10.1007\/978-3-642-40084-1_25"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/978-3-030-26954-8_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"K Cohn-Gordon","year":"2019","unstructured":"Cohn-Gordon, K., Cremers, C., Gj\u00f8steen, K., Jacobsen, H., Jager, T.: Highly efficient key exchange protocols with optimal tightness. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 767\u2013797. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_25"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Coron, J.S.: On the exact security of full domain hash. In: CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14","DOI":"10.1007\/3-540-44598-6_14"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Coron, J.S.: Optimal security proofs for PSS and other signature schemes. In: EUROCRYPT 2002. LNCS, vol. 2332, pp. 272\u2013287. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_18","DOI":"10.1007\/3-540-46035-7_18"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Davis, H., G\u00fcnther, F.: Tighter proofs for the sigma and TLS 1.3 key exchange protocols. Cryptology ePrint Archive, Report 2020\/1029 (2020). eprint.iacr.org\/2020\/1029","DOI":"10.1007\/978-3-030-78375-4_18"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Diemert, D., Gellert, K., Jager, T., Lyu, L.: Digital signatures with memory-tight security in the multi-challenge setting. Cryptology ePrint Archive, Report 2021\/1220 (2021). ia.cr\/2021\/1220","DOI":"10.1007\/978-3-030-92068-5_14"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Diemert, D., Gellert, K., Jager, T., Lyu, L.: More efficient digital signatures with tight multi-user security. In: Public-Key Cryptography - PKC 2021, pp. 1\u201331. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_1","DOI":"10.1007\/978-3-030-75248-4_1"},{"key":"#cr-split#-14_CR23.1","doi-asserted-by":"crossref","unstructured":"Diemert, D., Jager, T.: On the tight security of TLS 1.3: theoretically-sound cryptographic parameters for real-world deployments. Cryptology ePrint Archive, Report 2020\/726","DOI":"10.1007\/s00145-021-09388-x"},{"key":"#cr-split#-14_CR23.2","unstructured":"to appear in the J. Cryptol. (2020). eprint.iacr.org\/2020\/726"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Fersch, M., Kiltz, E., Poettering, B.: On the one-per-message unforgeability of (EC)DSA and its variants. In: TCC 2017, Part II. LNCS, vol. 10678, pp. 519\u2013534. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_17","DOI":"10.1007\/978-3-319-70503-3_17"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO\u201986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Jager, T., Schr\u00f6der, D.: On tight security proofs for Schnorr signatures. In: ASIACRYPT 2014, Part I. LNCS, vol. 8873, pp. 512\u2013531. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_27","DOI":"10.1007\/978-3-662-45611-8_27"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Fleischhacker, N., Jager, T., Schr\u00f6der, D.: On tight security proofs for Schnorr signatures. J. Cryptol. 32(2), 566\u2013599 (2019)","DOI":"10.1007\/s00145-019-09311-5"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Garg, S., Bhaskar, R., Lokam, S.V.: Improved bounds on security reductions for discrete log based signatures. In: CRYPTO 2008. LNCS, vol. 5157, pp. 93\u2013107. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_6","DOI":"10.1007\/978-3-540-85174-5_6"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Gay, R., Hofheinz, D., Kiltz, E., Wee, H.: Tightly CCA-secure encryption without pairings. In: EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 1\u201327. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_1","DOI":"10.1007\/978-3-662-49890-3_1"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Jaeger, J., Tessaro, S.: The memory-tightness of authenticated encryption. In: Advances in Cryptology - CRYPTO 2020\u201340th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part I. LNCS, vol. 12170, pp. 127\u2013156. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_5","DOI":"10.1007\/978-3-030-56784-2_5"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Tessaro, S.: On the memory-tightness of hashed ElGamal. In: EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 33\u201362. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_2","DOI":"10.1007\/978-3-030-45724-2_2"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Gj\u00f8steen, K., Jager, T.: Practical and tightly-secure digital signatures and authenticated key exchange. In: CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 95\u2013125. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_4","DOI":"10.1007\/978-3-319-96881-0_4"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","DOI":"10.1137\/0217017"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Gueron, S., Lindell, Y.: Better bounds for block cipher modes of operation via nonce-based key derivation. In: ACM CCS 2017, pp. 1019\u20131036. ACM Press (2017)","DOI":"10.1145\/3133956.3133992"},{"key":"14_CR35","unstructured":"Hasegawa, S., Isobe, S.: Lossy identification schemes from decisional RSA. In: International Symposium on Information Theory and its Applications, ISITA 2014, Melbourne, Australia, pp. 143\u2013147. IEEE (2014)"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Hoang, V.T., Tessaro, S.: The multi-user security of double encryption. In: EUROCRYPT 2017, Part II. LNCS, vol. 10211, pp. 381\u2013411. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_13","DOI":"10.1007\/978-3-319-56614-6_13"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., Jager, T.: Tightly secure signatures and public-key encryption. In: CRYPTO 2012. LNCS, vol. 7417, pp. 590\u2013607. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/s10623-015-0062-x","DOI":"10.1007\/s10623-015-0062-x"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., Jager, T., Knapp, E.: Waters signatures with optimal security reduction. In: PKC 2012. LNCS, vol. 7293, pp. 66\u201383. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_5","DOI":"10.1007\/978-3-642-30057-8_5"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Jager, T., Kakvi, S.A., May, A.: On the security of the PKCS#1 v1.5 signature scheme. In: ACM CCS 2018. pp. 1195\u20131208. ACM Press (2018)","DOI":"10.1145\/3243734.3243798"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Jager, T., Kurek, R., Pan, J.: Simple and more efficient PRFs with tight security from LWE and matrix-DDH. In: ASIACRYPT 2018, Part III. LNCS, vol. 11274, pp. 490\u2013518. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_18","DOI":"10.1007\/978-3-030-03332-3_18"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Jager, T., Stam, M., Stanley-Oakes, R., Warinschi, B.: Multi-key authenticated encryption with corruptions: reductions are lossy. In: TCC 2017, Part I. LNCS, vol. 10677, pp. 409\u2013441. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_14","DOI":"10.1007\/978-3-319-70500-2_14"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Kakvi, S.A., Kiltz, E.: Optimal security proofs for full domain hash, revisited. In: EUROCRYPT 2012. LNCS, vol. 7237, pp. 537\u2013553. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_32","DOI":"10.1007\/978-3-642-29011-4_32"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Kakvi, S.A., Kiltz, E.: Optimal security proofs for full domain hash, revisited. J. Cryptol. 31(1), 276\u2013306 (2018)","DOI":"10.1007\/s00145-017-9257-9"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: ACM CCS 2003, pp. 155\u2013164. ACM Press (2003)","DOI":"10.1145\/948109.948132"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Waters, B.: Efficient pseudorandom functions from the decisional linear assumption and weaker variants. In: ACM CCS 2009, pp. 112\u2013120. ACM Press (2009)","DOI":"10.1145\/1653662.1653677"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Liu, X., Liu, S., Gu, D., Weng, J.: Two-pass authenticated key exchange with explicit authentication and tight security. In: ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 785\u2013814. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_27","DOI":"10.1007\/978-3-030-64834-3_27"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th FOCS, pp. 458\u2013467. IEEE Computer Society Press (1997)","DOI":"10.1109\/SFCS.1997.646134"},{"key":"14_CR48","doi-asserted-by":"publisher","unstructured":"Paillier, P., Vergnaud, D.: Discrete-log-based signatures may not be equivalent to discrete log. In: ASIACRYPT 2005. LNCS, vol. 3788, pp. 1\u201320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_1","DOI":"10.1007\/11593447_1"},{"key":"14_CR49","doi-asserted-by":"publisher","unstructured":"Sch\u00e4ge, S.: Tight proofs for signature schemes without random oracles. In: EUROCRYPT 2011. LNCS, vol. 6632, pp. 189\u2013206. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_12","DOI":"10.1007\/978-3-642-20465-4_12"},{"key":"14_CR50","doi-asserted-by":"publisher","unstructured":"Seurin, Y.: On the exact security of Schnorr-type signatures in the random oracle model. In: EUROCRYPT 2012. LNCS, vol. 7237, pp. 554\u2013571. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_33","DOI":"10.1007\/978-3-642-29011-4_33"},{"key":"14_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-78381-9_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Matsuda, T., Hanaoka, G., Tanaka, K.: Memory lower bounds of reductions revisited. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 61\u201390. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92068-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:09:10Z","timestamp":1732925350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92068-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030920678","9783030920685"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92068-5_14","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":"1 December 2021","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":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2021\/","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":"341","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":"95","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":"28% - 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.21","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.61","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 online 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)"}}]}}