7 citations · 20 across the 7 of their papers we have counts for
9 papers
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…
Synchronous Byzantine Lattice Agreement in Rounds
Giuseppe Antonio Di Luna, Emmanuelle Anceaume, Silvia Bonomi +1
In the Lattice Agreement (LA) problem, originally proposed by Attiya et al. \cite{Attiya:1995}, a set of processes has to decide on a chain of a lattice. More precisely, each corre…
Byzantine Generalized Lattice Agreement
Giuseppe Antonio Di Luna, Emmanuelle Anceaume, Leonardo Querzoni
The paper investigates the Lattice Agreement (LA) problem in asynchronous systems. In LA each process proposes an element from a predetermined lattice, and has to decide on an…
StakeCube: Combining Sharding and Proof-of-Stake to build Fork-free Secure Permissionless Distributed Ledgers
Antoine Durand, Emmanuelle Anceaume, Romaric Ludinard
Our work focuses on the design of a scalable permissionless blockchain in the proof-of-stake setting. In particular, we use a distributed hash table as a building block to set up r…
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…
Optimization results for a generalized coupon collector problem
Emmanuelle Anceaume, Yann Busnel, Ernst Schulte-Geers +1
We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set o…