CODEFHE
Full Title
Fully-Homomorphic Encryption from Post-Quantum Code-Based AssumptionsDescription
Modern cryptography has been a remarkable success story connecting mathematics and high practical impact. One of the crown jewels of modern cryptography is Fully-Homomorphic Encryption (FHE) – an advanced form of cryptography which allows a client to delegate any sort of expensive computation on their data to an untrusted server, while guaranteeing that this server does not learn any information about the client’s data in the process. Currently, the only known constructions of FHE protocols with post-quantum security are based on the conjectured hardness of the Learning With Errors (LWE) problem, which is intimately connected to computational problems on point lattices. The overarching goal of this project is to develop (from theoretical conception to practical implementation) and thoroughly evaluate efficient FHE protocols whose security is rigorously based on the hardness of computational problems on linear error-correcting codes, which are believed to be post-quantum secure.