In the recent years, Fully Homomorphic Encryption (FHE) has gone from a theoretical idea to a practical privacy-preserving technology. The idea of FHE is to compute over encrypted data, without needing the decryption key. It extends the concept of end-to-end encryption to computing, so that data remains encrypted while transmitted, while stored and while processed.
FHE has many usecases, from machine learning to voting systems or analytics. In this meetup, we will go deep into FHE, from the theory (math heavy!) to the implementations (engineering heavy!) to the usecases (not as heavy!).
Send a message to firstname.lastname@example.org if you'd like to present something!