{"id":"https://openalex.org/W4416549058","doi":"https://doi.org/10.1145/3719027.3765068","title":"ILA: Correctness via Type Checking for Fully Homomorphic Encryption","display_name":"ILA: Correctness via Type Checking for Fully Homomorphic Encryption","publication_year":2025,"publication_date":"2025-11-19","ids":{"openalex":"https://openalex.org/W4416549058","doi":"https://doi.org/10.1145/3719027.3765068"},"language":null,"primary_location":{"id":"doi:10.1145/3719027.3765068","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3719027.3765068","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3719027.3765068","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3719027.3765068","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119958970","display_name":"Tarakaram Gollamudi","orcid":"https://orcid.org/0000-0002-7035-2218"},"institutions":[{"id":"https://openalex.org/I4210164339","display_name":"Oldham Council","ror":"https://ror.org/05cxzzq07","country_code":"GB","type":"government","lineage":["https://openalex.org/I4210164339"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Tarakaram Gollamudi","raw_affiliation_strings":["Independent Researcher, Lexington, USA"],"affiliations":[{"raw_affiliation_string":"Independent Researcher, Lexington, USA","institution_ids":["https://openalex.org/I4210164339"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047325283","display_name":"Anitha Gollamudi","orcid":"https://orcid.org/0000-0002-0861-1418"},"institutions":[{"id":"https://openalex.org/I133738476","display_name":"University of Massachusetts Lowell","ror":"https://ror.org/03hamhx47","country_code":"US","type":"education","lineage":["https://openalex.org/I133738476"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anitha Gollamudi","raw_affiliation_strings":["University of Massachusetts, Lowell (UML), Lowell, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Lowell (UML), Lowell, USA","institution_ids":["https://openalex.org/I133738476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043190101","display_name":"Joshua Gancher","orcid":"https://orcid.org/0000-0003-2257-7073"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Gancher","raw_affiliation_strings":["Northeastern University, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5119958970"],"corresponding_institution_ids":["https://openalex.org/I4210164339"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18849668,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1454","last_page":"1468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9128000140190125,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9128000140190125,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10951","display_name":"Cryptographic Implementations and Security","score":0.04470000043511391,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.014399999752640724,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.8313000202178955},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7364000082015991},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5608999729156494},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5063999891281128},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.49459999799728394},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.3589000105857849}],"concepts":[{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.8313000202178955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.76910001039505},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7364000082015991},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5608999729156494},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5063999891281128},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4172999858856201},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35260000824928284},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29660001397132874},{"id":"https://openalex.org/C40305131","wikidata":"https://www.wikidata.org/wiki/Q2616305","display_name":"Obfuscation","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.26330000162124634}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3719027.3765068","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3719027.3765068","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3719027.3765068","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3719027.3765068","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3719027.3765068","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3719027.3765068","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1262244419","display_name":null,"funder_award_id":"2348304, 2224279","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3563566845","display_name":"CRII: SaTC: Enforcing Expressive Security Policies using Trusted Execution Environments","funder_award_id":"2348304","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7583421647","display_name":"SaTC: CORE: Small: Automating the End-to-End Verification of Security Protocol Implementations","funder_award_id":"2224279","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416549058.pdf","grobid_xml":"https://content.openalex.org/works/W4416549058.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W236632755","https://openalex.org/W2152926062","https://openalex.org/W2397066487","https://openalex.org/W2768174108","https://openalex.org/W2890611886","https://openalex.org/W3033405216","https://openalex.org/W3155680838","https://openalex.org/W3207326900","https://openalex.org/W4307823778","https://openalex.org/W4327930441","https://openalex.org/W4399851001","https://openalex.org/W4400378670"],"related_works":[],"abstract_inverted_index":{"RLWE-based":[0],"Fully":[1],"Homomorphic":[2],"Encryption":[3],"(FHE)":[4],"schemes":[5],"add":[6],"some":[7],"small":[8],"noise":[9,16,24,49],"to":[10,50,61,95],"the":[11,23,29,48,64],"message":[12],"during":[13],"encryption.":[14],"The":[15],"accumulates":[17],"with":[18,97],"each":[19],"homomorphic":[20],"operation.":[21],"When":[22],"exceeds":[25],"a":[26],"critical":[27],"value,":[28],"FHE":[30,39,67,91],"circuit":[31],"produces":[32],"an":[33],"incorrect":[34],"output.":[35],"This":[36],"makes":[37],"developing":[38],"applications":[40,92],"quite":[41],"subtle,":[42],"as":[43],"one":[44],"must":[45],"closely":[46],"track":[47,63],"ensure":[51],"correctness.":[52],"However,":[53],"existing":[54,86],"libraries":[55,89],"and":[56,88],"compilers":[57,87],"offer":[58],"limited":[59],"support":[60],"statically":[62],"noise.":[65],"Additionally,":[66],"circuits":[68],"are":[69,76],"also":[70],"plagued":[71],"by":[72],"wraparound":[73],"errors":[74],"that":[75],"common":[77],"in":[78],"finite":[79],"modulus":[80],"arithmetic.":[81],"These":[82],"two":[83],"limitations":[84],"of":[85],"make":[90],"too":[93],"difficult":[94],"develop":[96],"confidence.":[98]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-11-23T00:00:00"}