{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T21:02:05Z","timestamp":1784926925063,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3744884","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:32:38Z","timestamp":1763854358000},"page":"2339-2353","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["High-Throughput Universally Composable Threshold FHE Decryption"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6656-6312","authenticated-orcid":false,"given":"Guy","family":"Zyskind","sequence":"first","affiliation":[{"name":"Fhenix, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3891-154X","authenticated-orcid":false,"given":"Doron","family":"Zarchy","sequence":"additional","affiliation":[{"name":"Fhenix, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7027-3176","authenticated-orcid":false,"given":"Max","family":"Leibovich","sequence":"additional","affiliation":[{"name":"Fhenix, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0419-7501","authenticated-orcid":false,"given":"Chris","family":"Peikert","sequence":"additional","affiliation":[{"name":"Fhenix, University of Michigan, Ann Arbor, Michigan, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560827.3563379"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_1_3_1","first-page":"420","volume-title":"Efficient multiparty protocols using circuit randomization","author":"Beaver D.","year":"1991","unstructured":"D. Beaver. Efficient multiparty protocols using circuit randomization. pages 420-432, 1991."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_30"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_10_1","first-page":"357","volume-title":"Public-Key Cryptography","author":"Catalano D.","year":"2020","unstructured":"D. Catalano, M. D. Raimondo, D. Fiore, and I. Giacomelli. MonZ_2^ka: Fast maliciously secure two party computation on Z_2^k. In Public-Key Cryptography, pages 357-386, 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-024-09536-z"},{"key":"e_1_3_2_1_13_1","first-page":"426","volume-title":"Mhz2k: MPC from HE over Z_2^k with new packing, simpler reshare, and better ZKP","author":"Cheon J. H.","year":"2021","unstructured":"J. H. Cheon, D. Kim, and K. Lee. Mhz2k: MPC from HE over Z_2^k with new packing, simpler reshare, and better ZKP. pages 426-456, 2021."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09453-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_16_1","volume-title":"(In)Security of threshold fully homomorphic encryption based on Shamir secret sharing. Cryptology ePrint Archive","author":"Cho W.","year":"2024","unstructured":"W. Cho, J. Kim, and C. Lee. (In)Security of threshold fully homomorphic encryption based on Shamir secret sharing. Cryptology ePrint Archive, 2024."},{"key":"e_1_3_2_1_17_1","first-page":"221","volume-title":"Between a rock and a hard place: Interpolating between MPC and FHE","author":"Choudhury A.","year":"2013","unstructured":"A. Choudhury, J. Loftus, E. Orsini, A. Patra, and N. P. Smart. Between a rock and a hard place: Interpolating between MPC and FHE. pages 221-240, 2013."},{"key":"e_1_3_2_1_18_1","volume-title":"Efficient threshold FHE with application to real-time systems. Cryptology ePrint Archive","author":"Chowdhury S.","year":"2022","unstructured":"S. Chowdhury, S. Sinha, A. Singh, S. Mishra, C. Chaudhary, S. Patranabis, P. Mukherjee, A. Chatterjee, and D. Mukhopadhyay. Efficient threshold FHE with application to real-time systems. Cryptology ePrint Archive, 2022."},{"key":"e_1_3_2_1_19_1","unstructured":"R. Cramer I. Damg\u00e5rd D. Escudero P. Scholl and C. Xing."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605759.3625259"},{"key":"e_1_3_2_1_21_1","volume-title":"Key lifting: Multi-key fully homomorphic encryption in plain model without noise flooding. Cryptology ePrint Archive","author":"Dai X.","year":"2022","unstructured":"X. Dai, W. Wu, and Y. Feng. Key lifting: Multi-key fully homomorphic encryption in plain model without noise flooding. Cryptology ePrint Archive, 2022."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00078"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_15"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_26_1","unstructured":"D. Escudero. Multiparty Computation over Z\/2^k Z. PhD thesis University of Aarhus 2021."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"e_1_3_2_1_28_1","first-page":"383","volume-title":"More efficient dishonest majority secure computation over Z_2^k via galois rings","author":"Escudero D.","year":"2022","unstructured":"D. Escudero, C. Xing, and C. Yuan. More efficient dishonest majority secure computation over Z_2^k via galois rings. pages 383-412, 2022."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-62746-0_12"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0038"},{"key":"e_1_3_2_1_32_1","first-page":"1575","volume-title":"A versatile framework for multi-party computation","author":"Keller M.","year":"2020","unstructured":"M. Keller. MP-SPDZ: A versatile framework for multi-party computation. pages 1575-1590, 2020."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_56"},{"issue":"4","key":"e_1_3_2_1_34_1","first-page":"2","article-title":"Simulation-secure threshold PKE from LWE with polynomial modulus","volume":"1","author":"Micciancio D.","year":"2024","unstructured":"D. Micciancio and A. Suhl. Simulation-secure threshold PKE from LWE with polynomial modulus. IACR Commun. Cryptol., 1(4):2, 2024.","journal-title":"IACR Commun. Cryptol."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0071"},{"key":"e_1_3_2_1_37_1","first-page":"64","volume-title":"Workshop on Encrypted Computing and Applied Homomorphic Cryptography","author":"Mouchet C. V.","year":"2020","unstructured":"C. V. Mouchet, J.-P. Bossuat, J. R. Troncoso-Pastoriza, and J.-P. Hubaux. Lattigo: A multiparty homomorphic encryption library in Go. In Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pages 64-70, 2020."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"e_1_3_2_1_39_1","first-page":"343","volume-title":"Public Key Cryptography","author":"Nishide T.","year":"2007","unstructured":"T. Nishide and K. Ohta. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In Public Key Cryptography, pages 343-360, 2007."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-40186-3_12"},{"key":"e_1_3_2_1_41_1","first-page":"297","volume-title":"ASIACRYPT","author":"Passel\u00e8gue A.","year":"2024","unstructured":"A. Passel\u00e8gue and D. Stehl\u00e9. Low communication threshold fully homomorphic encryption. In ASIACRYPT, pages 297-329, 2024."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000074"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3582809"},{"key":"e_1_3_2_1_45_1","first-page":"227","volume-title":"MArBled circuits: Mixing arithmetic and boolean circuits with active security","author":"Rotaru D.","year":"2019","unstructured":"D. Rotaru and T. Wood. MArBled circuits: Mixing arithmetic and boolean circuits with active security. pages 227-249, 2019."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0015"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24119"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP57164.2023.00027"},{"key":"e_1_3_2_1_50_1","first-page":"45","volume-title":"Threshold fully homomorphic encryption over the torus","author":"Sugizaki Y.","year":"2023","unstructured":"Y. Sugizaki, H. Tsuchida, T. Hayashi, K. Nuida, A. Nakashima, T. Isshiki, and K. Mori. Threshold fully homomorphic encryption over the torus. pages 45-65, 2023."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0035"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3659463.3660031"},{"key":"e_1_3_2_1_53_1","volume-title":"Don't forget private retrieval: distributed private similarity search for large language models. CoRR, abs\/2311.12955","author":"Zyskind G.","year":"2023","unstructured":"G. Zyskind, T. South, and A. Pentland. Don't forget private retrieval: distributed private similarity search for large language models. CoRR, abs\/2311.12955, 2023."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670292"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3744884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:12:59Z","timestamp":1766441579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3744884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":54,"alternative-id":["10.1145\/3719027.3744884","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3744884","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}