Reliable Communication in Hybrid Authentication and Trust Models

Conference Paper (2025)
Author(s)

Rowdy Chotkan (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Bart Cox (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Vincent Rahli (University of Birmingham)

Jérémie Decouchant (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Data-Intensive Systems
DOI related publication
https://doi.org/10.4230/LIPIcs.OPODIS.2024.25 Final published version
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Data-Intensive Systems
Article number
25
ISBN (electronic)
978-3-95977-360-7
Event
28th International Conference on Principles of Distributed Systems, OPODIS 2024 (2024-12-11 - 2024-12-13), Lucca, Italy
Downloads counter
174
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Reliable communication is a fundamental distributed communication abstraction that allows any two nodes within a network to communicate with each other. It is necessary for more powerful communication primitives, such as broadcast and consensus. Using different authentication models, two classical protocols implement reliable communication in unknown and sufficiently connected networks. In the former, network links are authenticated, and processes rely on dissemination paths to authenticate messages. In the latter, processes generate digital signatures that are flooded throughout the network. This work considers the hybrid system model that combines authenticated links and authenticated processes. Additionally, we aim to leverage the possible presence of trusted nodes (e.g., network gateways) and trusted components (e.g., Intel SGX enclaves). We first extend the two classical reliable communication protocols to leverage trusted nodes. Then we propose DualRC, our most generic algorithm that considers the hybrid authentication model by manipulating dissemination paths and digital signatures, and leverages the possible presence of trusted nodes and trusted components. We describe and prove methods that establish whether our algorithms implement reliable communication on a given network.