34 citations · 170 across the 44 of their papers we have counts for
28 papers · 1 filter
Emergent Peer-to-Peer Multi-Hub Topology
Mohamed Amine Legheraba, Maria Potop-Butucaru, Sébastien Tixeuil +1
In this paper we propose and evaluate an innovative algorithm that enables the creation of Peer-to-Peer network overlays characterized by emergent multi-hubs. This approach generat…
Data Poisoning Attacks in Gossip Learning
Alexandre Pham, Maria Potop-Butucaru, Sébastien Tixeuil +1
Traditional machine learning systems were designed in a centralized manner. In such designs, the central entity maintains both the machine learning model and the data used to adjus…
On Fairness in Committee-based Blockchains
Yackolley Amoussou-Guenou, Antonella del Pozzo, Maria Potop-Butucaru +1
Committee-based blockchains are among the most popular alternatives of proof-of-work based blockchains, such as Bitcoin. They provide strong consistency (no fork) under classical a…
Rationals vs Byzantines in Consensus-based Blockchains
Yackolley Amoussou-Guenou, Bruno Biais, Maria Potop-Butucaru +1
In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to mod…
G-IOTA: Fair and confidence aware tangle
Gewu Bu, Önder Gürcan, Maria Potop-Butucaru
This paper proposes strategies to improve the IOTA tangle in terms of resilience to splitting attacks. Our contribution is two fold. First, we define the notion of confidence fairn…
Dissecting Tendermint
Yackolley Amoussou-Guenou, Antonella del Pozzo, Maria Potop-Butucaru +1
In this paper we analyze Tendermint proposed in [7], one of the most popular blockchains based on PBFT Consensus. The current paper dissects Tendermint under various system communi…
Correctness and Fairness of Tendermint-core Blockchains
Yackolley Amoussou-Guenou, Antonella Del Pozzo, Maria Potop-Butucaru +1
Tendermint-core blockchains (e.g. Cosmos) are considered today one of the most viable alternatives for the highly energy consuming proof-of-work blockchains such as Bitcoin and Eth…
Blockchain Abstract Data Type
Emmanuelle Anceaume, Antonella Del Pozzo, Romaric Ludinard +2
The presented work continues the line of recent distributed computing communityefforts dedicated to the theoretical aspects of blockchains. This paper is the rst tospecify blockcha…
Optimal Storage under Unsynchrononized Mobile Byzantine Faults
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru +1
In this paper we prove lower and matching upper bounds for the number of servers required to implement a regular shared register that tolerates unsynchronized Mobile Byzantine fail…
Parameterized Verification of Algorithms for Oblivious Robots on a Ring
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru +1
We study verification problems for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. In particular, we focus in this paper on the mode…
Optimal Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru +1
This paper proposes the first implementation of a self-stabilizing regular register emulated by servers that is tolerant to both mobile Byzantine agents, and \emph{transient fa…
Approximate Agreement under Mobile Byzantine Faults
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru +1
In this paper we address Approximate Agreement problem in the Mobile Byzantine faults model. Our contribution is threefold. First, we propose the the first mapping from the existin…
Tight Mobile Byzantine Tolerant Atomic Storage
Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru
This paper proposes the first implementation of an atomic storage tolerant to mobile Byzantine agents. Our implementation is designed for the round-based synchronous model where th…
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
Silvia Bonomi, Shlomi Dolev, Maria Potop-Butucaru +1
A stabilizing Byzantine single-writer single-reader (SWSR) regular register, which stabilizes after the first invoked write operation, is first presented. Then, new/old ordering in…
On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering
Laure Millet, Maria Potop-Butucaru, Nathalie Sznajder +1
RecentadvancesinDistributedComputinghighlightmodelsandalgo- rithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelm…
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme
Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru +1
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…
A framework for proving the self-organization of dynamic systems
Emmanuelle Anceaume, Xavier Défago, Maria Potop-Butucaru +1
This paper aims at providing a rigorous definition of self- organization, one of the most desired properties for dynamic systems (e.g., peer-to-peer systems, sensor networks, coope…
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru +1
Self-stabilizing systems have the ability to converge to a correct behavior when started in any configuration. Most of the work done so far in the self-stabilization area assumed e…
Fast Self-Stabilizing Minimum Spanning Tree Construction
Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru +1
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…
Universal Loop-Free Super-Stabilization
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis +1
We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to…
RoboCast: Asynchronous Communication in Robot Networks
Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru +1
This paper introduces the \emph{RoboCast} communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors an…
Self-Stabilizing Byzantine Asynchronous Unison
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikhail Nesterenko +1
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than st…
Byzantine Convergence in Robots Networks: The Price of Asynchrony
Zohir Bouzid, Maria Potop-Butucaru, Sébastien Tixeuil
We study the convergence problem in fully asynchronous, uni-dimensional robot networks that are prone to Byzantine (i.e. malicious) failures. In these settings, oblivious anonymous…
Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks
Zohir Bouzid, Maria Potop-Butucaru, Sébastien Tixeuil
We propose the first deterministic algorithm that tolerates up to byzantine faults in -sized networks and performs in the asynchronous CORDA model. Our solution matches t…