Julen Bernabé-Rodríguez
Research Subjects
Julen Bernabé-Rodríguez has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Oscar Lage
TECNALIA, Basque Research and Technology Alliance (BRTA)
4 shared publications - Iñaki Seco-Aguirre
TECNALIA, Basque Research and Technology Alliance (BRTA)
3 shared publications - Eduardo Jacob
University of the Basque Country UPV/EHU
2 shared publications - Jasone Astorga
University of the Basque Country UPV/EHU
2 shared publications - Jon Hernández-Bueno
TECNALIA, Basque Research and Technology Alliance (BRTA)
2 shared publications - Aitor Brazaola-Vicario
TECNALIA, Basque Research and Technology Alliance
1 shared publication
Latest Publications
- Open Access
- 21 July 2026
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 6 (4) , 126
Homomorphic Encryption as an Enabler for Secure Multi-Source Data Aggregation and Confidential Analytics
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.
- 21 July 2026
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 6 (4) , 126
Open AccessHomomorphic Encryption as an Enabler for Secure Multi-Source Data Aggregation and Confidential Analytics
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.
- Open Access
- 21 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (11) , 1-27
Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems
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.
- 21 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (11) , 1-27
Open AccessSystematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems
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.
- Open Access
- 7 March 2026
- Published by Elsevier in Computer Networks
- Vol. 280
Privacy enhanced QKD networks: Zero trust relay architecture based on homomorphic encryption
- 7 March 2026
- Published by Elsevier in Computer Networks
- Vol. 280
Open AccessPrivacy enhanced QKD networks: Zero trust relay architecture based on homomorphic encryption
- 2 January 2026
- Published by Springer Nature
- p. 27-37
Enhancing Blockchain with Quantum-Safe Verification: A Quantum Fingerprinting Framework
- 2 January 2026
- Published by Springer Nature
- p. 27-37
Enhancing Blockchain with Quantum-Safe Verification: A Quantum Fingerprinting Framework
- 4 March 2025
- Published by Springer Nature
- p. 194-203
A True Random Number Generator for Blockchain Wallets Based on Quantum Computation
- 4 March 2025
- Published by Springer Nature
- p. 194-203
A True Random Number Generator for Blockchain Wallets Based on Quantum Computation
- Open Access
- 31 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 27 (2) , 1-29
A Decentralized Private Data Marketplace using Blockchain and Secure Multi-Party Computation
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.
- 31 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 27 (2) , 1-29
Open AccessA Decentralized Private Data Marketplace using Blockchain and Secure Multi-Party Computation
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.