{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:23:06Z","timestamp":1778127786081,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Cybersecurity Research Flanders","award":["VR20192203"],"award-info":[{"award-number":["VR20192203"]}]},{"name":"FWO","award":["GOH9718N"],"award-info":[{"award-number":["GOH9718N"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,26]]},"DOI":"10.1145\/3605759.3625259","type":"proceedings-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T22:55:48Z","timestamp":1700693748000},"page":"35-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Noah's Ark: Efficient Threshold-FHE Using Noise Flooding"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7476-5960","authenticated-orcid":false,"given":"Morten","family":"Dahl","sequence":"first","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6334-6277","authenticated-orcid":false,"given":"Daniel","family":"Demmler","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5657-0710","authenticated-orcid":false,"given":"Sarah","family":"El Kazdadi","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7670-4077","authenticated-orcid":false,"given":"Arthur","family":"Meyre","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4526-0434","authenticated-orcid":false,"given":"Jean-Baptiste","family":"Orfila","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1767-3725","authenticated-orcid":false,"given":"Dragos","family":"Rotaru","sequence":"additional","affiliation":[{"name":"Zama Inc., Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[{"name":"KU Leuven &amp; Zama, Leuven, Belgium"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1778-5297","authenticated-orcid":false,"given":"Samuel","family":"Tap","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3186-2482","authenticated-orcid":false,"given":"Michael","family":"Walter","sequence":"additional","affiliation":[{"name":"Zama, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--36030--6_19"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_3_1","unstructured":"Diego F. Aranha Carsten Baum Kristian Gj\u00f8steen and Tjerand Silde. 2022. Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. Cryptology ePrint Archive Report 2022\/422. https:\/\/eprint.iacr.org\/2022\/422."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--29011--4_29"},{"key":"e_1_3_2_1_5_1","unstructured":"Gilad Asharov Abhishek Jain and Daniel Wichs. 2011. Multiparty Computation with Low Communication Computation and Interaction via Threshold FHE. Cryptology ePrint Archive Report 2011\/613. https:\/\/eprint.iacr.org\/2011\/613."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-017--9265--9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--38471--5_12"},{"key":"e_1_3_2_1_8_1","unstructured":"Michiel Van Beirendonck Jan-Pieter D'Anvers and Ingrid Verbauwhede. 2022. FPT: a Fixed-Point Accelerator for Torus Fully Homomorphic Encryption. Cryptology ePrint Archive Report 2022\/1635. https:\/\/eprint.iacr.org\/2022\/1635."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--11799--2_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09463--5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--96884--1_19"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Katharina Boudgoust and Peter Scholl. 2023. Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus. Cryptology ePrint Archive Report 2023\/016. https:\/\/eprint.iacr.org\/2023\/016.","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--78086--9_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--92078--4_23"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--42045-0_12"},{"key":"e_1_3_2_1_18_1","unstructured":"Siddhartha Chowdhury Sayani Sinha Animesh Singh Shubham Mishra Chandan Chaudhary Sikhar Patranabis Pratyay Mukherjee Ayantika Chatterjee and Debdeep Mukhopadhyay. 2022. Efficient Threshold FHE with Application to Real-Time Systems. Cryptology ePrint Archive Report 2022\/1625. https:\/\/eprint.iacr.org\/2022\/1625."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--32009--5_38"},{"key":"e_1_3_2_1_21_1","unstructured":"Serge Fehr. 1993. Span Programs over Rings and How to Share a Secret from a Module. Masters Thesis ETH Zurich. https:\/\/crypto.ethz.ch\/publications\/Fehr98.html."},{"key":"e_1_3_2_1_22_1","volume-title":"A fully homomorphic encryption scheme. Ph.,D. Dissertation","author":"Gentry Craig","unstructured":"Craig Gentry. 2009. A fully homomorphic encryption scheme. Ph.,D. Dissertation. Stanford University. crypto.stanford.edu\/craig."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--99277--4_7"},{"key":"e_1_3_2_1_24_1","unstructured":"Marc Joye. 2023. TFHE Public-Key Encryption Revisited. Cryptology ePrint Archive Paper 2023\/603. https:\/\/eprint.iacr.org\/2023\/603 https:\/\/eprint.iacr.org\/2023\/603."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78372--7_6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--40186--3_12"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 11th Workshop on Encrypted Computing &amp; Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605759.3625259","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605759.3625259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:31:24Z","timestamp":1755973884000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605759.3625259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"references-count":26,"alternative-id":["10.1145\/3605759.3625259","10.1145\/3605759"],"URL":"https:\/\/doi.org\/10.1145\/3605759.3625259","relation":{},"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"2023-11-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}