IMDEA Networks Institute Publications Repository

Atomic Appends in Asynchronous Byzantine Distributed Ledgers

Cholvi, Vicent and Fernández Anta, Antonio and Georgiou, Chryssis and Nicolaou, Nicolas and Raynal, Michel (2020) Atomic Appends in Asynchronous Byzantine Distributed Ledgers. In: The 16th European Dependable Computing Conference (EDCC 2020), 7-10 September 2020, Munich, Germany.

[img] PDF
Download (300Kb)

Abstract

A Distributed Ledger Object (DLO) is a concurrent object that maintains a totally ordered sequence of records, and supports two operations: APPEND, which appends a record at the end of the sequence, and GET, which returns the whole sequence of records. The work presented in this article is made up of two main contributions. The first contribution is a formalization of a Byzantine-tolerant Distributed Ledger Object (BDLO), which is a DLO in which clients and servers processes may deviate arbitrarily from their intended behavior (i.e. they may be Byzantine). The proposed formal definition is accompanied by algorithms that implement BDLOs on top of an underlying Byzantine Atomic Broadcast service. The second contribution is a suite of algorithms, based on the previous BDLO implementations, that solve the Atomic Appends problem in the presence of asynchrony, Byzantine clients and Byzantine servers. This problem occurs when clients have a composite record (set of basic records) to append to different BDLOs, in such a way that either each basic record is appended to its BDLO (and this must occur in good circumstances), or no basic record is appended. Distributed algorithms are presented, which solve the Atomic Appends problem when the clients (involved in the Atomic Appends) and the servers (which maintain the BDLOs) may be Byzantine.

Item Type: Conference or Workshop Papers (Paper)
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Antonio Fernandez
Date Deposited: 03 Jul 2020 08:00
Last Modified: 03 Jul 2020 08:00
URI: http://eprints.networks.imdea.org/id/eprint/2160

Actions (login required)

View Item View Item