Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

ILA: Correctness via Type Checking for Fully Homomorphic Encryption

ACM SIGPLAN via YouTube

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about a research presentation from PriSC 2025 that introduces ILA, a correctness-oriented intermediate representation for type-checking fully homomorphic encryption (FHE) circuits. This 26-minute video features Tarakaram Gollamudi, Anitha Gollamudi, and Joshua Gancher presenting their work on addressing critical challenges in FHE implementation. Discover how their type system tracks quantitative bounds like ciphertext noise without requiring the secret key, proving a strong functional correctness criterion for FHE circuits. The presentation explains how ILA is designed to be scheme-agnostic while demonstrating its application with the BGV scheme. See how their implemented static type checker can detect noise overflows and optimally place modulus switching operations to reduce noise. The research shows promising results with sound detection of noise overflows and practical, tight noise estimates, making FHE application development less error-prone.

Syllabus

[PriSC'25] ILA: Correctness via Type Checking for Fully Homomorphic Encryption

Taught by

ACM SIGPLAN

Reviews

Start your review of ILA: Correctness via Type Checking for Fully Homomorphic Encryption

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.