Paper 2024/1937 Original: eprint.iacr.org/2024/1937 ↗
Asynchronous Byzantine Consensus with Trusted Monotonic Counters
Abstract
The paper promotes a new design paradigm for Byzantine tolerant distributed algorithms using trusted abstractions (oracles) specified in a functional manner. The contribution of the paper is conceptual. The objective here is to design distributed fundamental algorithms such as reliable broadcast and asynchronous byzantine consensus using trusted execution environments and to help designers to compare various solutions on a common ground. In this framework we revisit the Bracha's seminal work on Asynchronous Byzantine Consensus. Our solution uses trusted monotonic counters abstraction and tolerates $t$ Byzantine processes in a system with $n$ processes, $n \geq 2t+1$. The keystone of our construction is a novel and elegant Byzantine Reliable Broadcast algorithm resilient to $t<n$ Byzantine processes that uses an unique trusted monotonic counter (at the initiator).
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2024-11-29: last updated
- 2024-11-29: published
- Short URL
- https://ia.cr/2024/1937
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/1937,
author = {Yackolley Amoussou-Guenou and Maurice Herlihy and Maria Potop Butucaru},
title = {Asynchronous Byzantine Consensus with Trusted Monotonic Counters},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1937},
year = {2024},
url = {https://eprint.iacr.org/2024/1937}
}