activity
20152020
most citedOn Fairness in Committee-based Blockchains

2 citations · 6 across the 8 of their papers we have counts for

collaborators

9 papers

cs.DC2020★ 1 cited

On Finality in Blockchains

Emmanuelle Anceaume, Antonella Pozzo, Thibault Rieutord +1

There exist many forms of Blockchain finality conditions, from deterministic to probabilistic terminations. To favor availability against consistency in the face of partitions, mos…

cs.DC2020

Tenderbake -- A Solution to Dynamic Repeated Consensus for Blockchains

Lăcrămioara Aştefanoaei, Pierre Chambart, Antonella Del Pozzo +3

First-generation blockchains provide probabilistic finality: a block can be revoked, albeit the probability decreases as the block sinks deeper into the chain. Recent proposals rev…

cs.DC2019★ 2 cited

On Fairness in Committee-based Blockchains

Yackolley Amoussou-Guenou, Antonella del Pozzo, Maria Potop-Butucaru +1

Committee-based blockchains are among the most popular alternatives of proof-of-work based blockchains, such as Bitcoin. They provide strong consistency (no fork) under classical a…

cs.CR2018★ 2 cited

Pluralize: a Trustworthy Framework for High-Level Smart Contract-Draft

Zaynah Dargaye, Antonella Pozzo, Sara Tucci-Piergiovanni

The paper presents Pluralize a formal logical framework able to extend the execution of blockchain transactions to events coming from external oracles, like external time, sensor d…

cs.DC2018

Dissecting Tendermint

Yackolley Amoussou-Guenou, Antonella del Pozzo, Maria Potop-Butucaru +1

In this paper we analyze Tendermint proposed in [7], one of the most popular blockchains based on PBFT Consensus. The current paper dissects Tendermint under various system communi…

cs.DC2018

Blockchain Abstract Data Type

Emmanuelle Anceaume, Antonella Del Pozzo, Romaric Ludinard +2

The presented work continues the line of recent distributed computing communityefforts dedicated to the theoretical aspects of blockchains. This paper is the rst tospecify blockcha…

cs.DC2017★ 1 cited

Optimal Storage under Unsynchrononized Mobile Byzantine Faults

Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru +1

In this paper we prove lower and matching upper bounds for the number of servers required to implement a regular shared register that tolerates unsynchronized Mobile Byzantine fail…

cs.DC2016

Approximate Agreement under Mobile Byzantine Faults

Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru +1

In this paper we address Approximate Agreement problem in the Mobile Byzantine faults model. Our contribution is threefold. First, we propose the the first mapping from the existin…

cs.DC2015

Tight Mobile Byzantine Tolerant Atomic Storage

Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru

This paper proposes the first implementation of an atomic storage tolerant to mobile Byzantine agents. Our implementation is designed for the round-based synchronous model where th…