Visit to Munich, ๐ฉ๐ช
Visit to Munich, ๐ฉ๐ช
I Presented my paper โ๐ง๐ผ๐๐ฎ๐ฟ๐ฑ๐ ๐ฃ๐ฟ๐ถ๐๐ฎ๐ฐ๐ ๐ฎ๐ป๐ฑ ๐๐ป๐๐ฒ๐ด๐ฟ๐ถ๐๐: ๐ฆ๐ก๐๐ฅ๐-๐๐ฟ๐ถ๐๐ฒ๐ป ๐ฉ๐ฒ๐ฟ๐ถ๐ณ๐ถ๐ฎ๐ฏ๐น๐ฒ ๐๐๐ ๐ณ๐ผ๐ฟ ๐ข๐๐๐๐ผ๐๐ฟ๐ฐ๐ฒ๐ฑ ๐๐ผ๐บ๐ฝ๐๐๐ฎ๐๐ถ๐ผ๐ป,โ co-authored with Sahadeo Padhye, Rajeev Anand Sahu, and Dr. Vishal Saraswat, at ๐ฃ๐ฟ๐ถ๐๐๐ฟ๐๐ฝ๐ ๐ฎ๐ฌ๐ฎ๐ฑ, a co-located workshop of ๐๐๐ก๐ฆ ๐ฎ๐ฌ๐ฎ๐ฑ, to be held in Munich, Germany, from June 23โ26, 2025.
๐๐ฏ๐๐๐ฟ๐ฎ๐ฐ๐: Fully Homomorphic Encryption (FHE) enables secure computation on encrypted data, preserving confidentiality without requiring decryption. However, FHE alone cannot guarantee the integrity of results computed by potentially untrusted servers, necessitating mechanisms to verify correctness. Succinct Non-Interactive Arguments of Knowledge (SNARKs) have emerged as a powerful tool to address this challenge, enabling efficient verification of computations while maintaining data privacy. This paper provides a review of SNARK-based approaches for verifiable FHE, focusing on recent advancements in designing SNARK-friendly homomorphic schemes and the integration of homomorphic signatures and Message Authentication Codes (MACs), many of which leverage SNARKs for enhanced security.