{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:47:17Z","timestamp":1765057637314,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":36,"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_18","type":"book-chapter","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:43:30Z","timestamp":1765057410000},"page":"570-600","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Threshold Homomorphic Secret Sharing: Definitions and\u00a0Constructions"],"prefix":"10.1007","author":[{"given":"Xinzhou","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupeng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqing","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,7]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chase, M.: FAME: fast attribute-based message encryption, ACM CCS 2017 (Thuraisingham, B., Evans, D., Malkin, T., Xu, D., eds.), ACM, pp.\u00a0665\u2013682 (2017)","DOI":"10.1145\/3133956.3134014"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Attema, T., Capit\u00e3o, P., Kohl, L.: On homomorphic secret sharing from polynomial-modulus LWE, PKC 2023, Part II (Boldyreva, A., Kolesnikov, V., eds.), LNCS, vol. 13941, Springer, pp.\u00a03\u201332 (2023)","DOI":"10.1007\/978-3-031-31371-4_1"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Abram, D., Damg\u00e5rd, I., Orlandi, C., Scholl, P.: An algebraic framework for silent preprocessing with trustless setup and active security, CRYPTO 2022, Part IV (Dodis, Y., Shrimpton, T., eds.), LNCS, vol. 13510, Springer, pp.\u00a0421\u2013452 (2022)","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Libert, B., Stehl\u00e9, D.: Fully secure functional encryption for inner products, from standard assumptions, CRYPTO 2016, Part III (Robshaw, M., Katz, J., eds.), LNCS, vol. 9816, Springer, pp.\u00a0333\u2013362 (2016)","DOI":"10.1007\/978-3-662-53015-3_12"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Yamada, S.: Optimal broadcast encryption from pairings and LWE EUROCRYPT 2020, Part I (Canteaut, A., Ishai, Y., eds.), LNCS, vol. 12105, Springer, pp. 13\u201343 (2020)","DOI":"10.1007\/978-3-030-45721-1_2"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Baltico, C.E.Z., Catalano, D., Fiore, D., Gay, R.: Practical functional encryption for quadratic functions with applications to predicate encryption, CRYPTO 2017, Part I (Katz, J., Shacham, H., eds.), LNCS, vol. 10401, Springer, pp.\u00a067\u201398 (2017)","DOI":"10.1007\/978-3-319-63688-7_3"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: Optimizations and applications, ACM CCS 2017 (Thuraisingham, B., Evans, D., Malkin, T., Xu, D., eds.), ACM, pp.\u00a02105\u20132122 (2017)","DOI":"10.1145\/3133956.3134107"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: Silent OT extension and more, CRYPTO 2019, Part III (Boldyreva, A., Micciancio, D., eds.), LNCS, vol. 11694, Springer, pp.\u00a0489\u2013518 (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH, CRYPTO 2016, Part I (Robshaw, M., Katz, J., eds.), LNCS, vol. 9814, Springer, pp.\u00a0509\u2013539 (2016)","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"____, Group-based secure computation: optimizing rounds, communication, and computation, EUROCRYPT 2017, Part II (Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, eds.), LNCS, vol. 10211, pp.\u00a0163\u2013193 (2017)","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"18_CR11","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Lin, H., Tessaro, S.: Foundations of homomorphic secret sharing, ITCS 2018 (Anna\u00a0R. Karlin, ed.), LIPIcs, vol.\u00a094, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp.\u00a021:1\u201321:21 (2018)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE, EUROCRYPT 2019, Part II (Yuval Ishai and Vincent Rijmen, eds.), LNCS, vol. 11477, Springer, pp.\u00a03\u201333 )(2019)","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Sahai, A., Waters, B., Functional encryption: Definitions and challenges, TCC,: (Yuval Ishai, ed.), LNCS, vol. 6597. Springer 2011, 253\u2013273 (2011)","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Couteau, G., Devadas, L., Hegde, A., Jain, A., Servan-Schreiber, S.: Multi-key homomorphic secret sharing, IACR Cryptol. ePrint Arch. 94 (2025)","DOI":"10.1007\/978-3-031-91092-0_1"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Laguillaumie, F., Linearly homomorphic encryption from $$\\sf DDH\\it $$, CT-RSA,: (Kaisa Nyberg, ed.), LNCS, vol. 9048. Springer 2015, 487\u2013505 (2015)","DOI":"10.1007\/978-3-319-16715-2_26"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Laguillaumie, F., Tucker, I.: Threshold linearly homomorphic encryption on $$\\bf Z\\it \/2^k\\bf Z\\it $$, ASIACRYPT 2022, Part II (Shweta Agrawal and Dongdai Lin, eds.), LNCS, vol. 13792, Springer, pp.\u00a099\u2013129 (2022)","DOI":"10.1007\/978-3-031-22966-4_4"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Couteau, G., Meyer, P.: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN, EUROCRYPT 2021, Part II (Anne Canteaut and Fran\u00e7ois-Xavier Standaert, eds.), LNCS, vol. 12697, Springer, pp.\u00a0842\u2013870 (2021)","DOI":"10.1007\/978-3-030-77886-6_29"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN, CRYPTO 2023, Part II (Helena Handschuh and Anna Lysyanskaya, eds.), LNCS, vol. 14082, Springer, pp.\u00a0315\u2013348 (2023)","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Dinur, I., Keller, N., Klein, O.: An optimal distributed discrete log protocol with applications to homomorphic secret sharing, CRYPTO 2018, Part III (Hovav Shacham and Alexandra Boldyreva, eds.), LNCS, vol. 10993, Springer, pp.\u00a0213\u2013242 (2018)","DOI":"10.1007\/978-3-319-96878-0_8"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.L.: An algebraic framework for Diffie-Hellman assumptions, CRYPTO 2013, Part II (Canetti, R., Garay, J.A., eds.), LNCS, vol. 8043, Springer, pp.\u00a0129\u2013147 (2013)","DOI":"10.1007\/978-3-642-40084-1_8"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Eriguchi, R., Nuida, K.: Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials, ASIACRYPT 2021, Part II (Mehdi Tibouchi and Huaxiong Wang, eds.), LNCS, vol. 13091, Springer, pp.\u00a0191\u2013221 (2021)","DOI":"10.1007\/978-3-030-92075-3_7"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Fazio, N., Gennaro, R., Jafarikhah, T., Skeith III, W.E.: Homomorphic secret sharing from paillier encryption, ProvSec 2017 (Okamoto, T., Yu, Y., Au, M.H., Li, Y., eds.), LNCS, vol. 10592, Springer, pp.\u00a0381\u2013399 (2017)","DOI":"10.1007\/978-3-319-68637-0_23"},{"key":"18_CR23","unstructured":"Fosli, I., Ishai, Y., Kolobov, V.I., Wootters, M.; On the download rate of homomorphic secret sharing, ITCS 2022 (Braverman, M., ed.), LIPIcs, vol. 215, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp.\u00a071:1\u201371:22 (2022)"},{"key":"18_CR24","unstructured":"Gay, R.: A new paradigm for public-key functional encryption for degree-2 polynomials, PKC 2020, Part I (Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V., eds.), LNCS, vol. 12110, Springer, pp.\u00a095\u2013120 (2020)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices, ACM STOC,: Michael Mitzenmacher, ed. ACM 2009, 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Goyal, R., Koppula, V., Waters, B.: Semi-adaptive security and bundling functionalities made generic and easy, TCC 2016-B, Part II (Martin Hirt and Adam\u00a0D. Smith, eds.), LNCS, vol. 9986, pp.\u00a0361\u2013388 (2016)","DOI":"10.1007\/978-3-662-53644-5_14"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Gong, J., Qian, H.: Simple and efficient FE for quadratic functions. Des. Codes Cryptogr. 89(8), 1757\u20131786 (2021)","DOI":"10.1007\/s10623-021-00871-x"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Lai, R.W.F., Giulio Malavolta, A., geometric approach to homomorphic secret sharing, PKC,: Part II (Juan A. Garay, ed.), LNCS, vol. 12711. Springer 2021, 92\u2013119 (2021)","DOI":"10.1007\/978-3-030-75248-4_4"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Malavolta, G., Schr\u00f6der, D.: Homomorphic secret sharing for low degree polynomials, ASIACRYPT 2018, Part III (Thomas Peyrin and Steven\u00a0D. Galbraith, eds.), LNCS, vol. 11274, Springer, pp.\u00a0279\u2013309 (2018)","DOI":"10.1007\/978-3-030-03332-3_11"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier: Homomorphic secret sharing and public-key silent OT, EUROCRYPT 2021, Part I (Canteaut, A., Standaert, F.-X., eds.), LNCS, vol. 12696, Springer, pp.\u00a0678\u2013708 (2021)","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes, EUROCRYPT \u201999 (Jacques Stern, ed.), LNCS, vol. 1592, Springer, pp.\u00a0223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Phalakarn, K., Suppakitpaisarn, V., Attrapadung, N., Matsuura, K.: Constructive t-secure homomorphic secret sharing for low degree polynomials, INDOCRYPT 2020 (Bhargavan, K., Oswald, E., Prabhakaran, M., eds.), LNCS, pp.\u00a0763\u2013785 (2020)","DOI":"10.1007\/978-3-030-65277-7_34"},{"key":"18_CR33","unstructured":"Ryffel, T., Pointcheval, D., Bach, F.R., Dufour-Sans, E., Gay, R.: Partially encrypted deep learning using functional encryption, NeurIPS 2019, (Hanna\u00a0M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily\u00a0B. Fox, and Roman Garnett, eds.), pp.\u00a04519\u20134530 (2019)"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications, CRYPTO 2021, Part III (Tal Malkin and Chris Peikert, eds.), LNCS, vol. 12827, Springer, pp.\u00a0687\u2013717 (2021)","DOI":"10.1007\/978-3-030-84252-9_23"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Sun, S., Sakzad, A., Steinfeld, R., Liu, J.K., Gu, D.: Public-key puncturable encryption: Modular and compact constructions, PKC 2020, Part I (Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V., eds.), LNCS, vol. 12110, Springer, pp.\u00a0309\u2013338 (2020)","DOI":"10.1007\/978-3-030-45374-9_11"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Wee, H.: Attribute-hiding predicate encryption in bilinear groups, revisited, TCC 2017, Part I (Kalai, Y., Reyzin, L., eds.), LNCS, vol. 10677, Springer, pp.\u00a0206\u2013233 (2017)","DOI":"10.1007\/978-3-319-70500-2_8"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T21:43:44Z","timestamp":1765057424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5119-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,7]]},"ISBN":["9789819551187","9789819551194"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5119-4_18","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"}}]}}