Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911903827099648 |
|---|---|
| author | Cohen, Shir Keidar, Idit |
| author_facet | Cohen, Shir Keidar, Idit |
| contents | We formalize Byzantine linearizability, a correctness condition that specifies whether a concurrent object with a sequential specification is resilient against Byzantine failures. Using this definition, we systematically study Byzantine-tolerant emulations of various objects from registers. We focus on three useful objects -- reliable broadcast, atomic snapshot, and asset transfer. We prove that there is an $f$-resilient implementation of such objects from registers with $n$ processes $f<\frac{n}{2}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2102_10597 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer Cohen, Shir Keidar, Idit Distributed, Parallel, and Cluster Computing We formalize Byzantine linearizability, a correctness condition that specifies whether a concurrent object with a sequential specification is resilient against Byzantine failures. Using this definition, we systematically study Byzantine-tolerant emulations of various objects from registers. We focus on three useful objects -- reliable broadcast, atomic snapshot, and asset transfer. We prove that there is an $f$-resilient implementation of such objects from registers with $n$ processes $f<\frac{n}{2}$. |
| title | Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2102.10597 |