{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:56Z","timestamp":1766449796063,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":126,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623139","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"711-725","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["PELTA - Shielding Multiparty-FHE against Malicious Adversaries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1275-8367","authenticated-orcid":false,"given":"Sylvain","family":"Chatel","sequence":"first","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5686-9459","authenticated-orcid":false,"given":"Christian","family":"Mouchet","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4067-7880","authenticated-orcid":false,"given":"Ali Utkan","family":"Sahin","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5641-6270","authenticated-orcid":false,"given":"Apostolos","family":"Pyrgelis","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2374-2248","authenticated-orcid":false,"given":"Carmela","family":"Troncoso","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1533-6132","authenticated-orcid":false,"given":"Jean-Pierre","family":"Hubaux","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"NFLlib: NTT-based fast lattice library,\" in Topics in Cryptology - CT-RSA","author":"Aguilar-Melchor C.","year":"2016","unstructured":"C. Aguilar-Melchor, J. Barrier, S. Guelton, A. Guinet, M.-O. Killijian, and T. Lepoint, \"NFLlib: NTT-based fast lattice library,\" in Topics in Cryptology - CT-RSA, 2016."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Ajtai \"Generating hard instances of lattice problems \" in Annual ACM Symposium on Theory of Computing (STOC) 1996.","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_3_1","volume-title":"Homomorphic encryption security standard,\" HomomorphicEncryption.org","author":"Albrecht M.","year":"2018","unstructured":"M. Albrecht, M. Chase, H. Chen, J. Ding, S. Goldwasser, S. Gorbunov, S. Halevi, J. Hoffstein, K. Laine, K. Lauter, S. Lokam, D. Micciancio, D. Moody, T. Morrison, A. Sahai, and V. Vaikuntanathan, \"Homomorphic encryption security standard,\" HomomorphicEncryption.org, Toronto, Canada, Tech. Rep., November 2018."},{"key":"e_1_3_2_1_4_1","volume-title":"Encrypted distributed lasso for sparse data predictive control,\" in IEEE Conference on Decision and Control (CDC)","author":"Alexandru A. B.","year":"2021","unstructured":"A. B. Alexandru, A. Tsiamis, and G. J. Pappas, \"Encrypted distributed lasso for sparse data predictive control,\" in IEEE Conference on Decision and Control (CDC), 2021."},{"key":"e_1_3_2_1_5_1","volume-title":"Collaborative homomorphic computation on data encrypted under multiple keys,\" International Workshop on Privacy Engineering (IWPE'19)","author":"Aloufi A.","year":"2019","unstructured":"A. Aloufi and P. Hu, \"Collaborative homomorphic computation on data encrypted under multiple keys,\" International Workshop on Privacy Engineering (IWPE'19), 2019."},{"key":"e_1_3_2_1_6_1","author":"Aloufi A.","year":"2019","unstructured":"A. Aloufi, P. Hu, H. W. Wong, and S. S. Chow, \"Blindfolded evaluation of random forests with multi-key homomorphic encryption,\" IEEE Transactions on Dependable and Secure Computing (TDSC), 2019.","journal-title":"\"Blindfolded evaluation of random forests with multi-key homomorphic encryption,\" IEEE Transactions on Dependable and Secure Computing (TDSC)"},{"key":"e_1_3_2_1_7_1","volume-title":"Multiparty computation with low communication, computation and interaction via threshold FHE,\" in Advances in Cryptology - EUROCRYPT","author":"Asharov G.","year":"2012","unstructured":"G. Asharov, A. Jain, A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, and D. Wichs, \"Multiparty computation with low communication, computation and interaction via threshold FHE,\" in Advances in Cryptology - EUROCRYPT, 2012."},{"key":"e_1_3_2_1_8_1","volume-title":"Practical product proofs for lattice commitments,\" in Advances in Cryptology - CRYPTO","author":"Attema T.","year":"2020","unstructured":"T. Attema, V. Lyubashevsky, and G. Seiler, \"Practical product proofs for lattice commitments,\" in Advances in Cryptology - CRYPTO, 2020."},{"key":"e_1_3_2_1_9_1","volume-title":"ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data,\" in IEEE Symposium on Security and Privacy (S&P)","author":"Backes M.","year":"2015","unstructured":"M. Backes, M. Barbosa, D. Fiore, and R. M. Reischuk, \"ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data,\" in IEEE Symposium on Security and Privacy (S&P), 2015."},{"key":"e_1_3_2_1_10_1","volume-title":"A full RNS variant of FV like somewhat homomorphic encryption schemes,\" in Selected Areas in Cryptography - SAC","author":"Bajard J.-C.","year":"2017","unstructured":"J.-C. Bajard, J. Eynard, M. A. Hasan, and V. Zucca, \"A full RNS variant of FV like somewhat homomorphic encryption schemes,\" in Selected Areas in Cryptography - SAC, 2017."},{"key":"e_1_3_2_1_11_1","volume-title":"J. Groth, and V. Lyubashevsky, \"Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits,\" in Advances in Cryptology - CRYPTO","author":"Baum C.","year":"2018","unstructured":"C. Baum, J. Bootle, A. Cerulli, R. d. Pino, J. Groth, and V. Lyubashevsky, \"Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits,\" in Advances in Cryptology - CRYPTO, 2018."},{"key":"e_1_3_2_1_12_1","volume-title":"More efficient commitments from structured lattice assumptions,\" in Security and Cryptography for Networks (SCN)","author":"Baum C.","year":"2018","unstructured":"C. Baum, I. Damg\u00e5rd, V. Lyubashevsky, S. Oechsner, and C. Peikert, \"More efficient commitments from structured lattice assumptions,\" in Security and Cryptography for Networks (SCN), 2018."},{"key":"e_1_3_2_1_13_1","volume-title":"Simple amortized proofs of shortness for linear relations over polynomial rings,\" Cryptology ePrint Archive","author":"Baum C.","year":"2017","unstructured":"C. Baum and V. Lyubashevsky, \"Simple amortized proofs of shortness for linear relations over polynomial rings,\" Cryptology ePrint Archive, 2017."},{"key":"e_1_3_2_1_14_1","volume-title":"Concretely-efficient zero-knowledge arguments for arith-metic circuits and their application to lattice-based cryptography,\" in Public-Key Cryptography - PKC","author":"Baum C.","year":"2020","unstructured":"C. Baum and A. Nof, \"Concretely-efficient zero-knowledge arguments for arith-metic circuits and their application to lattice-based cryptography,\" in Public-Key Cryptography - PKC, 2020."},{"key":"e_1_3_2_1_15_1","volume-title":"Fast reed-solomon inter-active oracle proofs of proximity,\" in International Colloquium on Automata, Languages, and Programming (ICALP)","author":"Ben-Sasson E.","year":"2018","unstructured":"E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev, \"Fast reed-solomon inter-active oracle proofs of proximity,\" in International Colloquium on Automata, Languages, and Programming (ICALP), 2018."},{"key":"e_1_3_2_1_16_1","volume-title":"Aurora: Transparent succinct arguments for R1CS,\" in Advances in Cryptology - EUROCRYPT","author":"Ben-Sasson E.","year":"2019","unstructured":"E. Ben-Sasson, A. Chiesa, M. Riabzev, N. Spooner, M. Virza, and N. P. Ward, \"Aurora: Transparent succinct arguments for R1CS,\" in Advances in Cryptology - EUROCRYPT, 2019."},{"key":"e_1_3_2_1_17_1","volume-title":"Keeping shares of a secret secret,\" in Advances in Cryptolog - CRYPTO","author":"Benaloh J. C.","year":"1986","unstructured":"J. C. Benaloh, \"Secret sharing homomorphisms: Keeping shares of a secret secret,\" in Advances in Cryptolog - CRYPTO, 1986."},{"key":"e_1_3_2_1_18_1","volume-title":"Efficient zero-knowledge proofs for commitments from learning with errors over rings,\" in Computer Security - ESORICS","author":"Benhamouda F.","year":"2016","unstructured":"F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Pietrzak, \"Efficient zero-knowledge proofs for commitments from learning with errors over rings,\" in Computer Security - ESORICS, 2016."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"W. Beullens \"Sigma protocols for MQ PKP and SIS and fishy signature schemes \" in Advances in Cryptology - EUROCRYPT 2020.","DOI":"10.1007\/978-3-030-45727-3_7"},{"key":"e_1_3_2_1_20_1","volume-title":"Poisoning attacks against support vector machines,\" in ICML","author":"Biggio B.","year":"2012","unstructured":"B. Biggio, B. Nelson, and P. Laskov, \"Poisoning attacks against support vector machines,\" in ICML, 2012."},{"key":"e_1_3_2_1_21_1","volume-title":"How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation,\" in International Conference on Financial Cryptography and Data Security (FC)","author":"Bogdanov D.","year":"2015","unstructured":"D. Bogdanov, M. J\u00f5emets, S. Siim, and M. Vaht, \"How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation,\" in International Conference on Financial Cryptography and Data Security (FC), 2015."},{"key":"e_1_3_2_1_22_1","volume-title":"Deploying secure multi-party computation for financial data analysis,\" in International Conference on Financial Cryptography and Data Security (FC)","author":"Bogdanov D.","year":"2012","unstructured":"D. Bogdanov, R. Talviste, and J. Willemson, \"Deploying secure multi-party computation for financial data analysis,\" in International Conference on Financial Cryptography and Data Security (FC), 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"Pagter et al., \"Secure multiparty computation goes live,\" in International Conference on Financial Cryptography and Data Security (FC)","author":"Bogetoft P.","year":"2009","unstructured":"P. Bogetoft, D. L. Christensen, I. Damg\u00e5rd, M. Geisler, T. Jakobsen, M. Kr\u00f8igaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter et al., \"Secure multiparty computation goes live,\" in International Conference on Financial Cryptography and Data Security (FC), 2009."},{"key":"e_1_3_2_1_24_1","volume-title":"Flexible and efficient verifiable com-putation on encrypted data,\" in Public-Key Cryptography - PKC","author":"Bois A.","year":"2021","unstructured":"A. Bois, I. Cascudo, D. Fiore, and D. Kim, \"Flexible and efficient verifiable com-putation on encrypted data,\" in Public-Key Cryptography - PKC, 2021."},{"key":"e_1_3_2_1_25_1","volume-title":"Threshold cryptosystems from threshold fully homomorphic encryption,\" in Advances in Cryptology - CRYPTO","author":"Boneh D.","year":"2018","unstructured":"D. Boneh, R. Gennaro, S. Goldfeder, A. Jain, S. Kim, P. M. Rasmussen, and A. Sahai, \"Threshold cryptosystems from threshold fully homomorphic encryption,\" in Advances in Cryptology - CRYPTO, 2018."},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting,\" in Advances in Cryptology - EUROCRYPT","author":"Bootle J.","year":"2016","unstructured":"J. Bootle, A. Cerulli, P. Chaidos, J. Groth, and C. Petit, \"Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting,\" in Advances in Cryptology - EUROCRYPT, 2016."},{"key":"e_1_3_2_1_27_1","volume-title":"Linear-time zero-knowledge proofs for arithmetic circuit satisfiability,\" in Advances in Cryptology - ASIACRYPT","author":"Bootle J.","year":"2017","unstructured":"J. Bootle, A. Cerulli, E. Ghadafi, J. Groth, M. Hajiabadi, and S. K. Jakobsen, \"Linear-time zero-knowledge proofs for arithmetic circuit satisfiability,\" in Advances in Cryptology - ASIACRYPT, 2017."},{"key":"e_1_3_2_1_28_1","volume-title":"A non-PCP approach to succinct quantum-safe zero-knowledge,\" in Advances in Cryptology - CRYPTO","author":"Bootle J.","year":"2020","unstructured":"J. Bootle, V. Lyubashevsky, N. K. Nguyen, and G. Seiler, \"A non-PCP approach to succinct quantum-safe zero-knowledge,\" in Advances in Cryptology - CRYPTO, 2020."},{"key":"e_1_3_2_1_29_1","unstructured":"-- \"More efficient amortization of exact zero-knowledge proofs for LWE \" in Computer Security - ESORICS 2021."},{"key":"e_1_3_2_1_30_1","volume-title":"Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs,\" in Advances in Cryptology - CRYPTO","author":"Bootle J.","year":"2019","unstructured":"J. Bootle, V. Lyubashevsky, and G. Seiler, \"Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs,\" in Advances in Cryptology - CRYPTO, 2019."},{"key":"e_1_3_2_1_31_1","volume-title":"Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy,\" in International Conference on Post-Quantum Cryptography (PQCrypto)","author":"Boschini C.","year":"2020","unstructured":"C. Boschini, J. Camenisch, M. Ovsiankin, and N. Spooner, \"Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy,\" in International Conference on Post-Quantum Cryptography (PQCrypto), 2020."},{"key":"e_1_3_2_1_32_1","author":"Brakerski Z.","year":"2014","unstructured":"Z. Brakerski, C. Gentry, and V. Vaikuntanathan, \"(leveled) fully homomorphic encryption without bootstrapping,\" ACM Transactions on Computation Theory (TOCT), 2014.","journal-title":"\"(leveled) fully homomorphic encryption without bootstrapping,\" ACM Transactions on Computation Theory (TOCT)"},{"key":"e_1_3_2_1_33_1","volume-title":"Lattice-based fully dynamic multi-key FHE with short ciphertexts,\" in Advances in Cryptology - CRYPTO","author":"Brakerski Z.","year":"2016","unstructured":"Z. Brakerski and R. Perlman, \"Lattice-based fully dynamic multi-key FHE with short ciphertexts,\" in Advances in Cryptology - CRYPTO, 2016."},{"key":"e_1_3_2_1_34_1","volume-title":"Bulletproofs: Short proofs for confidential transactions and more,\" in IEEE Symposium on Security and Privacy (S&P)","author":"B\u00fcnz B.","year":"2018","unstructured":"B. B\u00fcnz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell, \"Bulletproofs: Short proofs for confidential transactions and more,\" in IEEE Symposium on Security and Privacy (S&P), 2018."},{"key":"e_1_3_2_1_35_1","volume-title":"Transparent SNARKs from DARK compilers,\" in Advances in Cryptology - EUROCRYPT","author":"B\u00fcnz B.","year":"2020","unstructured":"B. B\u00fcnz, B. Fisch, and A. Szepieniec, \"Transparent SNARKs from DARK compilers,\" in Advances in Cryptology - EUROCRYPT, 2020."},{"key":"e_1_3_2_1_36_1","volume-title":"Authenticating computation on groups: New homomorphic primitives and applications,\" in Advances in Cryptology - ASIACRYPT","author":"Catalano D.","year":"2014","unstructured":"D. Catalano, A. Marcedone, and O. Puglisi, \"Authenticating computation on groups: New homomorphic primitives and applications,\" in Advances in Cryptology - ASIACRYPT, 2014."},{"key":"e_1_3_2_1_37_1","unstructured":"S. Chatel C. Knabenhans A. Pyrgelis and J.-P. Hubaux \"Verifiable encodings for secure homomorphic analytics \" arXiv preprint arXiv:2207.14071 2022."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"S. Chatel C. Mouchet A. U. Sahin A. Pyrgelis C. Troncoso and J.-P. Hubaux \"Pelta - shielding multiparty-FHE against malicious adversaries \" in Cryptology ePrint Archive Paper 2023\/642 2023 https:\/\/eprint.iacr.org\/2023\/642.","DOI":"10.1145\/3576915.3623139"},{"key":"e_1_3_2_1_39_1","first-page":"2111","author":"Chatel S.","year":"2021","unstructured":"S. Chatel, A. Pyrgelis, J. R. Troncoso-Pastoriza, and J.-P. Hubaux, \"Privacy and integrity preserving computations with crisp.\" in USENIX Security Symposium, 2021, pp. 2111--2128.","journal-title":"USENIX Security Symposium"},{"key":"e_1_3_2_1_40_1","volume-title":"Multi-key homomorphic encryption from TFHE,\" in Advances in Cryptology - ASIACRYPT","author":"Chen H.","year":"2019","unstructured":"H. Chen, I. Chillotti, and Y. Song, \"Multi-key homomorphic encryption from TFHE,\" in Advances in Cryptology - ASIACRYPT, 2019."},{"key":"e_1_3_2_1_41_1","volume-title":"Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS)","author":"Chen H.","year":"2019","unstructured":"H. Chen, W. Dai, M. Kim, and Y. Song, \"Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS), 2019."},{"key":"e_1_3_2_1_42_1","volume-title":"Secure and federated linear mixed model association tests,\" bioRxiv","author":"Chen J.","year":"2022","unstructured":"J. Chen, M. Edupalli, B. Berger, and H. Cho, \"Secure and federated linear mixed model association tests,\" bioRxiv, 2022."},{"key":"e_1_3_2_1_43_1","volume-title":"Batched multi-hop multi-key fhe from ring-LWE with compact ciphertext extension,\" in Theory of Cryptography (TCC)","author":"Chen L.","year":"2017","unstructured":"L. Chen, Z. Zhang, and X. Wang, \"Batched multi-hop multi-key fhe from ring-LWE with compact ciphertext extension,\" in Theory of Cryptography (TCC), 2017."},{"key":"e_1_3_2_1_44_1","volume-title":"HOLMES: a platform for detecting malicious inputs in secure collaborative computation,\" Cryptology ePrint Archive","author":"Chen W.","year":"2021","unstructured":"W. Chen, K. Sotiraki, I. Chang, M. Kantarcioglu, and R. A. Popa, \"HOLMES: a platform for detecting malicious inputs in secure collaborative computation,\" Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_1_45_1","volume-title":"On key recovery attacks against existing somewhat homomorphic encryption schemes,\" in Progress in Cryptology - LATINCRYPT","author":"Chenal M.","year":"2014","unstructured":"M. Chenal and Q. Tang, \"On key recovery attacks against existing somewhat homomorphic encryption schemes,\" in Progress in Cryptology - LATINCRYPT, 2014."},{"key":"e_1_3_2_1_46_1","volume-title":"Toward a secure drone system: Flying with real-time homomorphic authenticated encryption,\" IEEE access","author":"Cheon J. H.","year":"2018","unstructured":"J. H. Cheon, K. Han, S.-M. Hong, H. J. Kim, J. Kim, S. Kim, H. Seo, H. Shim, and Y. Song, \"Toward a secure drone system: Flying with real-time homomorphic authenticated encryption,\" IEEE access, 2018."},{"key":"e_1_3_2_1_47_1","volume-title":"Homomorphic encryption for arithmetic of approximate numbers,\" in Advances in Cryptology - ASIACRYPT","author":"Cheon J. H.","year":"2017","unstructured":"J. H. Cheon, A. Kim, M. Kim, and Y. Song, \"Homomorphic encryption for arithmetic of approximate numbers,\" in Advances in Cryptology - ASIACRYPT, 2017."},{"key":"e_1_3_2_1_48_1","volume-title":"Attacking fhe-based applications by soft-ware fault injections,\" Cryptology ePrint Archive","author":"Chillotti I.","year":"2016","unstructured":"I. Chillotti, N. Gama, and L. Goubin, \"Attacking fhe-based applications by soft-ware fault injections,\" Cryptology ePrint Archive, 2016."},{"key":"e_1_3_2_1_49_1","volume-title":"Secure and federated genome-wide association studies for biobank-scale datasets,\" bioRxiv","author":"Cho H.","year":"2022","unstructured":"H. Cho, D. Froelicher, J. Chen, M. Edupalli, A. Pyrgelis, J. R. Troncoso-Pastoriza, J.-P. Hubaux, and B. Berger, \"Secure and federated genome-wide association studies for biobank-scale datasets,\" bioRxiv, 2022."},{"key":"e_1_3_2_1_50_1","volume-title":"Paper 2022\/1625","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, Paper 2022\/1625, 2022."},{"key":"e_1_3_2_1_51_1","volume-title":"Efficient range proofs with trans-parent setup from bounded integer commitments,\" in Advances in Cryptology - EUROCRYPT","author":"Couteau G.","year":"2021","unstructured":"G. Couteau, M. Kloo\u00df, H. Lin, and M. Reichle, \"Efficient range proofs with trans-parent setup from bounded integer commitments,\" in Advances in Cryptology - EUROCRYPT, 2021."},{"key":"e_1_3_2_1_52_1","volume-title":"Challenges for ring-LWE,\" Cryptology ePrint Archive","author":"Crockett E.","year":"2016","unstructured":"E. Crockett and C. Peikert, \"Challenges for ring-LWE,\" Cryptology ePrint Archive, 2016."},{"key":"e_1_3_2_1_53_1","volume-title":"Multiparty computation from somewhat homomorphic encryption,\" in Advances in Cryptology - CRYPTO","author":"Damg\u00e5rd I.","year":"2012","unstructured":"I. Damg\u00e5rd, V. Pastro, N. Smart, and S. Zakarias, \"Multiparty computation from somewhat homomorphic encryption,\" in Advances in Cryptology - CRYPTO, 2012."},{"key":"e_1_3_2_1_54_1","volume-title":"Lattice-based group signatures and zero-knowledge proofs of automorphism stability,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS)","author":"Del Pino R.","year":"2018","unstructured":"R. Del Pino, V. Lyubashevsky, and G. Seiler, \"Lattice-based group signatures and zero-knowledge proofs of automorphism stability,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS), 2018."},{"key":"e_1_3_2_1_55_1","unstructured":"-- \"Short discrete log proofs for FHE and ring-LWE ciphertexts \" in Public-Key Cryptography - PKC 2019."},{"key":"e_1_3_2_1_56_1","author":"Ducas L.","year":"2018","unstructured":"L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, and D. Stehl\u00e9, \"Crystals-dilithium: A lattice-based digital signature scheme,\" IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018.","journal-title":"\"Crystals-dilithium: A lattice-based digital signature scheme,\" IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_2_1_57_1","unstructured":"EPFL \"PELTA's Implementation \" 2023 https:\/\/github.com\/ldsec\/pelta."},{"volume-title":"Jul.","year":"2021","key":"e_1_3_2_1_58_1","unstructured":"EPFL-LDS, \"Lattigo v2.2.0,\" Online: http:\/\/github.com\/ldsec\/lattigo, Jul. 2021."},{"key":"e_1_3_2_1_59_1","volume-title":"Practical exact proofs from lattices: New techniques to exploit fully-splitting rings,\" in Advances in Cryptology - ASIACRYPT","author":"Esgin M. F.","year":"2020","unstructured":"M. F. Esgin, N. K. Nguyen, and G. Seiler, \"Practical exact proofs from lattices: New techniques to exploit fully-splitting rings,\" in Advances in Cryptology - ASIACRYPT, 2020."},{"key":"e_1_3_2_1_60_1","volume-title":"Lattice-based zero-knowledge proofs: New techniques for shorter and faster constructions and applications,\" in Advances in Cryptology - CRYPTO","author":"Esgin M. F.","year":"2019","unstructured":"M. F. Esgin, R. Steinfeld, J. K. Liu, and D. Liu, \"Lattice-based zero-knowledge proofs: New techniques for shorter and faster constructions and applications,\" in Advances in Cryptology - CRYPTO, 2019."},{"key":"e_1_3_2_1_61_1","volume-title":"Somewhat practical fully homomorphic encryption.\" IACR Cryptol. ePrint Arch","author":"Fan J.","year":"2012","unstructured":"J. Fan and F. Vercauteren, \"Somewhat practical fully homomorphic encryption.\" IACR Cryptol. ePrint Arch., 2012."},{"key":"e_1_3_2_1_62_1","volume-title":"Security vulnerabilities of SGX and coun-termeasures: A survey,\" ACM Computing Surveys (CSUR)","author":"Fei S.","year":"2021","unstructured":"S. Fei, Z. Yan, W. Ding, and H. Xie, \"Security vulnerabilities of SGX and coun-termeasures: A survey,\" ACM Computing Surveys (CSUR), 2021."},{"key":"e_1_3_2_1_63_1","volume-title":"Yalame et al., \"SAFELearn: secure aggregation for private federated learning,\" in IEEE Security and Privacy Workshops (SPW)","author":"Fereidooni H.","year":"2021","unstructured":"H. Fereidooni, S. Marchal, M. Miettinen, A. Mirhoseini, H. M\u00f6llering, T. D. Nguyen, P. Rieger, A.-R. Sadeghi, T. Schneider, H. Yalame et al., \"SAFELearn: secure aggregation for private federated learning,\" in IEEE Security and Privacy Workshops (SPW), 2021."},{"key":"e_1_3_2_1_64_1","volume-title":"How to prove yourself: Practical solutions to identifica-tion and signature problems,\" in Advances in Cryptology - CRYPTO","author":"Fiat A.","year":"1986","unstructured":"A. Fiat and A. Shamir, \"How to prove yourself: Practical solutions to identifica-tion and signature problems,\" in Advances in Cryptology - CRYPTO, 1986."},{"key":"e_1_3_2_1_65_1","volume-title":"Efficiently verifiable computation on en-crypted data,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS)","author":"Fiore D.","year":"2014","unstructured":"D. Fiore, R. Gennaro, and V. Pastro, \"Efficiently verifiable computation on en-crypted data,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS), 2014."},{"key":"e_1_3_2_1_66_1","volume-title":"Boosting verifiable computation on encrypted data,\" in Public-Key Cryptography - PKC","author":"Fiore D.","year":"2020","unstructured":"D. Fiore, A. Nitulescu, and D. Pointcheval, \"Boosting verifiable computation on encrypted data,\" in Public-Key Cryptography - PKC, 2020."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"D. Froelicher J. R. Troncoso-Pastoriza A. Pyrgelis S. Sav J. S. Sousa J.-P. Bossuat and J.-P. Hubaux \"Scalable privacy-preserving distributed learning \" Proceedings on Privacy Enhancing Technologies 2021.","DOI":"10.2478\/popets-2021-0030"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"crossref","unstructured":"D. Froelicher J. R. Troncoso-Pastoriza J. L. Raisaro M. A. Cuendet J. S. Sousa H. Cho B. Berger J. Fellay and J.-P. Hubaux \"Truly privacy-preserving federated analytics for precision medicine with multiparty homomorphic encryption \" Nature communications 2021.","DOI":"10.1101\/2021.02.24.432489"},{"key":"e_1_3_2_1_69_1","unstructured":"C. Ganesh A. Nitulescu and E. Soria-Vazquez \"Rinocchio: Snarks for ring arithmetic \" Cryptology ePrint Archive Report 2021\/322 2021."},{"key":"e_1_3_2_1_70_1","volume-title":"On the design of hardware building blocks for modern lattice-based encryption schemes,\" in Cryptographic Hardware and Embedded Systems - CHES","author":"G\u00f6ttert N.","year":"2012","unstructured":"N. G\u00f6ttert, T. Feller, M. Schneider, J. Buchmann, and S. Huss, \"On the design of hardware building blocks for modern lattice-based encryption schemes,\" in Cryptographic Hardware and Embedded Systems - CHES, 2012."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"J. Groth \"Efficient zero-knowledge arguments from two-tiered homomorphic commitments \" in Advances in Cryptology - ASIACRYPT 2011.","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"e_1_3_2_1_72_1","volume-title":"An improved RNS variant of the BFV homomorphic encryption scheme,\" in Topics in Cryptology--CT-RSA","author":"Halevi S.","year":"2019","unstructured":"S. Halevi, Y. Polyakov, and V. Shoup, \"An improved RNS variant of the BFV homomorphic encryption scheme,\" in Topics in Cryptology--CT-RSA, 2019."},{"volume-title":"Oct.","year":"2021","key":"e_1_3_2_1_73_1","unstructured":"IBM, \"Helib v2.2.1,\" Online: https:\/\/github.com\/homenc\/HElib, Oct. 2021."},{"key":"e_1_3_2_1_74_1","volume-title":"Deriving genomic diagnoses without revealing patient genomes,\" Science","author":"Jagadeesh K. A.","year":"2017","unstructured":"K. A. Jagadeesh, D. J. Wu, J. A. Birgmeier, D. Boneh, and G. Bejerano, \"Deriving genomic diagnoses without revealing patient genomes,\" Science, 2017."},{"key":"e_1_3_2_1_75_1","volume-title":"Manipulat- ing machine learning: Poisoning attacks and countermeasures for regression learning,\" in IEEE Symposium on Security and Privacy (S&P)","author":"Jagielski M.","year":"2018","unstructured":"M. Jagielski, A. Oprea, B. Biggio, C. Liu, C. Nita-Rotaru, and B. Li, \"Manipulat- ing machine learning: Poisoning attacks and countermeasures for regression learning,\" in IEEE Symposium on Security and Privacy (S&P), 2018."},{"key":"e_1_3_2_1_76_1","volume-title":"Homomorphic authenticated encryption secure against chosen-ciphertext attack,\" in Advances in Cryptology - ASIACRYPT","author":"Joo C.","year":"2014","unstructured":"C. Joo and A. Yun, \"Homomorphic authenticated encryption secure against chosen-ciphertext attack,\" in Advances in Cryptology - ASIACRYPT, 2014."},{"key":"e_1_3_2_1_77_1","volume-title":"Constant-size commitments to polynomials and their applications,\" in Advances in Cryptology - ASIACRYPT","author":"Kate A.","year":"2010","unstructured":"A. Kate, G. M. Zaverucha, and I. Goldberg, \"Constant-size commitments to polynomials and their applications,\" in Advances in Cryptology - ASIACRYPT, 2010."},{"key":"e_1_3_2_1_78_1","volume-title":"Concurrently secure identification schemes based on the worst-case hardness of lattice problems,\" in Advances in Cryptology - ASIACRYPT","author":"Kawachi A.","year":"2008","unstructured":"A. Kawachi, K. Tanaka, and K. Xagawa, \"Concurrently secure identification schemes based on the worst-case hardness of lattice problems,\" in Advances in Cryptology - ASIACRYPT, 2008."},{"key":"e_1_3_2_1_79_1","volume-title":"General bootstrapping approach for RLWE-based homomorphic encryption,\" Cryptology ePrint Archive","author":"Kim A.","year":"2021","unstructured":"A. Kim, M. Deryabin, J. Eom, R. Choi, Y. Lee, W. Ghang, and D. Yoo, \"General bootstrapping approach for RLWE-based homomorphic encryption,\" Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_1_80_1","volume-title":"Revisiting homomorphic encryption schemes for finite fields,\" in Advances in Cryptology - ASIACRYPT","author":"Kim A.","year":"2021","unstructured":"A. Kim, Y. Polyakov, and V. Zucca, \"Revisiting homomorphic encryption schemes for finite fields,\" in Advances in Cryptology - ASIACRYPT, 2021."},{"key":"e_1_3_2_1_81_1","volume-title":"A unified framework of homomorphic encryption for multiple parties with non-interactive setup,\" Cryptology ePrint Archive","author":"Kwak H.","year":"2021","unstructured":"H. Kwak, D. Lee, Y. Song, and S. Wagh, \"A unified framework of homomorphic encryption for multiple parties with non-interactive setup,\" Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_1_82_1","volume-title":"Verifiable computation on outsourced encrypted data,\" in Computer Security - ESORICS","author":"Lai J.","year":"2014","unstructured":"J. Lai, R. H. Deng, H. Pang, and J. Weng, \"Verifiable computation on outsourced encrypted data,\" in Computer Security - ESORICS, 2014."},{"key":"e_1_3_2_1_83_1","volume-title":"Codes and Cryptography","author":"Langlois A.","year":"2015","unstructured":"A. Langlois and D. Stehl\u00e9, \"Worst-case to average-case reductions for module lattices,\" Designs, Codes and Cryptography, 2015."},{"key":"e_1_3_2_1_84_1","volume-title":"Efficient multi-key FHE with short extended ciphertexts and directed decryption protocol,\" IEEE Access","author":"Li N.","year":"2019","unstructured":"N. Li, T. Zhou, X. Yang, Y. Han, W. Liu, and G. Tu, \"Efficient multi-key FHE with short extended ciphertexts and directed decryption protocol,\" IEEE Access, 2019."},{"key":"e_1_3_2_1_85_1","author":"Li S.","year":"2022","unstructured":"S. Li, X. Wang, and R. Xue, \"Toward both privacy and efficiency of homomorphic MACs for polynomial functions and its applications,\" The Computer Journal, 2022.","journal-title":"\"Toward both privacy and efficiency of homomorphic MACs for polynomial functions and its applications,\" The Computer Journal"},{"key":"e_1_3_2_1_86_1","volume-title":"Privacy-preserving homomorphic MACs with efficient verification,\" in Web Services-ICWS","author":"Li S.","year":"2018","unstructured":"S. Li, X. Wang, and R. Zhang, \"Privacy-preserving homomorphic MACs with efficient verification,\" in Web Services-ICWS, 2018."},{"key":"e_1_3_2_1_87_1","volume-title":"Lattice-based zero-knowledge arguments for integer relations,\" in Advances in Cryptology - CRYPTO","author":"Libert B.","year":"2018","unstructured":"B. Libert, S. Ling, K. Nguyen, and H. Wang, \"Lattice-based zero-knowledge arguments for integer relations,\" in Advances in Cryptology - CRYPTO, 2018."},{"key":"e_1_3_2_1_88_1","volume-title":"Linearly homomorphic structure-preserving signatures and their applications,\" Advances in Cryptology - CRYPTO","author":"Libert B.","year":"2013","unstructured":"B. Libert, T. Peters, M. Joye, and M. Yung, \"Linearly homomorphic structure-preserving signatures and their applications,\" Advances in Cryptology - CRYPTO, 2013."},{"key":"e_1_3_2_1_89_1","first-page":"16","author":"Ling S.","year":"2013","unstructured":"S. Ling, K. Nguyen, D. Stehl\u00e9, and H. Wang, \"Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications,\" in Public-Key Cryptography - PKC. Proceedings 16, 2013.","journal-title":"Proceedings"},{"key":"e_1_3_2_1_90_1","volume-title":"On-the-fly multiparty com-putation on the cloud via multikey fully homomorphic encryption,\" in Annual ACM symposium on Theory of computing (STOC)","author":"L\u00f3pez-Alt A.","year":"2012","unstructured":"A. L\u00f3pez-Alt, E. Tromer, and V. Vaikuntanathan, \"On-the-fly multiparty com-putation on the cloud via multikey fully homomorphic encryption,\" in Annual ACM symposium on Theory of computing (STOC), 2012."},{"key":"e_1_3_2_1_91_1","volume-title":"Applications to lattice and factoring-based signatures,\" in Advances in Cryptology - ASIACRYPT","author":"Lyubashevsky V.","year":"2009","unstructured":"V. Lyubashevsky, \"Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures,\" in Advances in Cryptology - ASIACRYPT, 2009."},{"key":"e_1_3_2_1_92_1","unstructured":"-- \"Lattice signatures without trapdoors \" in Advances in Cryptology - EUROCRYPT 2012."},{"key":"e_1_3_2_1_93_1","volume-title":"One-shot verifiable encryption from lattices,\" in Advances in Cryptology - EUROCRYPT","author":"Lyubashevsky V.","year":"2017","unstructured":"V. Lyubashevsky and G. Neven, \"One-shot verifiable encryption from lattices,\" in Advances in Cryptology - EUROCRYPT, 2017."},{"key":"e_1_3_2_1_94_1","volume-title":"Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general,\" in Advances in Cryptology - CRYPTO","author":"Lyubashevsky V.","year":"2022","unstructured":"V. Lyubashevsky, N. K. Nguyen, and M. Plan\u00e7on, \"Lattice-based zero-knowledge proofs and applications: Shorter, simpler, and more general,\" in Advances in Cryptology - CRYPTO, 2022."},{"key":"e_1_3_2_1_95_1","volume-title":"Practical lattice-based zero-knowledge proofs for integer relations,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS)","author":"Lyubashevsky V.","year":"2020","unstructured":"V. Lyubashevsky, N. K. Nguyen, and G. Seiler, \"Practical lattice-based zero-knowledge proofs for integer relations,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS), 2020."},{"key":"e_1_3_2_1_96_1","unstructured":"-- \"Shorter lattice-based zero-knowledge proofs via one-time commitments \" in Public-Key Cryptography - PKC 2021."},{"key":"e_1_3_2_1_97_1","volume-title":"set membership from ideal lattices with applications to ring sig-natures and confidential transactions,\" in Advances in Cryptology - CRYPTO","author":"Lyubashevsky V.","year":"2021","unstructured":"--, \"SMILE: set membership from ideal lattices with applications to ring sig-natures and confidential transactions,\" in Advances in Cryptology - CRYPTO, 2021."},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"crossref","unstructured":"C. Mouchet E. Bertrand and J.-P. Hubaux \"An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption \" Journal of Cryptology 2023.","DOI":"10.1007\/s00145-023-09452-8"},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"crossref","unstructured":"C. Mouchet J. Troncoso-Pastoriza J.-P. Bossuat and J.-P. Hubaux \"Multiparty homomorphic encryption from ring-learning-with-errors \" Proceedings on Privacy Enhancing Technologies 2021.","DOI":"10.2478\/popets-2021-0071"},{"key":"e_1_3_2_1_100_1","volume-title":"Two round multiparty computation via multi-key FHE,\" in Advances in Cryptology - EUROCRYPT","author":"Mukherjee P.","year":"2016","unstructured":"P. Mukherjee and D. Wichs, \"Two round multiparty computation via multi-key FHE,\" in Advances in Cryptology - EUROCRYPT, 2016."},{"key":"e_1_3_2_1_101_1","volume-title":"CHEX-MIX: Combining homomorphic encryption with trusted execution environments for two-party oblivious inference in the cloud,\" Cryptology ePrint Archive","author":"Natarajan D.","year":"2021","unstructured":"D. Natarajan, A. Loveless, W. Dai, and R. Dreslinski, \"CHEX-MIX: Combining homomorphic encryption with trusted execution environments for two-party oblivious inference in the cloud,\" Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"crossref","unstructured":"J. Park \"Homomorphic encryption for multiple users with less communications \" IEEE Access 2021.","DOI":"10.1109\/ACCESS.2021.3117029"},{"key":"e_1_3_2_1_103_1","volume-title":"Pinocchio: Nearly practical verifiable computation,\" in IEEE Symposium on Security and Privacy (S&P)","author":"Parno B.","year":"2013","unstructured":"B. Parno, J. Howell, C. Gentry, and M. Raykova, \"Pinocchio: Nearly practical verifiable computation,\" in IEEE Symposium on Security and Privacy (S&P), 2013."},{"key":"e_1_3_2_1_104_1","volume-title":"Multi-key FHE from LWE, revisited,\" in Theory of Cryptography (TCC)","author":"Peikert C.","year":"2016","unstructured":"C. Peikert and S. Shiehian, \"Multi-key FHE from LWE, revisited,\" in Theory of Cryptography (TCC), 2016."},{"key":"e_1_3_2_1_105_1","volume-title":"Palisade lattice cryptography library user manual,\" Cybersecurity Research Center","author":"Polyakov Y.","year":"2017","unstructured":"Y. Polyakov, K. Rohloff, and G. W. Ryan, \"Palisade lattice cryptography library user manual,\" Cybersecurity Research Center, New Jersey Institute of Technology (NJIT), Tech. Rep, 2017."},{"key":"e_1_3_2_1_106_1","volume-title":"Prime Match: A privacy-preserving inventory matching system,\" Cryptology ePrint Archive","author":"Polychroniadou A.","year":"2023","unstructured":"A. Polychroniadou, G. Asharov, B. Diamond, T. Balch, H. Buehler, R. Hua, S. Gu, G. Gimler, and M. Veloso, \"Prime Match: A privacy-preserving inventory matching system,\" Cryptology ePrint Archive, 2023."},{"key":"e_1_3_2_1_107_1","volume-title":"Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware,\" in Progress in Cryptology - LATIN-CRYPT","author":"P\u00f6ppelmann T.","year":"2012","unstructured":"T. P\u00f6ppelmann and T. G\u00fcneysu, \"Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware,\" in Progress in Cryptology - LATIN-CRYPT, 2012."},{"key":"e_1_3_2_1_108_1","volume-title":"Enabling secure and privacy-preserving exploration of distributed clinical and genomic data,\" IEEE\/ACM transactions on computational biology and bioinformatics","author":"Raisaro J. L.","year":"2018","unstructured":"J. L. Raisaro, J. Troncoso-Pastoriza, M. Misbach, J. S. Sousa, S. Pradervand, E. Missiaglia, O. Michielin, B. Ford, and J.-P. Hubaux, \"MedCo: Enabling secure and privacy-preserving exploration of distributed clinical and genomic data,\" IEEE\/ACM transactions on computational biology and bioinformatics, 2018."},{"key":"e_1_3_2_1_109_1","volume-title":"ELSA: Secure aggregation for federated learning with malicious actors,\" in IEEE Symposium on Security and Privacy (S&P)","author":"Rathee M.","year":"2023","unstructured":"M. Rathee, C. Shen, S. Wagh, and R. A. Popa, \"ELSA: Secure aggregation for federated learning with malicious actors,\" in IEEE Symposium on Security and Privacy (S&P), 2023."},{"key":"e_1_3_2_1_110_1","author":"Rotaru D.","year":"2022","unstructured":"D. Rotaru, N. P. Smart, T. Tanguy, F. Vercauteren, and T. Wood, \"Actively secure setup for SPDZ,\" Journal of Cryptology, 2022.","journal-title":"\"Actively secure setup for SPDZ,\" Journal of Cryptology"},{"key":"e_1_3_2_1_111_1","doi-asserted-by":"crossref","unstructured":"S. Sav J.-P. Bossuat J. R. Troncoso-Pastoriza M. Claassen and J.-P. Hubaux \"Privacy-preserving federated neural network learning for disease-associated cell classification \" Patterns 2022.","DOI":"10.1101\/2022.01.10.475610"},{"key":"e_1_3_2_1_112_1","volume-title":"Privacy-preserving federated neural network learning,\" Annual Network And Distributed System Security Symposium (NDSS)","author":"Sav S.","year":"2021","unstructured":"S. Sav, A. Pyrgelis, J. R. Troncoso-Pastoriza, D. Froelicher, J.-P. Bossuat, J. S. Sousa, and J.-P. Hubaux, \"POSEIDON: Privacy-preserving federated neural network learning,\" Annual Network And Distributed System Security Symposium (NDSS), 2021."},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"crossref","unstructured":"J. T. Schwartz \"Fast probabilistic algorithms for verification of polynomial identities \" Journal of the ACM 1980.","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_114_1","unstructured":"\"Microsoft SEAL (release 3.0) \" http:\/\/sealcrypto.org Oct. 2018."},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"crossref","unstructured":"J. Stern \"A new identification scheme based on syndrome decoding \" in Advances in Cryptology - CRYPTO 1993.","DOI":"10.1007\/3-540-48329-2_2"},{"key":"e_1_3_2_1_116_1","volume-title":"Efficient verifiable computation of linear and quadratic functions over encrypted data,\" in ACM on Asia Conference on Computer and Communications Security (Asia CCS)","author":"Tran N. H.","year":"2016","unstructured":"N. H. Tran, H. Pang, and R. H. Deng, \"Efficient verifiable computation of linear and quadratic functions over encrypted data,\" in ACM on Asia Conference on Computer and Communications Security (Asia CCS), 2016."},{"key":"e_1_3_2_1_117_1","volume-title":"Verifiable fully homomorphic encryption,\" arXiv preprint arXiv:2301.07041","author":"Viand A.","year":"2023","unstructured":"A. Viand, C. Knabenhans, and A. Hithnawi, \"Verifiable fully homomorphic encryption,\" arXiv preprint arXiv:2301.07041, 2023."},{"key":"e_1_3_2_1_118_1","volume-title":"Doubly-efficient zkSNARKs without trusted setup,\" in IEEE Symposium on Security and Privacy (S&P)","author":"Wahby R. S.","year":"2018","unstructured":"R. S. Wahby, I. Tzialla, A. Shelat, J. Thaler, and M. Walfish, \"Doubly-efficient zkSNARKs without trusted setup,\" in IEEE Symposium on Security and Privacy (S&P), 2018."},{"key":"e_1_3_2_1_119_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"e_1_3_2_1_120_1","volume-title":"Scalable anonymous group communication in the anytrust model,\" in 5th European Workshop on System Security","author":"Wolinsky D. I.","year":"2012","unstructured":"D. I. Wolinsky, H. Corrigan-Gibbs, B. Ford, and A. Johnson, \"Scalable anonymous group communication in the anytrust model,\" in 5th European Workshop on System Security, 2012."},{"key":"e_1_3_2_1_121_1","author":"Xu G.","year":"2022","unstructured":"G. Xu, X. Han, S. Xu, T. Zhang, H. Li, X. Huang, and R. H. Deng, \"Hercules: Boosting the performance of privacy-preserving federated learning,\" IEEE Transactions on Dependable and Secure Computing, 2022.","journal-title":"\"Hercules: Boosting the performance of privacy-preserving federated learning,\" IEEE Transactions on Dependable and Secure Computing"},{"key":"e_1_3_2_1_122_1","volume-title":"Secure decentralized image classifica-tion with multiparty homomorphic encryption,\" IEEE Transactions on Circuits and Systems for Video Technology","author":"Xu G.","year":"2023","unstructured":"G. Xu, G. Li, S. Guo, T. Zhang, and H. Li, \"Secure decentralized image classifica-tion with multiparty homomorphic encryption,\" IEEE Transactions on Circuits and Systems for Video Technology, 2023."},{"key":"e_1_3_2_1_123_1","volume-title":"Yang et al., \"TrustGWAS: A full-process workflow for encrypted GWAS using multi-key homomorphic encryption and pseudorandom number perturbation,\" Cell Systems","author":"Yang M.","year":"2022","unstructured":"M. Yang, C. Zhang, X. Wang, X. Liu, S. Li, J. Huang, Z. Feng, X. Sun, F. Chen, S. Yang et al., \"TrustGWAS: A full-process workflow for encrypted GWAS using multi-key homomorphic encryption and pseudorandom number perturbation,\" Cell Systems, 2022."},{"key":"e_1_3_2_1_124_1","volume-title":"Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications,\" in Advances in Cryptology - CRYPTO","author":"Yang R.","year":"2019","unstructured":"R. Yang, M. H. Au, Z. Zhang, Q. Xu, Z. Yu, and W. Whyte, \"Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications,\" in Advances in Cryptology - CRYPTO, 2019."},{"key":"e_1_3_2_1_125_1","volume-title":"Multi-key homomorphic proxy re-encryption,\" in International Conference on Information Security","author":"Yasuda S.","year":"2018","unstructured":"S. Yasuda, Y. Koseki, R. Hiromasa, and Y. Kawai, \"Multi-key homomorphic proxy re-encryption,\" in International Conference on Information Security, 2018."},{"key":"e_1_3_2_1_126_1","volume-title":"An examination of multi-key fully homomorphic encryption and its applications,\" Mathematics","author":"Yuan M.","year":"2022","unstructured":"M. Yuan, D. Wang, F. Zhang, S. Wang, S. Ji, and Y. Ren, \"An examination of multi-key fully homomorphic encryption and its applications,\" Mathematics, 2022."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Copenhagen Denmark","acronym":"CCS '23"},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623139","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:46:50Z","timestamp":1755740810000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":126,"alternative-id":["10.1145\/3576915.3623139","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623139","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}