Publications associées à Preuve d'enjeu

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

Leaderless consensus

Rachid Guerraoui, Gauthier Jérôme Timothée Voron, Vincent Gramoli, Mihail Igor Zablotchi, Karolos Antoniadis, Antoine Philippe Matthieu Desjardins

Classic synchronous consensus algorithms are leaderless in that processes exchange proposals, choose the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are typically leader-based. Although t ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

DIABLO: A Benchmark Suite for Blockchains

Rachid Guerraoui, Gauthier Jérôme Timothée Voron, Vincent Gramoli, Andrei Lebedev

With the recent advent of blockchains, we have witnessed a plethora of blockchain proposals. These proposals range from using work to using time, storage or stake in order to select blocks to be appended to the chain. As a drawback it makes it difficult fo ...

ASSOC COMPUTING MACHINERY2023

New SIDH Countermeasures for a More Efficient Key Exchange

Tako Boris Fouotsa, Andrea Basso

The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...

Springer2023

Effective Inhibition of TDP-43 Aggregation by Native State Stabilization

Hilal Lashuel, Yllza Jasiqi, Lixin Yang

Preventing the misfolding or aggregation of transactive response DNA binding protein with 43 kDa (TDP-43) is the most actively pursued disease-modifying strategy to treat amyotrophic lateral sclerosis and other neurodegenerative diseases. In this work, we ...

Weinheim2023

Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use

Rachid Guerraoui, Jovan Komatovic, Zarko Milosevic, Dragos-Adrian Seredinschi

Tendermint is a deterministic consensus protocol and is one of the most mature implementations of its kind. This implementation is used as the core for building State Machine Replication (SMR) platforms with Byzantine fault-tolerant (BFT) guarantees. A not ...

IEEE2022

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

Infochain: A Decentralized, Trustless and Transparent Oracle on Blockchain

Boi Faltings, Naman Goel, Aris Filos Ratsikas

Blockchain based systems allow various kinds of financial transactions to be executed in a decentralized manner. However, these systems often rely on a trusted third party (oracle) to get correct information about the real-world events, which trigger the f ...

2022

Gemini: Elastic SNARKs for Diverse Environments

Alessandro Chiesa

We introduce a new class of succinct arguments, that we call elastic. Elastic SNARKs allow the prover to allocate different resources (such as memory and time) depending on the execution environment and the statement to prove. The resulting output is indep ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

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.

Preuve d'enjeu

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Leaderless consensus

DIABLO: A Benchmark Suite for Blockchains

A review of the security vulnerabilities and countermeasures in the Internet of Things solutions: A bright future for the Blockchain

New SIDH Countermeasures for a More Efficient Key Exchange

Effective Inhibition of TDP-43 Aggregation by Native State Stabilization

Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Infochain: A Decentralized, Trustless and Transparent Oracle on Blockchain

Gemini: Elastic SNARKs for Diverse Environments

Graph Chatbot

Chattez avec Graph Search

Revisiting Tendermint: Design Tradeoffs, Accountability, and Practical Use

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Effective Inhibition of TDP-43 Aggregation by Native State Stabilization

DIABLO: A Benchmark Suite for Blockchains

A review of the security vulnerabilities and countermeasures in the Internet of Things solutions: A bright future for the Blockchain

New SIDH Countermeasures for a More Efficient Key Exchange

Gemini: Elastic SNARKs for Diverse Environments

Infochain: A Decentralized, Trustless and Transparent Oracle on Blockchain