2 citations · 5 across the 10 of their papers we have counts for
15 papers
Correlated Failures of AI Approval Monitors
Luca Zanolini
Before an AI agent takes a consequential action, such as paying, messaging or changing code, several monitors check it. Their verdicts are combined by aggregating scores or by coun…
Majorum: Ebb-and-Flow Consensus with Dynamic Quorums
Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran +2
Dynamic availability is the ability of a consensus protocol to remain live despite honest participants going offline and later rejoining. A well-known limitation is that dynamicall…
DAG-based Consensus with Asymmetric Trust [Extended Version]
Ignacio Amores-Sesar, Christian Cachin, Juan Villacis +1
In protocols with asymmetric trust, each participant is free to make its own individual trust assumptions about others, captured by an asymmetric quorum system. This contrasts with…
Accountable Liveness
Andrew Lewis-Pye, Joachim Neu, Tim Roughgarden +1
Safety and liveness are the two classical security properties of consensus protocols. Recent works have strengthened safety with accountability: should any safety violation occur,…
3-Slot-Finality Protocol for Ethereum
Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran +1
Gasper, the consensus protocol currently employed by Ethereum, typically requires 64 to 95 slots -- the units of time during which a new chain extending the previous one by one blo…
A Fast Confirmation Rule for the Ethereum Consensus Protocol
Roberto Saltini, Mikhail Kalinin, Luca Zanolini +3
A Confirmation Rule is an algorithm run by network nodes to determine whether a block will remain permanently in the canonical chain. The only Confirmation Rule currently available…
TOB-SVD: Total-Order Broadcast with Single-Vote Decisions in the Sleepy Model
Francesco D'Amato, Roberto Saltini, Thanh-Hai Tran +1
Over the past years, distributed consensus research has expanded its focus to address challenges in large-scale, permissionless systems, such as blockchains. This shift reflects th…
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…
A Simple Single Slot Finality Protocol For Ethereum
Francesco D'Amato, Luca Zanolini
Currently, Gasper, the implemented consensus protocol of Ethereum, takes between 64 and 95 slots to finalize blocks. Because of that, a significant portion of the chain is suscepti…
Recent Latest Message Driven GHOST: Balancing Dynamic Availability With Asynchrony Resilience
Francesco D'Amato, Luca Zanolini
Dynamic participation has recently become a crucial requirement for devising permissionless consensus protocols. This notion, originally formalized by Pass and Shi (ASIACRYPT 2017)…
Modeling Resources in Permissionless Longest-chain Total-order Broadcast
Sarah Azouvi, Christian Cachin, Duc V. Le +2
Blockchain protocols implement total-order broadcast in a permissionless setting, where processes can freely join and leave. In such a setting, to safeguard against Sybil attacks,…
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…
How to Trust Strangers: Composition of Byzantine Quorum Systems
Orestis Alpos, Christian Cachin, Luca Zanolini
Trust is the basis of any distributed, fault-tolerant, or secure system. A trust assumption specifies the failures that a system, such as a blockchain network, can tolerate and det…
On the Synchronization Power of Token Smart Contracts
Orestis Alpos, Christian Cachin, Giorgia Azzurra Marson +1
Modern blockchains support a variety of distributed applications beyond cryptocurrencies, including smart contracts -- which let users execute arbitrary code in a distributed and d…
From Symmetric to Asymmetric Asynchronous Byzantine Consensus
Christian Cachin, Luca Zanolini
Consensus is arguably one of the most important notions in distributed computing. Among asynchronous, randomized, and signature-free implementations, the protocols of Mostéfaoui et…