{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T01:37:59Z","timestamp":1776217079693,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":46,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987207","type":"print"},{"value":"9789819987214","type":"electronic"}],"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_12","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T05:01:44Z","timestamp":1702789304000},"page":"371-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Simple Threshold (Fully Homomorphic) Encryption from\u00a0LWE with\u00a0Polynomial Modulus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3971-9368","authenticated-orcid":false,"given":"Katharina","family":"Boudgoust","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7937-8422","authenticated-orcid":false,"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"12_CR1","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Report 2015\/046 (2015). https:\/\/eprint.iacr.org\/2015\/046"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Stehle, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. Cryptology ePrint Archive, Report 2022\/634 (2022). https:\/\/eprint.iacr.org\/2022\/634","DOI":"10.1145\/3548606.3560650"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"Bai, S., Lepoint, T., Roux-Langlois, A., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. J. Cryptol. 31(2), 610\u2013640 (2018)","journal-title":"J. Cryptol."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11605805_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Boyen, X., Halevi, S.: Chosen ciphertext secure public key threshold encryption without random oracles. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 226\u2013243. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11605805_15"},{"key":"12_CR6","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"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-030-45724-2_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Hardness of LWE on general entropic distributions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 551\u2013575. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_19"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64375-1_1","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Lossiness and entropic hardness for\u00a0ring-LWE. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 1\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_1"},{"key":"12_CR9","unstructured":"Beimel, A.: Secure schemes for secret sharing and key distribution. Ph.D. thesis, Technion, Haifa, Israel (1996)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-030-77886-6_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Jain, A., Komargodski, I., Lin, H.: Multiparty reusable non-interactive secure computation from LWE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 724\u2013753. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_25"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17656-3_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part II. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1"},{"key":"12_CR13","unstructured":"Boneh, D., Gennaro, R., Goldfeder, S., Kim, S.: A lattice-based universal thresholdizer for cryptographic systems. Cryptology ePrint Archive, Report 2017\/251 (2017). https:\/\/eprint.iacr.org\/2017\/251"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part I. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-662-53008-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"F Bourse","year":"2016","unstructured":"Bourse, F., Del Pino, R., Minelli, M., Wee, H.: FHE circuit privacy almost for free. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 62\u201389. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_3"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-030-64834-3_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"K Boudgoust","year":"2020","unstructured":"Boudgoust, K., Jeudy, C., Roux-Langlois, A., Wen, W.: Towards classical hardness of\u00a0module-LWE: the linear rank case. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 289\u2013317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_10"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-030-36033-7_16","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2019","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019, Part II. LNCS, vol. 11892, pp. 407\u2013437. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_16"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Boudgoust, K., Scholl, P.: Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: Naor, M. (ed.) ITCS 2014, pp. 1\u201312. ACM (2014)","DOI":"10.1145\/2554797.2554799"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"de Castro, L., Hazay, C., Ishai, Y., Vaikuntanathan, V., Venkitasubramaniam, M.: Asymptotically quasi-optimal cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 303\u2013334. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_11","DOI":"10.1007\/978-3-031-06944-4_11"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_19"},{"key":"12_CR22","unstructured":"Chowdhury, S., et al.: Efficient FHE with threshold decryption and application to real-time systems. Cryptology ePrint Archive. Version 2023-01-23 (2022)"},{"key":"12_CR23","unstructured":"Chowdhury, S., et al.: Efficient FHE with threshold decryption and application to real-time systems. Cryptology ePrint Archive. Version 2023-06-01 (2022)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-53018-4_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"G Couteau","year":"2016","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Encryption switching protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 308\u2013338. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_12"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-030-75245-3_24","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"J Devevey","year":"2021","unstructured":"Devevey, J., Libert, B., Nguyen, K., Peters, T., Yung, M.: Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings. In: Garay, J.A. (ed.) PKC 2021, Part I. LNCS, vol. 12710, pp. 659\u2013690. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_24"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-75245-3_8","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"J Devevey","year":"2021","unstructured":"Devevey, J., Sakzad, A., Stehl\u00e9, D., Steinfeld, R.: On the integer polynomial learning with errors problem. In: Garay, J.A. (ed.) PKC 2021, Part I. LNCS, vol. 12710, pp. 184\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75245-3_8"},{"issue":"1","key":"12_CR27","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-662-49890-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"L Ducas","year":"2016","unstructured":"Ducas, L., Stehl\u00e9, D.: Sanitization of FHE ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 294\u2013310. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_12"},{"key":"12_CR29","unstructured":"Dai, X., Wu, W., Feng, Y.: Summation rather than concatenation: a more efficient MKFHE scheme in the plain model. Cryptology ePrint Archive, Report 2022\/055 (2022). https:\/\/eprint.iacr.org\/2022\/055"},{"issue":"7","key":"12_CR30","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven, T., Harremo\u00ebs, P.: R\u00e9nyi divergence and kullback-leibler divergence. IEEE Trans. Inf. Theory 60(7), 3797\u20133820 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ins.2013.06.018","volume":"249","author":"M Gil","year":"2013","unstructured":"Gil, M., Alajaji, F., Linder, T.: R\u00e9nyi divergence measures for commonly used univariate continuous distributions. Inf. Sci. 249, 124\u2013131 (2013)","journal-title":"Inf. Sci."},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/3-540-48405-1_37","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"N Gilboa","year":"1999","unstructured":"Gilboa, N., Ishai, Y.: Compressing cryptographic resources. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 591\u2013608. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_37"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C-Y Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 169\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72540-4_10"},{"key":"12_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-031-07082-2_22","volume-title":"EUROCRYPT 2022","author":"L Huguenin-Dumittan","year":"2022","unstructured":"Huguenin-Dumittan, L., Vaudenay, S.: On IND-qCCA security in the ROM and its applications - CPA security is sufficient for TLS 1.3. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 613\u2013642. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_22"},{"key":"12_CR35","unstructured":"Jain, A., Rasmussen, P.M.R., Sahai, A.: Threshold fully homomorphic encryption. Cryptology ePrint Archive, Report 2017\/257 (2017). https:\/\/eprint.iacr.org\/2017\/257"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-21548-4_11","volume-title":"Information Security and Privacy","author":"M Kraitsberg","year":"2019","unstructured":"Kraitsberg, M., Lindell, Y., Osheter, V., Smart, N.P., Talibi Alaoui, Y.: Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme. In: Jang-Jaccard, J., Guo, F. (eds.) ACISP 2019. LNCS, vol. 11547, pp. 192\u2013210. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21548-4_11"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-030-77870-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"B Li","year":"2021","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23"},{"issue":"3","key":"12_CR38","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"12_CR39","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: 47th FOCS, pp. 367\u2013378. IEEE Computer Society Press (2006)","DOI":"10.1109\/FOCS.2006.43"},{"key":"12_CR41","unstructured":"Naehrig, M., et al.: FrodoKEM. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"12_CR42","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"12_CR43","unstructured":"Rossi, M.: Extended security of lattice-based cryptography. (S\u00e9curit\u00e9 \u00e9tendue de la cryptographie fond\u00e9e sur les r\u00e9seaux euclidiens). Ph.D. thesis, Paris Sciences et Lettres University, France (2020)"},{"key":"12_CR44","unstructured":"Schwabe, P., et al.: CRYSTALS-KYBER. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-3-submissions"},{"key":"12_CR45","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-031-14791-3_21","volume-title":"Security and Cryptography for Networks","author":"S Shiehian","year":"2022","unstructured":"Shiehian, S.: mrNISC from LWE with polynomial modulus. In: Galdi, C., Jarecki, S. (eds.) SCN 2022. LNCS, vol. 13409, pp. 481\u2013493. Springer, Cham (2022)"},{"issue":"3","key":"12_CR46","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"5","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: Short monotone formulae for the majority function. J. Algorithms 5(3), 363\u2013366 (1984)","journal-title":"J. Algorithms"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:12Z","timestamp":1765933332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8721-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987207","9789819987214"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8721-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}]}}