Zobrazeno 1 - 10
of 161
pro vyhledávání: '"Anceaume, Emmanuelle"'
Autor:
Albouy, Timothé, Anceaume, Emmanuelle, Frey, Davide, Gestin, Mathieu, Rauch, Arthur, Raynal, Michel, Taïani, François
This article introduces a new asynchronous Byzantine-tolerant asset transfer system (cryptocurrency) with three noteworthy properties: quasi-anonymity, lightness, and consensus-freedom. Quasi-anonymity means no information is leaked regarding the rec
Externí odkaz:
http://arxiv.org/abs/2405.18072
There exist many forms of Blockchain finality conditions, from deterministic to probabilistic terminations. To favor availability against consistency in the face of partitions, most blockchains only offer probabilistic eventual finality: blocks may b
Externí odkaz:
http://arxiv.org/abs/2012.10172
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 correct process proposes an element $e$ of a certain join-semi lattice $L$
Externí odkaz:
http://arxiv.org/abs/2001.02670
The paper investigates the Lattice Agreement (LA) problem in asynchronous systems. In LA each process proposes an element $e$ from a predetermined lattice, and has to decide on an element $e'$ of the lattice such that $e \leq e'$. Moreover, decisions
Externí odkaz:
http://arxiv.org/abs/1910.05768
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 randomized shards, and then leverage the sharded architecture to valida
Externí odkaz:
http://arxiv.org/abs/1907.05314
Autor:
Anceaume, Emmanuelle, Del Pozzo, Antonella, Ludinard, Romaric, Potop-Butucaru, Maria, Tucci-Piergiovanni, Sara
The presented work continues the line of recent distributed computing communityefforts dedicated to the theoretical aspects of blockchains. This paper is the rst tospecify blockchains as a composition of abstract data types all together with a hierar
Externí odkaz:
http://arxiv.org/abs/1802.09877
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 of coupons with an arbitrary probability distribution. We suppose that
Externí odkaz:
http://arxiv.org/abs/1504.03878
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study in this paper a generalized coupon collector problem, which consists in determining the distribution and the moments of the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary prob
Externí odkaz:
http://arxiv.org/abs/1402.5245
Autor:
Anceaume, Emmanuelle, Busnel, Yann
In this paper, we consider the problem of estimating the distance between any two large data streams in small- space constraint. This problem is of utmost importance in data intensive monitoring applications where input streams are generated rapidly.
Externí odkaz:
http://arxiv.org/abs/1207.6465