Atomic Appends in Asynchronous Byzantine Distributed Ledgers
Impacte
Scholar |
Altres documents de l'autoria: Cholvi, Vicent; Fernández Anta, Antonio; Georgiou, Chryssis; Nicolaou, Nicolas; raynal, michel; Russo, Antonio
Metadades
Mostra el registre complet de l'elementcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONAquest recurs és restringit
https://doi.org/10.1016/j.jpdc.2023.104748 |
Metadades
Títol
Atomic Appends in Asynchronous Byzantine Distributed LedgersAutoria
Data de publicació
2023-12Editor
ElsevierISSN
0743-7315; 1096-0848Cita bibliogràfica
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.Tipus de document
info:eu-repo/semantics/articleVersió de l'editorial
https://www.sciencedirect.com/science/article/pii/S0743731523001181Versió
info:eu-repo/semantics/publishedVersionParaules clau / Matèries
Resum
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. [-]
Publicat a
Journal of Parallel and Distributed Computing, 2023, vol. 182Entitat finançadora
Comunidad de Madrid | Ministerio de Ciencia, Innovación y Universidades | Ministerio de Ciencia e Innovación | European Regional Development Fund
Identificador de l'entitat finançadora
http://dx.doi.org/10.13039/501100011033
Codi del projecte o subvenció
P2018/TCS4499 | MICIU/ICTI2017-2020/PID2019-109805RB-I00 | MCIN/PEICTI2021-2023/PDC2021-121836-I00 | PRX18/000163
Títol del projecte o subvenció
Computación Edge para Conducción Inteligente
Drets d'accés
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
Apareix a les col.leccions
- LSI_Articles [362]