{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:55:29Z","timestamp":1765961729278,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":44,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819987207"},{"type":"electronic","value":"9789819987214"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-8721-4_7","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:44Z","timestamp":1702789304000},"page":"204-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ramp Hyper-invertible Matrices and\u00a0Their Applications to\u00a0MPC Protocols"],"prefix":"10.1007","author":[{"given":"Hongqing","family":"Liu","sequence":"first","affiliation":[]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Yanjiang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-36178-2_13","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"M Abe","year":"2002","unstructured":"Abe, M., Cramer, R., Fehr, S.: Non-interactive distributed-verifier proofs and proving relations among commitments. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 206\u2013224. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_13"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-031-15985-5_2","volume-title":"Advances in Cryptology-CRYPTO 2022: 42nd Annual International Cryptology Conference","author":"B Applebaum","year":"2022","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading nizks with honest majority. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 33\u201356. Springer, Heidelberg (2022)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Baum, C., Jadoul, R., Orsini, E., Scholl, P., Smart, N.P.: Feta: efficient threshold designated-verifier zero-knowledge proofs. Cryptology ePrint Archive (2022)","DOI":"10.1145\/3548606.3559354"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-030-45374-9_17","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Nof, A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 495\u2013526. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_17"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, Chicago, Illinois, USA, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. IACR Cryptol. ePrint Arch., p. 629 (2011)","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-11799-2_13","volume-title":"Theory of Cryptography","author":"R Bendlin","year":"2010","unstructured":"Bendlin, R., Damg\u00e5rd, I.: Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 201\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_13"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"VE Bene\u0161","year":"1964","unstructured":"Bene\u0161, V.E.: Optimal rearrangeable multistage connecting networks. Bell Syst. Tech. J. 43(4), 1641\u20131656 (1964)","journal-title":"Bell Syst. Tech. J."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/3-540-46416-6_7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"M Burmester","year":"1991","unstructured":"Burmester, M., Desmedt, Y.: Broadcast interactive proofs. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 81\u201395. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_7"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-319-96878-0_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Cascudo","year":"2018","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521\u2013536. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_31"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-72540-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"H Chen","year":"2007","unstructured":"Chen, H., Cramer, R., Goldwasser, S., de Haan, R., Vaikuntanathan, V.: Secure computation from random error correcting codes. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 291\u2013310. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_17"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-96878-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"K Chida","year":"2018","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 34\u201364. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2"},{"key":"7_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, Cambridge (2015)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_30"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"de Saint Guilhem, C.D., Orsini, E., Tanguy, T.: Limbo: efficient zero-knowledge mpcith-based arguments. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 3022\u20133036 (2021)","DOI":"10.1145\/3460120.3484595"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y.: Turbopack: honest majority MPC with constant online communication. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 951\u2013964. ACM (2022)","DOI":"10.1145\/3548606.3560633"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.S. (eds.) Proceedings of the 24th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 4\u20136 May 1992, pp. 699\u2013710. ACM (1992)","DOI":"10.1145\/129712.129780"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01884295","volume":"121","author":"A Garcia","year":"1995","unstructured":"Garcia, A., Stichtenoth, H.: A tower of Artin - Schreier extensions of function fields attaining the Drinfeld - Vl$$\\hat{a}$$dut bound. Inventiones Mathematicae 121, 211\u2013222 (1995)","journal-title":"Inventiones Mathematicae"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/jnth.1996.0147","volume":"61","author":"A Garcia","year":"1996","unstructured":"Garcia, A., Stichtenoth, H.: On the asymptotic behaviour of some towers of function fields over finite fields. J. Numb. Theory 61, 248\u2013273 (1996)","journal-title":"J. Numb. Theory"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-662-48000-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"D Genkin","year":"2015","unstructured":"Genkin, D., Ishai, Y., Polychroniadou, A.: Efficient multi-party computation: from passive to active security via secure SIMD circuits. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 721\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_35"},{"key":"7_CR25","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: Zkboo: faster zero-knowledge for Boolean circuits. In: USENIX Security Symposium, vol. 16 (2016)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-84245-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in\u00a0the honest majority setting. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 244\u2013274. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-26951-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"V Goyal","year":"2019","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 85\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4"},{"key":"7_CR28","unstructured":"Goyal, V., Song, Y.: Malicious security comes free in honest-majority mpc. Cryptology ePrint Archive (2020)"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-56880-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"V Goyal","year":"2020","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 618\u2013646. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22"},{"issue":"3","key":"7_CR30","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/s00145-013-9152-y","volume":"27","author":"J Groth","year":"2014","unstructured":"Groth, J., Ostrovsky, R.: Cryptography in the multi-string model. J. Cryptol. 27(3), 506\u2013543 (2014)","journal-title":"J. Cryptol."},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143\u2013161. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_12"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"7_CR33","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. Cryptology ePrint Archive (2022)"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 525\u2013537 (2018)","DOI":"10.1145\/3243734.3243805"},{"key":"7_CR35","unstructured":"Liu, H., Xing, C., Yang, Y., Yuan, C.: Ramp hyper-invertible matrices and their applications to mpc protocols. Cryptology ePrint Archive, Paper 2023\/1369 (2023). https:\/\/eprint.iacr.org\/2023\/1369"},{"key":"7_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325951","volume-title":"Rational Points on Curves over Finite Fields-Theory and Applications","author":"H Niederreiter","year":"2001","unstructured":"Niederreiter, H., Xing, C.: Rational Points on Curves over Finite Fields-Theory and Applications. Cambridge University Press, Cambridge (2001)"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-93387-0_17","volume-title":"Applied Cryptography and Network Security","author":"PS Nordholt","year":"2018","unstructured":"Nordholt, P.S., Veeningen, M.: Minimising communication in honest-majority MPC by batchwise multiplication verification. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 321\u2013339. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_17"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-45146-4_19","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: On deniability in the common reference string and random oracle model. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 316\u2013337. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_19"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-03356-8_28","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Cascudo","year":"2009","unstructured":"Cascudo, I., Chen, H., Cramer, R., Xing, C.: Asymptotically good ideal linear secret sharing with strong multiplication over Any fixed finite field. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 466\u2013486. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_28"},{"issue":"11","key":"7_CR40","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"},{"issue":"6","key":"7_CR41","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"K Shum","year":"2001","unstructured":"Shum, K., Aleshnikov, I., Kumar, P.V., Stichtenoth, H., Deolalikar, V.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 47(6), 2225\u20132241 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Function Fields and Codes","author":"H Stichtenoth","year":"2003","unstructured":"Stichtenoth, H.: Function Fields and Codes. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-76878-4"},{"key":"7_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic-Geometric Codes","author":"MA Tsfasman","year":"1991","unstructured":"Tsfasman, M.A., Vl\u01cedu\u0163, S.G.: Algebraic-Geometric Codes. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/978-94-011-3810-9"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Yang, K., Wang, X.: Non-interactive zero-knowledge proofs to multiple verifiers. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-22969-5_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8721-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:11Z","timestamp":1765933331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8721-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987207","9789819987214"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8721-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 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":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","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":"106","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","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":"12","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"}]}}