Publication

Abstractions for asynchronous distributed computing with malicious players

Publications associées (188)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Never Say Never Probabilistic & Temporal Failure Detectors

Rachid Guerraoui, David Kozhaya

The failure detector approach for solving distributed computing problems has been celebrated for its modularity. This approach allows the construction of algorithms using abstract failure detection mechanisms, defined by axiomatic properties, as building b ...

Ieee2016

Distributed Planar Manipulation in Fluidic Environments

Guillaume Adrien Sartoretti

We present a distributed control mechanism allowing a swarm of non-holonomic autonomous surface vehicles (ASVs) to synchronously arrange around a rectangular floating object in a grasping formation; the swarm is then able to collaboratively transport the o ...

Ieee2016

Scalable Monitoring of Interconnected Stochastic Systems

Giancarlo Ferrari Trecate, Marcello Farina

In this paper, we propose a novel distributed fault detection method to monitor the state of a linear system, partitioned into interconnected subsystems. The approach hinges on the definition of a partition-based distributed Luenberger estimator, based on ...

2016

Capacity and Data Complexity in Multidimensional Linear Attack

Serge Vaudenay, Jialin Huang

Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...

Springer2015

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Cheng Wang

Given a system with

n > 3t + 1

processes, where

t

is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in

O(t)

expected running time. This improves the

O(n^2)

expected running ...

2015

Beyond One Third Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Cheng Wang

The Byzantine agreement problem requires a set of

n

processes to agree on a value sent by a transmitter, despite a subset of

b

processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It ...

2015

Byzantine Fireflies

Rachid Guerraoui, Alexandre David Olivier Maurer

This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We a ...

Springer Berlin Heidelberg2015

Byzantine Fireflies

Rachid Guerraoui, Alexandre David Olivier Maurer

2015

A Plug-and-Play fault diagnosis approach for large-scale systems

Giancarlo Ferrari Trecate

This paper proposes a novel Plug-and-Play (PnP) dynamic approach for the monitoring of Large-Scale Systems (LSSs). The proposed architecture exploits a distributed Fault Detection and Isolation (FDI) methodology for nonlinear LSS in a PnP framework. The LS ...

2015

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client's request if "something goes ...

Association for Computing Machinery2015