CODEFHE: Fully-Homomorphic Encryption from Post-Quantum Code-Based Assumptions

Project funded by Fundação para a Ciência e a Tecnologia, I.P. (FCT) (Concurso de Projetos Exploratórios no âmbito do Programa CMU Portugal 2024), grant 2024.12595.CMU. Funded amount: EUR 67,256.50, as stated by the source. Runs 2025-10-01 to 2026-09-30. Keywords: Private delegated computation, Post-quantum cryptography, Error-correcting codes, Fully-homomorphic encryption, Exact sciences. Source: OpenAIRE Graph, from the funder's project data (collected by OpenAIRE on 2025-10-25); national funding data, not CORDIS. Abstract given by the source: Modern cryptography has been a remarkable success story connecting mathematics and high practical impact. It has managed to establish mind-bending cryptographic functionalities with practically efficient implementations and whose security is rigorously based on well-studied computational hardness assumptions. 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. Efficient and secure FHE protocols are revolutionary algorithms for a private Internet and for private computation on massive data. In principle, they would permit, among a multitude of other applications, privacy-preserving machine learning on massive datasets, private web search, and private genome-sequencing algorithms. Due to the advent of scalable quantum computing, it is important to rigorously found the security of advanced cryptographic algorithms on computational hardness assumptions that are believed not to be broken by quantum computers – so-called post-quantum cryptography. For example, the foundation of the security of cryptographic algorithms on post-quantum computational hardness assumptions has been identified as a key near-term goal by the US National Institute of Standards and Technology (NIST) [20]. 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. Notably, the breakthrough initial part of this line of work led to the award of the 2022 Gödel Prize [8, 9, 16]. The overarching goal of this project is to develop (from theoretical conception to practical implementation) and thoroughly evaluate efficient FHE protocols whose security [shortened; the full text is on the OpenAIRE page]

Original source.

Source: OpenAIRE Graph: projects of national funders, OpenAIRE, from the project data of Fundação para a Ciência e a Tecnologia, I.P. (FCT). Retrieved 2026-10-22. Licence: Creative Commons Attribution 4.0 (OpenAIRE Graph). Selected metadata, adapted presentation; the publisher's record is authoritative. No endorsement by the source is implied. Licence: Creative Commons Attribution 4.0 (CC BY 4.0).

AI-assisted summary: The CODEFHE project, funded by Fundação para a Ciência e a Tecnologia, focuses on Fully-Homomorphic Encryption based on post-quantum code-based assumptions, with a budget of EUR 67,256.50, running from 2025-10-01 to 2026-09-30. Suggested technology pillar: communication. Generated by AI from the public source text; it may contain errors and the original source is authoritative.