Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Albouy, Timothé"'
Autor:
Albouy, Timothé, Anceaume, Emmanuelle, Frey, Davide, Gestin, Mathieu, Rauch, Arthur, Raynal, Michel, Taïani, François
This article introduces a new asynchronous Byzantine-tolerant asset transfer system (cryptocurrency) with three noteworthy properties: quasi-anonymity, lightness, and consensus-freedom. Quasi-anonymity means no information is leaked regarding the rec
Externí odkaz:
http://arxiv.org/abs/2405.18072
Autor:
Albouy, Timothé, Anta, Antonio Fernández, Georgiou, Chryssis, Gestin, Mathieu, Nicolaou, Nicolas, Wang, Junlang
In this work, we introduce a modular framework for specifying distributed systems that we call AMECOS. Specifically, our framework departs from the traditional use of sequential specification, which presents limitations both on the specification expr
Externí odkaz:
http://arxiv.org/abs/2405.10057
Autor:
Albouy, Timothé, Frey, Davide, Gelles, Ran, Hazay, Carmit, Raynal, Michel, Schiller, Elad Michael, Taiani, Francois, Zikas, Vassilis
We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary that can drop some of the messages sent by correct (non-faulty) nodes.
Externí odkaz:
http://arxiv.org/abs/2312.16253
Reliable broadcast and consensus are the two pillars that support a lot of non-trivial fault-tolerant distributed middleware and fault-tolerant distributed systems. While they have close definitions, they strongly differ in the underlying assumptions
Externí odkaz:
http://arxiv.org/abs/2311.08776
This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical distri
Externí odkaz:
http://arxiv.org/abs/2303.05152
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message m b
Externí odkaz:
http://arxiv.org/abs/2205.09992
This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous $n$-process message-passing system in which
Externí odkaz:
http://arxiv.org/abs/2204.13388
Publikováno v:
In Theoretical Computer Science 2 November 2023 978
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
OPODIS 2022-26th Conference on Principles of Distributed Systems
OPODIS 2022-26th Conference on Principles of Distributed Systems, Dec 2022, Brussels, Belgium. pp.1-44
OPODIS 2022-26th Conference on Principles of Distributed Systems, Dec 2022, Brussels, Belgium. pp.1-44
This paper explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous n-process message-passing system in which u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30d8621d3c2885c3775a7f9b270e1d06