Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications
![Thumbnail](/xmlui/bitstream/handle/10234/197484/cholvi_2021_byzantine.pdf.jpg?sequence=4&isAllowed=y)
View/ Open
Impact
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/159830
comunitat-uji-handle4:
INVESTIGACIONMetadata
Title
Byzantine-Tolerant Distributed Grow-Only Sets: Specification and ApplicationsAuthor (s)
Date
2021-06-26Publisher
Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbHISBN
978-3-95977-196-2ISSN
2190-6807Bibliographic citation
Cholvi, V., Fernández Anta, A., Georgiou, C., Nicolaou, N., Raynal, M., & Russo, A. (2021). Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications. In 4th International Symposium on Foundations and Applications of Blockchain 2021 (FAB 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.Type
info:eu-repo/semantics/conferenceObjectVersion
info:eu-repo/semantics/publishedVersionSubject
Abstract
In order to formalize Distributed Ledger Technologies and their interconnections, a recent line of
research work has formulated the notion of Distributed Ledger Object (DLO), which is a concurrent
object that maintains ... [+]
In order to formalize Distributed Ledger Technologies and their interconnections, a recent line of
research work has formulated the notion of Distributed Ledger Object (DLO), which is a concurrent
object that maintains a totally ordered sequence of records, abstracting blockchains and distributed
ledgers. Through DLO, the Atomic Appends problem, intended as the need of a primitive able to
append multiple records to distinct ledgers in an atomic way, is studied as a basic interconnection
problem among ledgers.
In this work, we propose the Distributed Grow-only Set object (DSO), which instead of maintaining
a sequence of records, as in a DLO, maintains a set of records in an immutable way: only Add and
Get operations are provided. This object is inspired by the Grow-only Set (G-Set) data type which
is part of the Conflict-free Replicated Data Types. We formally specify the object and we provide a
consensus-free Byzantine-tolerant implementation that guarantees eventual consistency. We then use
our Byzantine-tolerant DSO (BDSO) implementation to provide consensus-free algorithmic solutions
to the Atomic Appends and Atomic Adds (the analogous problem of atomic appends applied on
G-Sets) problems, as well as to construct consensus-free Single-Writer BDLOs. We believe that the
BDSO has applications beyond the above-mentioned problems. [-]
Description
Ponència presentada al 4th International Symposium on Foundations and Applications of Blockchain 2021 (FAB 2021).
Funder Name
French ANR project ByBLoS | Comunidad de Madrid | FSE | FEDER | Ministerio de Ciencia, Innovación y Universidades (Spain)
Project code
ANR-20-CE25-0002-01 | P2018/TCS4499 | PID2019-109805RB-I00
Rights
info:eu-repo/semantics/openAccess
This item appears in the folowing collection(s)
Except where otherwise noted, this item's license is described as © Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, Nicolas Nicolaou, Michel Raynal, and
Antonio Russo;
licensed under Creative Commons License CC-BY 4.0
OpenAccess Series in Informatics
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany