2 citations · 5 across the 13 of their papers we have counts for
16 papers
Simple and Fast Signature-Free Blockchain Consensus
Giuliano Losa, Xuechao Wang, Zhuolun Xiang +1
Signature-free protocols avoid the cost of post-quantum signatures. We present two simple signature-free blockchain consensus protocols for eventual synchrony with optimal good-cas…
Show Me The Money: An Exercise in Proof-Driven Software Understanding
Joseph Tafese, Karthik Nukala, Hassen Saïdi +3
We present a case study on proof-driven software understanding of mature, security-critical infrastructure. While formal methods are traditionally applied during the design phase,…
Simple-IT: Practical Low-Latency Signature-Free BFT Consensus
Qianyu Yu, Juan Villacis, Giuliano Losa +2
Recent advances in quantum computing pose a looming threat to most current Byzantine fault-tolerant (BFT) consensus protocols, which rely on quantum-vulnerable public-key signature…
Monotone Erasure Codes
Vivien Bammert, Annalisa Cimatti, Orestis Alpos +2
Erasure codes are a critical component in reliable storage systems today, and many blockchain systems use consensus protocols that involve erasure codes to reduce their communicati…
Fast Deterministically Safe Proof-of-Work Consensus
Ali Farahbakhsh, Giuliano Losa, Youer Pu +2
Permissionless blockchains achieve consensus while allowing unknown nodes to join and leave the system at any time. They typically come in two flavors: proof of work (PoW) and proo…
Angelfish: Leader, DAG, or Anywhere in Between
Qianyu Yu, Giuliano Losa, Nibesh Shrestha +1
To maximize performance, many modern blockchain systems rely on eventually-synchronous, Byzantine fault-tolerant (BFT) consensus protocols. Two protocol designs have emerged in thi…
Optimistic, Signature-Free Reliable Broadcast and Its Applications
Nibesh Shrestha, Qianyu Yu, Aniket Kate +3
Reliable broadcast (RBC) is a key primitive in fault-tolerant distributed systems, and improving its efficiency can benefit a wide range of applications. This work focuses on signa…
Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model
Giuliano Losa, Eli Gafni
In the fully-anonymous (shared-memory) model, inspired by a biological setting, processors have no identifiers and memory locations are anonymous. This means that there is no pre-e…
TetraBFT: Reducing Latency of Unauthenticated, Responsive BFT Consensus
Qianyu Yu, Giuliano Losa, Xuechao Wang
This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography…
Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
Francesco D'Amato, Giuliano Losa, Luca Zanolini
Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful…
Time is not a Healer, but it Sure Makes Hindsight 20:20
Eli Gafni, Giuliano Losa
In the 1980s, three related impossibility results emerged in the field of distributed computing. First, Fischer, Lynch, and Paterson demonstrated that deterministic consensus is un…
Consensus in the Unknown-Participation Message-Adversary Model
Giuliano Losa, Eli Gafni
We propose a new distributed-computing model, inspired by permissionless distributed systems such as Bitcoin and Ethereum, that allows studying permissionless consensus in a mathem…
Quorum Systems in Permissionless Network
Christian Cachin, Giuliano Losa, Luca Zanolini
Fail-prone systems, and their quorum systems, are useful tools for the design of distributed algorithms. However, fail-prone systems as studied so far require every process to know…
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
Idan Berkovits, Marijana Lazic, Giuliano Losa +2
Verification of fault-tolerant distributed protocols is an immensely difficult task. Often, in these protocols, thresholds on set cardinalities are used both in the process code an…
Paxos Made EPR: Decidable Reasoning about Distributed Protocols
Oded Padon, Giuliano Losa, Mooly Sagiv +1
Distributed protocols such as Paxos play an important role in many computer systems. Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of e…
Speeding up Consensus by Chasing Fast Decisions
Balaji Arun, Sebastiano Peluso, Roberto Palmieri +2
This paper proposes Caesar, a novel multi-leader Generalized Consensus protocol for geographically replicated sites. The main goal of Caesar is to overcome one of the major limitat…