Julen Bernabé-Rodríguez

Mr. Julen Bernabé-Rodríguez

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2024 in ACM Transactions on Privacy and Security
Verified
Journal Article
Open access
JBJulen Bernabé-Rodríguez
Julen Bernabé-Rodríguez
AGAlbert Garreta
Albert Garreta
OLOscar Lage
Oscar Lage
Big data has proven to be a very useful tool for companies and users, but companies with larger datasets have ended being more competitive than the others thanks to machine learning or artificial intelligence. Secure multi-party computation (SMPC) allows the smaller companies to jointly train arbitrary models on their private data while assuring privacy, and thus gives data owners the ability to perform what are currently known as federated learning algorithms. Besides, with a blockchain it is possible to coordinate and audit those computations in a decentralized way. In this document, we consider a private data marketplace as a space where researchers and data owners meet to agree the use of private data for statistics or more complex model trainings. This document presents a candidate architecure for a private data marketplace by combining SMPC and a public, general-purpose blockchain. Such a marketplace is proposed as a smart contract deployed in the blockchain, while the privacy preserving computation is held by SMPC.

7 March 2026 in Computer Networks
Verified
Journal Article
Open access
ABAitor Brazaola-Vicario
Aitor Brazaola-Vicario
OLOscar Lage
Oscar Lage
JBJulen Bernabé-Rodríguez
Julen Bernabé-Rodríguez
Eduardo JacobEduardo Jacob
Eduardo Jacob
Jasone AstorgaJasone Astorga
Jasone Astorga

2 January 2026
Verified
Book Chapter
Closed access
PDF file
JHJon Hernández-Bueno
Jon Hernández-Bueno
OLOscar Lage
Oscar Lage
MHMarivi Higuero
Marivi Higuero
IAIñaki Seco Aguirre
Iñaki Seco Aguirre
JBJulen Bernabé-Rodríguez
Julen Bernabé-Rodríguez

21 April 2026 in ACM Computing Surveys
Verified
Journal Article
Open access
JBJulen Bernabé-Rodríguez
Julen Bernabé-Rodríguez
OLOscar Lage
Oscar Lage
Jasone AstorgaJasone Astorga
Jasone Astorga
Eduardo JacobEduardo Jacob
Eduardo Jacob
Fully Homomorphic Encryption (FHE) enables arbitrary computations on encrypted data but lacks mechanisms to ensure the integrity of those computations. In particular, verifying that algorithm inputs are correct or that the intended algorithm was indeed executed remains an open challenge. This article addresses the issue by making two key contributions. First, we perform a comprehensive analysis of integrity faults in FHE, culminating in the definition of verifiable FHE as a novel concept to tackle these concerns. Second, we present a systematic review of existing approaches aimed at providing verifiable FHE, assessing their strengths and weaknesses, as well as their applicability in practical settings. Our findings reveal that, despite promising advances, significant gaps persist in both the theoretical foundations and the practical deployment of verifiable FHE. We conclude by outlining future research directions necessary to achieve verifiable FHE computations.

4 March 2025
Verified
Book Chapter
Closed access
PDF file
JHJon Hernández-Bueno
Jon Hernández-Bueno
JBJulen Bernabé-Rodríguez
Julen Bernabé-Rodríguez
IAIñaki Seco Aguirre
Iñaki Seco Aguirre
LLLeire Legarreta
Leire Legarreta

Verified
Journal Article
Open access
PDF file
CRCristina Regueiro
Cristina Regueiro
JBJulen Bernabé-Rodríguez
Julen Bernabé-Rodríguez
IAIñaki Seco Aguirre
Iñaki Seco Aguirre
IUIdoia Gamiz Ugarte
Idoia Gamiz Ugarte
Homomorphic Encryption plays a key role in secure multi-source data aggregation because it enables computations to be performed directly over encrypted data, allowing distributed parties to contribute sensitive information while preserving confidentiality. However, its use in this context introduces three main challenges: existing approaches often focus on specific operations rather than supporting diverse analytics across multiple encrypted data sources; key generation and management frequently rely on trusted third parties or require private keys to be shared; and TEE-based solutions may avoid trusted third parties but often require computations to be partially executed inside the trusted environment, thereby limiting deployment flexibility. To address these limitations, this work makes three main contributions: (i) the proposal of a complete framework for secure multi-source data aggregation that leverages homomorphic encryption and enables any data consumer to securely run multi-source data aggregations over data previously registered by untrusted data providers; (ii) the integration of secure enclaves for the secure generation, distribution, and management of homomorphic keys, addressing challenges related to coordinated key synchronization in multi-party aggregation environments and removing the need for a trusted third party; and (iii) the introduction of a hybrid key management protocol that combines secure enclave-based key generation with efficient key distribution and secure aggregation outside the enclave, in the data consumer, minimizing trust assumptions and computational overhead. The implementation and evaluation on small-scale aggregated datasets show that the proposed approach effectively addresses the identified challenges by providing, to the best of the authors’ knowledge, the first practical and privacy-preserving solution that supports different algorithms without relying on any trusted third party, while improving over existing solutions through the integration of secure enclaves and a hybrid key management protocol.