{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:27:18Z","timestamp":1766442438296,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"content-version":"vor","delay-in-days":3,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2348304, 2224279"],"award-info":[{"award-number":["2348304, 2224279"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765068","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:37:25Z","timestamp":1763854645000},"page":"1454-1468","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ILA: Correctness via Type Checking for Fully Homomorphic Encryption"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7035-2218","authenticated-orcid":false,"given":"Tarakaram","family":"Gollamudi","sequence":"first","affiliation":[{"name":"Independent Researcher, Lexington, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0861-1418","authenticated-orcid":false,"given":"Anitha","family":"Gollamudi","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Lowell (UML), Lowell, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2257-7073","authenticated-orcid":false,"given":"Joshua","family":"Gancher","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Private Information Retrieval. URL https:\/\/swiftpackageindex.com\/apple\/swifthomomorphic-encryption\/1.0.4\/documentation\/privateinformationretrieval\/parametertuning."},{"key":"e_1_3_2_1_2_1","unstructured":"Noise growth in ciphertext-plaintext multiplication. URL https:\/\/openfhe.discourse.group\/t\/multiplication-depth-in-bfv\/487\/7."},{"key":"e_1_3_2_1_3_1","unstructured":"Coefficient modulus bit count in microsoft seal. URL https:\/\/github.com\/microsoft\/SEAL\/issues\/232#issuecomment-711103657."},{"key":"e_1_3_2_1_4_1","volume-title":"August","author":"Lattigo","year":"2024","unstructured":"Lattigo v6. Online: https:\/\/github.com\/tuneinsight\/lattigo, August 2024. EPFLLDS, Tune Insight SA."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560827.3563379"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--40186--3_15"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_8_1","volume-title":"Paper 2017\/299","author":"Chen Hao","year":"2017","unstructured":"Hao Chen, Kim Laine, and Peter Rindal. Fast private set intersection from homomorphic encryption. Cryptology ePrint Archive, Paper 2017\/299, 2017. URL https:\/\/eprint.iacr.org\/2017\/299."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_1_10_1","volume-title":"Nektarios Georgios Tsoutsos, and Michail Maniatakos. E3: A framework for compiling c programs with encrypted operands. Cryptology ePrint Archive","author":"Chielle Eduardo","year":"2018","unstructured":"Eduardo Chielle, Oleg Mazonka, Homer Gamil, Nektarios Georgios Tsoutsos, and Michail Maniatakos. E3: A framework for compiling c programs with encrypted operands. Cryptology ePrint Archive, 2018."},{"key":"e_1_3_2_1_11_1","volume-title":"Paper 2018\/421","author":"Chillotti Ilaria","year":"2018","unstructured":"Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. TFHE: Fast fully homomorphic encryption over the torus. Cryptology ePrint Archive, Paper 2018\/421, 2018. URL https:\/\/eprint.iacr.org\/2018\/421."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_19"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--59013-0_27"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243828"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386023"},{"key":"e_1_3_2_1_16_1","volume-title":"Ila: Correctness via type checking for fully homomorphic encryption","author":"Gollamudi Tarakaram","year":"2025","unstructured":"Tarakaram Gollamudi, Anitha Gollamudi, and Joshua Gancher. Ila: Correctness via type checking for fully homomorphic encryption, 2025. URL https:\/\/arxiv.org\/abs\/2509.11559."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"e_1_3_2_1_18_1","volume-title":"Optimisations of fully homomorphic encryption","author":"Iliashenko Ilia","year":"2019","unstructured":"Ilia Iliashenko. Optimisations of fully homomorphic encryption. 2019."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3656382"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--77870--5_23"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582057"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480070"},{"key":"e_1_3_2_1_23_1","volume-title":"January","author":"SEAL.","year":"2023","unstructured":"SEAL. Microsoft SEAL (release 4.1). https:\/\/github.com\/Microsoft\/SEAL, January 2023. Microsoft Research, Redmond, WA."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00068"},{"volume-title":"TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data","year":"2022","key":"e_1_3_2_1_25_1","unstructured":"Zama. TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data, 2022. https:\/\/github.com\/zamaai\/tfhe-rs."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3676955"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"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.3765068","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3765068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:24:16Z","timestamp":1766442256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":26,"alternative-id":["10.1145\/3719027.3765068","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765068","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"}}]}}