Since its inception more than ten years ago, Fully Homomorphic Encryption has been the subject of a lot of research towards more efficiency and better practicality. From a security perspective, however, FHE still raises a number of questions and challenges, in particular due to the fact that all the FHE used in practice achieve only CPA-security (and all of these schemes are trivially CCA1 insecure). Over the last few years, very active research has been done to explore the security of FHE beyond that regime with new security notions, attacks and constructions emerging. In this talk, we will cover recent “slightly beyond CPA” security notions, such as CPAD, as well as new attacks on FHE in that model. We’ll then move on to CCA security for FHE and present recent results towards answering the two questions: can we build FHE schemes offering some degree of CCA security? And, what is the strongest degree of CCA-security achievable by FHE?
By Ray Perlner
By Edoardo Persichetti
By Joachim Rosenthal
By Mélissa Rossi
By Thomas Prest
By Javier Verbel
By David Jao
By Alexander May
By Luís Brandão
By Chris Peikert
By Thibauld Feneuil
By Federico Pintore
By Jean-François Biasse
By Thibaut Delcroix
By Thibaut Delcroix
By Lorena López-Hernanz
By Lorena López-Hernanz
By Lorena López-Hernanz
