{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:15:14Z","timestamp":1753521314630,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031757563"},{"type":"electronic","value":"9783031757570"}],"license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75757-0_15","type":"book-chapter","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:03:12Z","timestamp":1729594992000},"page":"294-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Multiparty Computation from\u00a0Threshold Encryption Based on\u00a0RLWE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3670-0146","authenticated-orcid":false,"given":"Antoine","family":"Urban","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3042-6504","authenticated-orcid":false,"given":"Matthieu","family":"Rambaud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abspoel, M., Cramer, R., Damg\u00e5rd, I., Escudero, D., Yuan, C.: Efficient information-theoretic secure multiparty computation over $$\\mathbb{z}\/p^k \\mathbb{z}$$ via galois rings. In: TCC (2019)","DOI":"10.1007\/978-3-030-36030-6_19"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M., et al.: Homomorphic Encryption Standard (2021)","DOI":"10.1007\/978-3-030-77287-1_2"},{"key":"15_CR3","doi-asserted-by":"crossref","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: EUROCRYPT (2012)","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: CRYPTO (2018)","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Boudgoust, K., Scholl, P.: Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. In: ASIACRYPT (2023)","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO (2012)","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Braun, L., Damg\u00e5rd, I., Orlandi, C.: Secure multiparty computation from threshold encryption based on class groups. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001). We refer to eprint 2000\/067","DOI":"10.1109\/SFCS.2001.959888"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: CCS (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H., Han, K.: Homomorphic lower digits removal and improved FHE bootstrapping. In: EUROCRYPT (2018)","DOI":"10.1007\/978-3-319-78381-9_12"},{"key":"15_CR11","unstructured":"Cheon, J.H., Cho, W., Kim, J.: Improved universal thresholdizer from threshold fully homomorphic encryption. ePrint 2023\/545 (2023)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"15_CR13","unstructured":"Chowdhury, S., et al.: Efficient threshold FHE with application to real-time systems. ePrint 2022\/1625 (2022)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: ASIACRYPT (2016)","DOI":"10.1007\/978-3-662-53890-6_33"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Dov\u00a0Gordon, S., Liu, F.H., Shi, E.: Constant-round MPC with fairness and guarantee of output delivery. In: CRYPTO (2015)","DOI":"10.1007\/978-3-662-48000-7_4"},{"key":"15_CR16","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR ePrint (2012)"},{"key":"15_CR17","unstructured":"Fehr, S.: Span programs over rings and how to share a secret from a module. Master\u2019s thesis, ETH Zurich (1998)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Fouque, P.A., Stern, J.: One round threshold discrete-log key generation without private channels. In: PKC (2001)","DOI":"10.1007\/3-540-44586-2_22"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Geelen, R., Iliashenko, I., Kang, J., Vercauteren, F.: On polynomial functions modulo $$p^e$$ and faster bootstrapping for homomorphic encryption. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30620-4_9"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Vadim, L.: Practical non-interactive publicly verifiable secret sharing with thousands of parties. In: EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"15_CR22","unstructured":"Jain, A., Rasmussen, P.M.R., Sahai, A.: Threshold fully homomorphic encryption. ePrint 2017\/257 (2017)"},{"key":"15_CR23","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: TCC (2011)"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"191319","DOI":"10.1109\/ACCESS.2020.3030970","volume":"8","author":"E Kim","year":"2020","unstructured":"Kim, E., Jeong, J., Yoon, H., Kim, Y., Cho, J., Cheon, J.H.: How to securely collaborate on data: decentralized threshold he and secure key update. IEEE Access 8, 191319\u2013191329 (2020)","journal-title":"IEEE Access"},{"issue":"6","key":"15_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 1\u201335 (2013)","journal-title":"J. ACM"},{"issue":"4","key":"15_CR26","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2478\/popets-2021-0071","volume":"2021","author":"C Mouchet","year":"2021","unstructured":"Mouchet, C., Troncoso-Pastoriza, J., Bossuat, J.P., Hubaux, J.P.: Multiparty homomorphic encryption from ring-learning-with-errors. PoPETS 2021(4), 291\u2013311 (2021)","journal-title":"PoPETS"},{"key":"15_CR27","doi-asserted-by":"publisher","first-page":"135915","DOI":"10.1109\/ACCESS.2021.3117029","volume":"9","author":"J Park","year":"2021","unstructured":"Park, J.: Homomorphic encryption for multiple users with less communications. IEEE Access 9, 135915\u2013135926 (2021)","journal-title":"IEEE Access"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Commun. ACM (1979)","DOI":"10.1145\/359168.359176"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75757-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:05:51Z","timestamp":1729595151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75757-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"ISBN":["9783031757563","9783031757570"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75757-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"17 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arlington, VA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2024","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":"isw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc24.cs.gmu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}