Atomic Appends in Asynchronous Byzantine Distributed Ledgers
Impact
Scholar |
Other documents of the author: Cholvi, Vicent; Fernández Anta, Antonio; Georgiou, Chryssis; Nicolaou, Nicolas; raynal, michel; Russo, Antonio
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONThis resource is restricted
https://doi.org/10.1016/j.jpdc.2023.104748 |
Metadata
Title
Atomic Appends in Asynchronous Byzantine Distributed LedgersAuthor (s)
Date
2023-12Publisher
ElsevierISSN
0743-7315; 1096-0848Bibliographic citation
Cholvi, V., Anta, A. F., Georgiou, C., Nicolaou, N., Raynal, M., & Russo, A. (2023). Atomic appends in asynchronous byzantine distributed ledgers. Journal of Parallel and Distributed Computing, 182, 104748.Type
info:eu-repo/semantics/articlePublisher version
https://www.sciencedirect.com/science/article/pii/S0743731523001181Version
info:eu-repo/semantics/publishedVersionSubject
Abstract
A Distributed Ledger Object (DLO) is a concurrent object that maintains a totally ordered sequence of records. In this work we formalize a linearizable Byzantine-tolerant Distributed Ledger Object (BDLO), which is a ... [+]
A Distributed Ledger Object (DLO) is a concurrent object that maintains a totally ordered sequence of records. In this work we formalize a linearizable Byzantine-tolerant Distributed Ledger Object (BDLO), which is a linearizable DLO where 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.
Then we develop 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. Finally we provide proof of concept implementations and an experimental evaluation of the presented algorithms. [-]
Is part of
Journal of Parallel and Distributed Computing, 2023, vol. 182Funder Name
Comunidad de Madrid | Ministerio de Ciencia, Innovación y Universidades | Ministerio de Ciencia e Innovación | European Regional Development Fund
Funder ID
http://dx.doi.org/10.13039/501100011033
Project code
P2018/TCS4499 | MICIU/ICTI2017-2020/PID2019-109805RB-I00 | MCIN/PEICTI2021-2023/PDC2021-121836-I00 | PRX18/000163
Project title or grant
Computación Edge para Conducción Inteligente
Rights
Copyright © Elsevier B.V.
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/CNE/1.0/
info:eu-repo/semantics/restrictedAccess
This item appears in the folowing collection(s)
- LSI_Articles [362]