PhD talks – February 10th, 2025 at 16:00 – Sala seminari U14
Lorenzo RovidaHomomorphic Encryption from the Lattice Isomorphism Problem Abstract:Homomorphic encryption (HE) is a strong cryptographic primitive that enables computations on encrypted data.Currently, the security of most HE schemes is based on the hardness of the Learning with Errors (LWE) problem.