{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:51:31Z","timestamp":1765057891512,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551187","type":"print"},{"value":"9789819551194","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T00:00:00Z","timestamp":1765065600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5119-4_17","type":"book-chapter","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:44:38Z","timestamp":1765057478000},"page":"539-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pilvi: Lattice Threshold PKE with\u00a0Small Decryption Shares and\u00a0Improved Security"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6876-0954","authenticated-orcid":false,"given":"Valerio","family":"Cini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9126-1887","authenticated-orcid":false,"given":"Russell W. F.","family":"Lai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8905-1207","authenticated-orcid":false,"given":"Ivy K. Y.","family":"Woo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,7]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-84245-1_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Lai, R.W.F.: Subtractive sets over cyclotomic rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 519\u2013548. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_18"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). http:\/\/www.degruyter.com\/view\/j\/jmc.2015.9.issue-3\/jmc-2015-0016\/jmc-2015-0016.xml","DOI":"10.1515\/jmc-2015-0016"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42"},{"key":"17_CR4","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":"5","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM J. Comput. 36(5), 1301\u20131328 (2007)","journal-title":"SIAM J. Comput."},{"key":"17_CR6","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., Gennaro, R., Goldfeder, S., Jain, A., Kim, S., Rasmussen, P.M.R., Sahai, A.: 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":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Boschini, C., Kaviani, D., Lai, R.W.F., Malavolta, G., Takahashi, A., Tibouchi, M.: Ringtail: practical two-round threshold signatures from learning with errors. In: IEEE S &P (2025, to appear)","DOI":"10.1109\/SP61157.2025.00070"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Boudgoust, K., Scholl, P.: Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part I. LNCS, vol. 14438, pp. 371\u2013404. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_12","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"17_CR10","unstructured":"Brakerski, Z., Friedman, O., Marmor, A., Mutzari, D., Spiizer, Y., Trieu, N.: Threshold FHE with efficient asynchronous decryption. Cryptology ePrint Archive, Paper 2025\/712 (2025). https:\/\/eprint.iacr.org\/2025\/712"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Brand\u00e3o, L.T., Peralta, R.: NIST first call for multi-party threshold schemes (2023). https:\/\/csrcnist.gov\/publications\/detail\/nistir\/8214c\/draft","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"17_CR12","unstructured":"Brzuska, C., Kloo\u00df, M., Woo, I.K.Y.: Threshold public-key encryption: definitions, relations and constructions. Manuscript, acquired through private communication (2025)"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Del Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.O.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, Part II. LNCS, vol. 14652, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"17_CR15","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":"17_CR16","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W.F., Lin, C., Malavolta, G., Rahimi, A.: Efficient laconic cryptography from learning with errors. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part III. LNCS, vol. 14006, pp. 417\u2013446. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14","DOI":"10.1007\/978-3-031-30620-4_14"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part VII. LNCS, vol. 14926, pp. 387\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2013","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. J. Cryptol. 26(1), 80\u2013101 (2013). https:\/\/doi.org\/10.1007\/s00145-011-9114-1","journal-title":"J. Cryptol."},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11830924_38","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Magen, A., Pitassi, T.: Monotone circuits for the majority function. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM -2006. LNCS, vol. 4110, pp. 410\u2013425. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_38"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Kloo\u00df, M., Lai, R.W.F., Nguyen, N.K., Osadnik, M.: RoK, paper, SISsors toolkit for lattice-based succinct arguments - (extended abstract). In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024, Part V. LNCS, vol. 15488, pp. 203\u2013235. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_7","DOI":"10.1007\/978-981-96-0935-2_7"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Swarnakar, M., Woo, I.K.Y.: Leaky LWE: learning with errors with semi-adaptive secret- and error-leakage. IACR Commun. Cryptol. 2(3) (2025)","DOI":"10.62056\/ah89ksuc2"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Suhl, A.: Simulation-secure threshold PKE from LWE with polynomial modulus. IACR Commun. Cryptol. 1(4) (2025). https:\/\/doi.org\/10.62056\/a0zogy4e-","DOI":"10.62056\/a0zogy4e-"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48910-X_23","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"M Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 327\u2013346. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_23"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd ACM STOC, pp. 427\u2013437. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100273","DOI":"10.1145\/100216.100273"},{"key":"17_CR26","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5119-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:44:41Z","timestamp":1765057481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5119-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,7]]},"ISBN":["9789819551187","9789819551194"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5119-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,7]]},"assertion":[{"value":"7 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}