Welcome to the resource topic for 2024/1937
Title:
Asynchronous Byzantine Consensus with Trusted Monotonic Counters
Authors: Yackolley Amoussou-Guenou, Maurice Herlihy, Maria Potop Butucaru
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).
ePrint: https://eprint.iacr.org/2024/1937
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .