Recherche

Afficher tous les résultats pour

Accueil

Publication

Leaderless consensus

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (34)

Page 2 sur 2

Cooperative energy management of a community of smart-buildings: A Blockchain approach

Maher Kayal, Olivier Valentin Henri Van Cutsem

Demand Response (DR) is progressively moving from a centralized, unidirectional structure to a set of advanced decentralized mechanisms that better balance distributed supply and demand. This paper presents a decentralized cooperative DR framework to manag ...

ELSEVIER SCI LTD2020

ADAGRAD Avoids Saddle Points

Kimon Antonakopoulos

Adaptive first-order methods in optimization are prominent in machine learning and data science owing to their ability to automatically adapt to the landscape of the function being optimized. However, their convergence guarantees are typically stated in te ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Time in cryptography

Gwangbae Choi

Time travel has always been a fascinating topic in literature and physics. In cryptography, one may wonder how to keep data confidential for some time. In this dissertation, we will study how to make private information travel to the future. This dissertat ...

EPFL2020

Using an antenna as a tool for studying microturbulence and zonal structures in tokamaks with a global gyrokinetic GPU-enabled particle-in-cell code

Noé Thomas Elie Ohana

In order to get a better understanding of the interaction of plasma microinstabilities and associated turbulence with specific modes, an antenna is implemented in the global gyrokinetic Particle-In-Cell (PIC) code ORB5. It consists in applying an external ...

EPFL2020

Leaderless Consensus

Rachid Guerraoui, Vincent Gramoli, Mihail Igor Zablotchi, Karolos Antoniadis

Classical synchronous consensus algorithms are leaderless: processes exchange their proposals, retain the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are more robust in that they only req ...

IEEE COMPUTER SOC2021

Scaling Byzantine Fault Tolerance

Matej Pavlovic

Online services are becoming more and more ubiquitous and keep growing in scale. At the same time, they are required to be highly available, secure, energy-efficient, and to achieve high performance. To ensure these (and many other) properties, replication ...

EPFL2019

Interventions for Softening Can Lead to Hardening of Opinions: Evidence from a Randomized Controlled Trial

Robert West, Andreas Oliver Spitz, Ahmad Abu-Akel

Motivated by the goal of designing interventions for softening polarized opinions on the Web, and building on results from psychology, we hypothesized that people would be moved more easily towards opposing opinions when the latter were voiced by a celebri ...

ASSOC COMPUTING MACHINERY2021

The Consensus Number of a Cryptocurrency

Rachid Guerraoui, Matej Pavlovic, Dragos-Adrian Seredinschi, Matteo Monti

Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spen ...

ASSOC COMPUTING MACHINERY2019

Rational Agreement in the Presence of Crash Faults

Vincent Gramoli

Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of (k, t)-robustness is key to derive impossibility results with k rational players and t faulty players. However, these t faulty players are always ...

IEEE2021

CALYPSO: Private Data Management for Decentralized Ledgers

Bryan Alexander Ford, Philipp Svetolik Jovanovic, Linus Gasser, Eleftherios Kokoris Kogias, Enis Ceyhun Alp

Distributed ledgers provide high availability and integrity, making them a key enabler for practical and secure computation of distributed workloads among mutually distrustful parties. Many practical applications also require strong confidentiality, howeve ...

2021

Scalable Byzantine Reliable Broadcast

Rachid Guerraoui, Matej Pavlovic, Dragos-Adrian Seredinschi, Matteo Monti

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting scale poorly, as ...

Schloss Dagstuhl--Leibniz-Zentrum fer Informatik2019

Secure, Confidential Blockchains Providing High Throughput and Low Latency

Eleftherios Kokoris Kogias

One of the core promises of blockchain technology is that of enabling trustworthy data dissemination in a trustless environment. What current blockchain systems deliver, however, is slow dissemination of public data, rendering blockchain technology unusabl ...

EPFL2019

The Impact of RDMA on Agreement

Rachid Guerraoui, Mihail Igor Zablotchi

Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This technology allows a process to directly read and write the memory of a remote host, with a mechanism to control access permissions. In this paper, we study the fundamenta ...

2019

AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis, Georgios Damaskinos

We present AGGREGATHOR, a framework that implements state-of-the-art robust (Byzantine-resilient) distributed stochastic gradient descent. Following the standard parameter server model, we assume that a minority of worker machines can be controlled by an a ...

2019