{"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":1784926925075,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608744","type":"print"},{"value":"9789819608751","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"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-981-96-0875-1_10","type":"book-chapter","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T07:10:13Z","timestamp":1733728213000},"page":"297-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Low Communication Threshold Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9249-3969","authenticated-orcid":false,"given":"Alain","family":"Passel\u00e8gue","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3435-2453","authenticated-orcid":false,"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov, Abhishek Jain, Adriana L\u00f3pez-Alt, Eran Tromer, Vinod Vaikuntanathan, and Daniel Wichs. Multiparty computation with low communication, computation and interaction via threshold FHE. In EUROCRYPT, 2012.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal, Damien Stehl\u00e9, and Anshu Yadav. Round-optimal lattice-based threshold signatures, revisited. In ICALP, 2022.","DOI":"10.1145\/3548606.3560650"},{"key":"10_CR3","unstructured":"Youngjin Bae, Jung\u00a0Hee Cheon, Jaehyung Kim, Jai\u00a0Hyun Park, and Damien Stehl\u00e9. HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering. In CRYPTO, 2023."},{"key":"10_CR4","unstructured":"Youngjin Bae, Jung\u00a0Hee Cheon, Jaehyung Kim, and Damien Stehl\u00e9. Bootstrapping bits with CKKS. In EUROCRYPT, 2024."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Rikke Bendlin and Ivan Damg\u00e5rd. Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In TCC, 2010.","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Dan Boneh and David\u00a0Mandell Freeman. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In PKC, 2011.","DOI":"10.1007\/978-3-642-19379-8_1"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M.\u00a0R. Rasmussen, and Amit Sahai. Threshold cryptosystems from threshold fully homomorphic encryption. In CRYPTO, 2018.","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. (leveled) fully homomorphic encryption without bootstrapping. In ITCS, 2012.","DOI":"10.1145\/2090236.2090262"},{"key":"10_CR9","unstructured":"Florian Bourse and Malika Izabach\u00e8ne. Plug-and-play sanitization for TFHE. IACR eprint 2022\/1438, 2022."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, and Huijia Lin.Multiparty reusable non-interactive secure computation from LWE. In EUROCRYPT, 2021.","DOI":"10.1007\/978-3-030-77886-6_25"},{"key":"10_CR11","unstructured":"Youngjin Bae, Jaehyung Kim, Eias Suvanto, and Damien Stehl\u00e9. Bootstrapping small integers with CKKS. In ASIACRYPT, 2024."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Shi Bai, Adeline Langlois, Tancr\u00e8de Lepoint, Amin Sakzad, Damien Stehl\u00e9, and Ron Steinfeld. Improved security proofs in lattice-based cryptography: Using the R\u00e9nyi divergence rather than the statistical distance. Journal of Cryptology, 2018.","DOI":"10.1007\/s00145-017-9265-9"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehl\u00e9. Classical hardness of learning with errors. In STOC, 2013.","DOI":"10.1145\/2488608.2488680"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Florian Bourse, Rafa\u00ebl\u00a0Del Pino, Michele Minelli, and Hoeteck Wee. FHE circuit privacy almost for free. In CRYPTO, 2016.","DOI":"10.1007\/978-3-662-53008-5_3"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski. Fully homomorphic encryption without modulus switching from classical GapSVP. In CRYPTO, 2012.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Katharina Boudgoust and Peter Scholl. Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. In ASIACRYPT, 2023.","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"10_CR17","unstructured":"Katharina Boudgoust and Peter Scholl. Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus. IACR eprint 2023\/016, 2023. Version dated 16 July 2024."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. Faster fully homomorphic encryption: Bootstrapping in less than 0.1 seconds. In ASIACRYPT, 2016.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Jung\u00a0Hee Cheon, Andrey Kim, Miran Kim, and Yong\u00a0Soo Song. Homomorphic encryption for arithmetic of approximate numbers. In ASIACRYPT, 2017.","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"10_CR20","unstructured":"Siddhartha Chowdhury, Sayani Sinha, Animesh Singh, Shubham Mishra, Chandan Chaudhary, Sikhar Patranabis, Pratyay Mukherjee, Ayantika Chatterjee, and Debdeep Mukhopadhyay. Efficient threshold FHE with application to real-time systems. IACR eprint 2022\/1625, 2022. Version dated 18 July 2024."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Morten Dahl, Daniel Demmler, Sarah\u00a0El Kazdadi, Arthur Meyre, Jean-Baptiste Orfila, Dragos Rotaru, Nigel\u00a0P. Smart, Samuel Tap, and Michael Walter. Noah\u2019s ark: Efficient threshold-fhe using noise flooding. In WAHC, 2023.","DOI":"10.1145\/3605759.3625259"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas and Daniele Micciancio. FHEW: bootstrapping homomorphic encryption in less than a second. In EUROCRYPT, 2015.","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Nir Drucker, Guy Moshkowich, Tomer Pelleg, and Hayim Shaul. BLEACH: cleaning errors in discrete computations over CKKS. Journal of Cryptology, 2024.","DOI":"10.1007\/s00145-023-09483-1"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas and Damien Stehl\u00e9. Sanitization of FHE ciphertexts. In EUROCRYPT, 2016.","DOI":"10.1007\/978-3-662-49890-3_12"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Rune Thorbek. Linear integer secret sharing and distributed exponentiation. In PKC, 2006.","DOI":"10.1007\/11745853_6"},{"key":"10_CR26","unstructured":"Xiaokang Dai, Wenyuan Wu, and Yong Feng. Key lifting : a more efficient weak MKFHE scheme in the plain model against rational adversary. IACR eprint 2022\/055, 2022."},{"key":"10_CR27","unstructured":"Junfeng Fan and Frederik Vercauteren. Somewhat practical fully homomorphic encryption. IACR eprint 2012\/144, 2012."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Craig Gentry. A fully homomorphic encryption scheme. PhD thesis, 2009.","DOI":"10.1145\/1536414.1536440"},{"key":"10_CR29","unstructured":"Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. An efficient and parallel gaussian sampler for lattices. In STOC, 2008."},{"key":"10_CR30","unstructured":"Aayush Jain, Peter M.\u00a0R. Rasmussen, and Amit Sahai. Threshold fully homomorphic encryption. In eprint 2017\/257, 2017."},{"key":"10_CR31","unstructured":"Kamil Kluczniak. Circuit privacy for fhew\/tfhe-style fully homomorphic encryption in practice. IACR eprint 2022\/1459, 2022."},{"key":"10_CR32","unstructured":"Kamil Kluczniak and Giacomo Santato. On circuit private, multikey and threshold approximate homomorphic encryption. In IACR eprint 2023\/301, 2023."},{"key":"10_CR33","unstructured":"Baiyu Li and Daniele Micciancio. On the security of homomorphic encryption on approximate numbers. In EUROCRYPT, 2021."},{"key":"10_CR34","unstructured":"Baiyu Li, Daniele Micciancio, Mark Schultz, and Jessica Sorrell. Securing approximate homomorphic encryption using differential privacy. In CRYPTO, 2022."},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky, Chris Peikert, and Oded Regev. On ideal lattices and learning with errors over rings. In EUROCRYPT, 2010.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Daniele Micciancio and Petros Mol. Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. In CRYPTO, 2011.","DOI":"10.1007\/978-3-642-22792-9_26"},{"key":"10_CR37","unstructured":"Daniele Micciancio and Adam Suhl. Simulation-secure threshold PKE from LWE with polynomial modulus. In IACR eprint 2023\/1728, 2023."},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Chris Peikert. An efficient and parallel Gaussian sampler for lattices. In CRYPTO, 2010.","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Oded Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, 2005.","DOI":"10.1145\/1060590.1060603"},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Sina Shiehian. mrNISC from LWE with polynomial modulus. In SCN, 2022.","DOI":"10.1007\/978-3-031-14791-3_21"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Damien Stehl\u00e9, Ron Steinfeld, Keisuke Tanaka, and Keita Xagawa. Efficient public key encryption based on ideal lattices. In ASIACRYPT, 2009.","DOI":"10.1007\/978-3-642-10366-7_36"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0875-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T08:04:28Z","timestamp":1733731468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0875-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"ISBN":["9789819608744","9789819608751"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0875-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"10 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}