arXiv subjects

Matteo Monti

Publications and source records attributed to Matteo Monti.

24 records · Page 2Linked to original sources

arXiv2020

Scalable Byzantine Reliable Broadcast (Extended Version)

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting scale poorly, as they typically build on quorum systems with strong intersection guarantees, which results in linear per-process communication and computation complexity. We generalize the Byzantine reliable broadcast abstraction to the probabilistic setting, allowing each of its properties to be violated with a fixed, arbitrarily small probability. We leverage these relaxed guarantees in a protocol where we replace quorums with stochastic samples. Compared to quorums, samples are significantly smaller in size, leading to a more scalable design. We obtain the first Byzantine reliable broadcast protocol with logarithmic per-process communication and computation complexity. We conduct a complete and thorough analysis of our protocol, deriving bounds on the probability of each of its properties being compromised. During our analysis, we introduce a novel general technique we call adversary decorators. Adversary decorators allow us to make claims about the optimal strategy of the Byzantine adversary without having to make any additional assumptions. We also introduce Threshold Contagion, a model of message propagation through a system with Byzantine processes. To the best of our knowledge, this is the first formal analysis of a probabilistic broadcast protocol in the Byzantine fault model. We show numerically that practically negligible failure probabilities can be achieved with realistic security parameters.

cs.DC↗

arXiv2019

The Consensus Number of a Cryptocurrency (Extended Version)

Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spending; this is usually solved by achieving consensus on the order of transfers among the participants. In this paper, we treat the asset transfer problem as a concurrent object and determine its consensus number, showing that consensus is, in fact, not necessary to prevent double-spending. We first consider the problem as defined by Nakamoto, where only a single process---the account owner---can withdraw from each account. Safety and liveness need to be ensured for correct account owners, whereas misbehaving account owners might be unable to perform transfers. We show that the consensus number of an asset transfer object is $1$. We then consider a more general $k$-shared asset transfer object where up to $k$ processes can atomically withdraw from the same account, and show that this object has consensus number $k$. We establish our results in the context of shared memory with benign faults, allowing us to properly understand the level of difficulty of the asset transfer problem. We also translate these results in the message passing setting with Byzantine players, a model that is more relevant in practice. In this model, we describe an asynchronous Byzantine fault-tolerant asset transfer implementation that is both simpler and more efficient than state-of-the-art consensus-based solutions. Our results are applicable to both the permissioned (private) and permissionless (public) setting, as normally their differentiation is hidden by the abstractions on top of which our algorithms are based.

cs.DC↗

arXiv2019

AT2: Asynchronous Trustworthy Transfers

Many blockchain-based protocols, such as Bitcoin, implement a decentralized asset transfer (or exchange) system. As clearly stated in the original paper by Nakamoto, the crux of this problem lies in prohibiting any participant from engaging in double-spending. There seems to be a common belief that consensus is necessary for solving the double-spending problem. Indeed, whether it is for a permissionless or a permissioned environment, the typical solution uses consensus to build a totally ordered ledger of submitted transfers. In this paper we show that this common belief is false: consensus is not needed to implement of a decentralized asset transfer system. We do so by introducing AT2 (Asynchronous Trustworthy Transfers), a class of consensusless algorithms. To show formally that consensus is unnecessary for asset transfers, we consider this problem first in the shared-memory context. We introduce AT2$_{SM}$, a wait-free algorithm that asynchronously implements asset transfer in the read-write shared-memory model. In other words, we show that the consensus number of an asset-transfer object is one. In the message passing model with Byzantine faults, we introduce a generic asynchronous algorithm called AT2$_{MP}$ and discuss two instantiations of this solution. First, AT2$_{D}$ ensures deterministic guarantees and consequently targets a small scale deployment (tens to hundreds of nodes), typically for a permissioned environment. Second, AT2$_{P}$ provides probabilistic guarantees and scales well to a very large system size (tens of thousands of nodes), ensuring logarithmic latency and communication complexity. Instead of consensus, we construct AT2$_{D}$ and AT2$_{P}$ on top of a broadcast primitive with causal ordering guarantees offering deterministic and probabilistic properties, respectively.

cs.DC↗

arXiv2013

Room Temperature In-plane <100> Magnetic Easy Axis for Fe3O4/SrTiO3(001):Nb Grown by Infrared PLD

We examine the magnetic easy-axis directions of stoichiometric magnetite films grown on SrTiO3:Nb by infrared pulsed-laser deposition. Spin-polarized low-energy electron microscopy reveals that the individual magnetic domains are magnetized along the in-plane <100> film directions. Magneto-optical Kerr effect measurements show that the maxima of the remanence and coercivity are also along in-plane <100> film directions. This easy-axis orientation differs from bulk magnetite and films prepared by other techniques, establishing that the magnetic anisotropy can be tuned by film growth.

cond-mat.mtrl-sci↗

arXiv2013

Initial Stages of FeO Growth on Ru(0001)

We study how FeO wüstite films on Ru(0001) grow by oxygen-assisted molecular beam epitaxy at elevated temperatures (800-900 K). The nucleation and growth of FeO islands are observed in real time by low-energy electron microscopy (LEEM). When the growth is performed in an oxygen pressure of 10-6 Torr, the islands are of bilayer thickness (Fe-O-Fe-O). In contrast, under a pressure of 10-8 Torr, the islands are a single FeO layer thick. We propose that the film thickness is controlled by the concentration of oxygen adsorbed on the Ru. More specifically, when monolayer growth increases the adsorbed oxygen concentration above a limiting value, its growth is suppressed. Increasing the temperature at a fixed oxygen pressure decreases the density of FeO islands. However, the nucleation density is not a monotonic function of oxygen pressure.

cond-mat.mtrl-sci↗

arXiv2011

Magnetism in nanometer-thick magnetite

The oldest known magnetic material, magnetite, is of current interest for use in spintronics as a thin film. An open question is how thin can magnetite films be and still retain the robust ferrimagnetism required for many applications. We have grown one-nanometer-thick magnetite crystals and characterized them in situ by electron and photoelectron microscopies including selected-area x-ray circular dichroism. Well-defined magnetic patterns are observed in individual nano-crystals up to at least 520 K, establishing the retention of ferrimagnetism in magnetite two-unit-cells thick.

cond-mat.mes-hall↗