Mostrar el registro sencillo del ítem
Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications
dc.contributor.author | Cholvi, Vicent | |
dc.contributor.author | Fernández Anta, Antonio | |
dc.contributor.author | Georgiou, Chryssis | |
dc.contributor.author | Nicolaou, Nicolas | |
dc.contributor.author | raynal, michel | |
dc.contributor.author | Russo, Antonio | |
dc.date.accessioned | 2022-05-03T11:05:28Z | |
dc.date.available | 2022-05-03T11:05:28Z | |
dc.date.issued | 2021-06-26 | |
dc.identifier.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. | ca_CA |
dc.identifier.isbn | 978-3-95977-196-2 | |
dc.identifier.issn | 2190-6807 | |
dc.identifier.uri | http://hdl.handle.net/10234/197484 | |
dc.description | Ponència presentada al 4th International Symposium on Foundations and Applications of Blockchain 2021 (FAB 2021). | ca_CA |
dc.description.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 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. | ca_CA |
dc.format.extent | 19 p. | ca_CA |
dc.format.mimetype | application/pdf | ca_CA |
dc.language.iso | eng | ca_CA |
dc.publisher | Schloss Dagstuhl Leibniz-Zentrum für Informatik GmbH | ca_CA |
dc.rights | © 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 | ca_CA |
dc.rights.uri | http://creativecommons.org/licenses/by-sa/4.0/ | ca_CA |
dc.subject | grow-only sets | ca_CA |
dc.subject | distributed ledgers | ca_CA |
dc.subject | blockchains | ca_CA |
dc.subject | atomic appends | ca_CA |
dc.title | Byzantine-Tolerant Distributed Grow-Only Sets: Specification and Applications | ca_CA |
dc.type | info:eu-repo/semantics/conferenceObject | ca_CA |
dc.identifier.doi | http//orcid.org/10.4230/OASIcs.FAB.2021.2 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | ca_CA |
dc.type.version | info:eu-repo/semantics/publishedVersion | ca_CA |
project.funder.name | French ANR project ByBLoS | ca_CA |
project.funder.name | Comunidad de Madrid | ca_CA |
project.funder.name | FSE | ca_CA |
project.funder.name | FEDER | ca_CA |
project.funder.name | Ministerio de Ciencia, Innovación y Universidades (Spain) | ca_CA |
oaire.awardNumber | ANR-20-CE25-0002-01 | ca_CA |
oaire.awardNumber | P2018/TCS4499 | ca_CA |
oaire.awardNumber | PID2019-109805RB-I00 | ca_CA |
Ficheros en el ítem
Este ítem aparece en la(s) siguiente(s) colección(ones)
Excepto si se señala otra cosa, la licencia del ítem se describe como: © 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