Skip to content

Author

C. Bernardos

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

D-MUTRA: DLT-based MUTual Remote Attestation for Multi-Agent Systems

Multi-agent systems (MAS) comprise autonomous software agents that collaborate to perform complex tasks in critical cyber-physical domains, including multi-robot coordination and the Industrial Internet of Things (IIoT). In such distributed environments, a compromised agent may execute modified software while appearing trustworthy, causing other agents to act on false information and corrupting the mission. Agents must therefore establish and maintain mutual trust throughout operation. Remote attestation (RA) is a well-established technique for this purpose, enabling a remote verifier to assess the integrity of a potentially compromised prover device. However, conventional RA approaches face significant limitations in MAS: integrity guarantees are restricted to boot or application-load time, designs rely on centralized trusted verifiers or security hardware, and attestation records lack transparency and auditability. To address these limitations, this paper presents D-MUTRA, a blockchain-based framework that introduces a mutual RA protocol in which agents measure their runtime integrity while verifying that of their peers, acting as both prover and verifier. The framework operates entirely in software and relies on two components: a Security-as-a-Service that instruments agents with lightweight measurement and verification capabilities, and a smart contract that coordinates the attestation protocol in a decentralized and transparent manner. We implement a proof-of-concept on a private Ethereum blockchain using Hyperledger Besu and evaluate it in a swarm robotics scenario built with Robot Operating System (ROS) and the Gazebo simulator. Results show that D-MUTRA enables agents to continuously attest one another, detects malicious software modifications, and scales to large deployments with negligible overhead on protected applications.

Adam Zahir, V. Lefebvre, M. Angoustures et al. · 0 citations
Conference Jul 2026

Experimental Evaluation of DetNet PREOF Mechanisms on Programmable Data Planes

5G and 6G systems increasingly rely on ultra-lowlatency and highly reliable communications to support timecritical applications at the network edge. While deterministic communication has emerged as a key requirement in domains such as industrial automation, smart grids, and automotive systems, yet remains challenging over packet-switched networks. Determinism entails delivering packets either at precise time instants (in-time) or within strict bounded delays (on-time), imposing stringent constraints on latency, jitter, and reliability. The Deterministic Networking (DetNet) architecture, standardized by the IETF, seeks to provide such guarantees at Layer 3; however, fully open, end-to-end implementations of its core mechanisms are still lacking. The main contributions of the paper are: (1) a new opensource implementation of DetNet, (2) validation of its functionality, (3) experimental evaluation aimed at analyzing the benefits and challenges of the technology, and (4) all the aforementioned contributions developed in compliance with current standardization efforts. Our design leverages P4-programmable Tofino switches in combination with CPU-based packet processing using the DPDK to assess the feasibility and effectiveness of implementing DetNet PREOF mechanisms in programmable data planes (PDP). Results show near-zero packet loss below the MTU, and zero out-of-order delivery across all configurations, underscoring the value of programmable data planes for validating deterministic networking mechanisms.

Marta Blanco Caamaño, Luis M. Contreras, C. Bernardos · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.