{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:49:35Z","timestamp":1780634975332,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":28,"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.3624403","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"3525-3527","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Poster: Verifiable Encodings for Maliciously-Secure Homomorphic Encryption Evaluation"],"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"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4645-7295","authenticated-orcid":false,"given":"Christian","family":"Knabenhans","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5641-6270","authenticated-orcid":false,"given":"Apostolos","family":"Pyrgelis","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2374-2248","authenticated-orcid":false,"given":"Carmela","family":"Troncoso","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1533-6132","authenticated-orcid":false,"given":"Jean-Pierre","family":"Hubaux","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Blind backdoors in deep learning models,\" in Usenix Security","author":"Bagdasaryan E.","year":"2021","unstructured":"E. Bagdasaryan and V. Shmatikov, \"Blind backdoors in deep learning models,\" in Usenix Security, 2021."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-"},{"key":"e_1_3_2_1_5_1","first-page":"315","volume-title":"IEEE","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). IEEE, 2018, pp. 315--334."},{"key":"e_1_3_2_1_6_1","first-page":"336","volume-title":"Practical homomorphic macs for arithmetic circuits,\" in Advances in Cryptology - EUROCRYPT","author":"Catalano D.","year":"2013","unstructured":"D. Catalano and D. Fiore, \"Practical homomorphic macs for arithmetic circuits,\" in Advances in Cryptology - EUROCRYPT, 2013, pp. 336--352. [Online]. Available: https:\/\/eprint.iacr.org\/2015\/194"},{"key":"e_1_3_2_1_7_1","unstructured":"S. Chatel C. Knabenhans A. Pyrgelis C. Troncoso and J.-P. Hubaux \"Verifiable encodings for secure homomorphic analytics \" arXiv preprint arXiv:2207.14071 2023."},{"key":"e_1_3_2_1_8_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 \" Cryptology ePrint Archive 2023.","DOI":"10.1145\/3576915.3623139"},{"key":"e_1_3_2_1_9_1","first-page":"395","volume-title":"Efficient multi-key homomorphic en- cryption 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 en- cryption with packed ciphertexts with application to oblivious neural network inference,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS), 2019, pp. 395--412."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-018-0397-z"},{"key":"e_1_3_2_1_11_1","first-page":"597","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). Springer, 2017, pp. 597--627. [Online]. Available: https:\/\/eprint.iacr.org\/2017\/923"},{"key":"e_1_3_2_1_12_1","first-page":"239","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. Springer, 2014, pp. 239--258. [Online]. Available: https:\/\/ia.cr\/2014\/535"},{"key":"e_1_3_2_1_13_1","first-page":"53","volume-title":"Privacy-preserving computations of predictive medical models with minimax approximation and non-adjacent form,\" in Financial Cryptography and Data Security (FC)","author":"Cheon J. H.","year":"2017","unstructured":"J. H. Cheon, J. Jeong, J. Lee, and K. Lee, \"Privacy-preserving computations of predictive medical models with minimax approximation and non-adjacent form,\" in Financial Cryptography and Data Security (FC). Springer, 2017, pp. 53--74."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_26."},{"key":"e_1_3_2_1_15_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, https:\/\/eprint.iacr.org\/2012\/144."},{"key":"e_1_3_2_1_16_1","first-page":"844","volume-title":"Efficiently verifiable computation on encrypted 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 encrypted data,\" in ACM SIGSAC Conference on Computer and Communications Security (CCS), 2014, pp. 844--855, https:\/\/dl.acm.org\/doi\/10.1145\/2660267.2660366.Available: https:\/\/eprint.iacr.org\/2014\/202."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"e_1_3_2_1_18_1","unstructured":"C. Ganesh A. Nitulescu and E. Soria-Vazquez \"Rinocchio: Snarks for ring arith- metic \" Cryptology ePrint Archive Report 2021\/322 2021 https:\/\/ia.cr\/2021\/322."},{"key":"e_1_3_2_1_19_1","first-page":"465","volume-title":"Non-interactive verifiable computing: Outsourcing computation to untrusted workers,\" in Advances in Cryptology - CRYPTO","author":"Gennaro R.","year":"2010","unstructured":"R. Gennaro, C. Gentry, and B. Parno, \"Non-interactive verifiable computing: Outsourcing computation to untrusted workers,\" in Advances in Cryptology - CRYPTO. Springer, 2010, pp. 465--482."},{"key":"e_1_3_2_1_20_1","first-page":"301","volume-title":"Fully homomorphic message authenticators,\" in Advances in Cryptology-ASIACRYPT","author":"Gennaro R.","year":"2013","unstructured":"R. Gennaro and D. Wichs, \"Fully homomorphic message authenticators,\" in Advances in Cryptology-ASIACRYPT. Springer, 2013, pp. 301--320."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12612-4_5.Available:"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_21"},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"Private genome analysis through homomorphic encryption,\" in BMC medical informatics and decision making","author":"Kim M.","year":"2015","unstructured":"M. Kim and K. Lauter, \"Private genome analysis through homomorphic encryption,\" in BMC medical informatics and decision making. BioMed Central, 2015, pp. 1--12.","journal-title":"BioMed Central"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0071"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_27_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_28_1","volume-title":"Verifiable fully homomorphic en- cryption,\" arXiv preprint arXiv:2301.07041","author":"Viand A.","year":"2023","unstructured":"A. Viand, C. Knabenhans, and A. Hithnawi, \"Verifiable fully homomorphic en- cryption,\" arXiv preprint arXiv:2301.07041, 2023"}],"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 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3624403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3624403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:56:47Z","timestamp":1755741407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3624403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":28,"alternative-id":["10.1145\/3576915.3624403","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3624403","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"}}]}}