Proof of Concept Prototype for Matching Applications on BELFORT Hardware

Informazioni relative al progetto

BELFORT MATCH

ID dell’accordo di sovvenzione: 101158183

DOI

10.3030/101158183

Progetto chiuso

Data della firma CE 15 Febbraio 2024

Data di avvio 1 Marzo 2024

Data di completamento 31 Agosto 2025

Finanziato da

• European Research Council (ERC)

Costo totale

Nessun dato

Contributo UE

€ 150 000,00

Coordinato da

KATHOLIEKE UNIVERSITEIT LEUVEN
Belgium

Periodic Reporting for period 1 - BELFORT MATCH (Proof of Concept Prototype for Matching Applications on BELFORT Hardware)

Periodo di rendicontazione: 2024-03-01 al 2025-08-31

Sintesi del contesto e degli obiettivi generali del progetto

The project fits into the context of designing and developing hardware to accelerate computations on encrypted data (COED). In this proof of concept we focus on the Fully Homomorphic Encryption (FHE) approach to COED. The ultimate goal is to make the operations on encrypted data efficient enough to perform them on the fly in a cloud setting. When a user formulates privacy-preserving encrypted queries to a server, it should be imperceptible to the user that the operations are occurring in the encrypted domain. Being able to answer a query on the fly without delay will make this goal happen.
With this POC application, we demonstrate our progress on the hardware acceleration of encrypted computation. The POC is used for two main efforts consisting of a technical part and an innovation support part. The goal of the technical part is to raise the Technology Readiness Level (TRL) of the BELFORT accelerator, integrate it into software libraries and develop an actual ‘match’ demonstrator. The innovation support part will focus on making the project business ready.

Lavoro eseguito dall’inizio del progetto fino alla fine del periodo coperto dalla relazione e principali risultati finora ottenuti

On the technical and scientific aspects, the proof of concept has one major main achievement. Within the ERC POC, a public demonstrator for encrypted string matching calculations, which we call Leuvenshtein, was developed. Edit distance computations are essential in applications across finance and genomics, such as DNA sequence alignment. The public demonstrator runs on the FPGA hardware platforms developed within the ERC Grant Belfort, achieving a 278x speedup. The demonstrator has high potential to attract business partners for use-cases across finance and genomics. It has been open-sourced in a public repository under an MIT license. The demonstrator has also been published at Usenix Security 2025, an A* conference on security and privacy.

Progressi oltre lo stato dell’arte e potenziale impatto previsto (incluso l’impatto socioeconomico e le implicazioni sociali più ampie del progetto fino ad ora)

Through the participation at key industry events, the POC provided also market insights for computing on encrypted data. Based on the results of the ERC grant Belfort, the spin-off company BelfortLabs has been created. Besides the development of the demonstrator, the Proof of concept grant was used to understand the market and to prepare for investor seed funding. Moreover, the proof of concept provides for an entrance ticket for a follow-up proposal for an EIT Transition grant.