Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems
We give an introduction to federated Byzantine agreement systems (FBAS) with many examples ranging from small "academic" cases to the current Stellar network. We then analyze the main concepts from a mathematical and an algorithmic point of view. Based on work of Lachowski we derive algori...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Gaul, André Khoffi, Ismail Liesen, Jörg Stüber, Torsten |
| description | We give an introduction to federated Byzantine agreement systems (FBAS) with
many examples ranging from small "academic" cases to the current Stellar
network. We then analyze the main concepts from a mathematical and an
algorithmic point of view. Based on work of Lachowski we derive algorithms for
quorum enumeration, checking quorum intersection, and computing the intact
nodes with respect to a given set of ill-behaved (Byzantine) nodes. We also
show that from the viewpoint of the intactness probability of nodes, which we
introduce in this paper, a hierarchical setup of nodes is inferior to an
arrangement that we call a symmetric simple FBAS. All algorithms described in
this paper are implemented in the Python package Stellar Observatory, which is
also used in some of the computed examples. |
| doi_str_mv | 10.48550/arxiv.1912.01365 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1912_01365</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1912_01365</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-60e0d38a587a42b440b72277bc2a80d5d7d6309829d3505bd7abbd7af04116f43</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvHVDLBTDhG0jwb-yMoaKA1MJA9-hL_aW1FLvIthDh6lELy3m3Iz2E3HFWK6s1e4D07b9q3nJRMy4bfUPedlBOGKD4A0y0izDN2WcK0dFuOp6TL6eQ6XhOdIMOExR09HH-gVh8RNodE2LAWOjHnAuGvCKLEaaMt_9dkv3mab9-qbbvz6_rbltBY3TVMGROWtDWgBKDUmwwQhgzHARY5rQzrpGstaJ1UjM9OAPDZUamOG9GJZfk_u_2Cuo_kw-Q5v4C668w-Qu0_EjJ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems</title><source>arXiv.org</source><creator>Gaul, André ; Khoffi, Ismail ; Liesen, Jörg ; Stüber, Torsten</creator><creatorcontrib>Gaul, André ; Khoffi, Ismail ; Liesen, Jörg ; Stüber, Torsten</creatorcontrib><description>We give an introduction to federated Byzantine agreement systems (FBAS) with
many examples ranging from small "academic" cases to the current Stellar
network. We then analyze the main concepts from a mathematical and an
algorithmic point of view. Based on work of Lachowski we derive algorithms for
quorum enumeration, checking quorum intersection, and computing the intact
nodes with respect to a given set of ill-behaved (Byzantine) nodes. We also
show that from the viewpoint of the intactness probability of nodes, which we
introduce in this paper, a hierarchical setup of nodes is inferior to an
arrangement that we call a symmetric simple FBAS. All algorithms described in
this paper are implemented in the Python package Stellar Observatory, which is
also used in some of the computed examples.</description><identifier>DOI: 10.48550/arxiv.1912.01365</identifier><language>eng</language><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><creationdate>2019-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1912.01365$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1912.01365$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gaul, André</creatorcontrib><creatorcontrib>Khoffi, Ismail</creatorcontrib><creatorcontrib>Liesen, Jörg</creatorcontrib><creatorcontrib>Stüber, Torsten</creatorcontrib><title>Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems</title><description>We give an introduction to federated Byzantine agreement systems (FBAS) with
many examples ranging from small "academic" cases to the current Stellar
network. We then analyze the main concepts from a mathematical and an
algorithmic point of view. Based on work of Lachowski we derive algorithms for
quorum enumeration, checking quorum intersection, and computing the intact
nodes with respect to a given set of ill-behaved (Byzantine) nodes. We also
show that from the viewpoint of the intactness probability of nodes, which we
introduce in this paper, a hierarchical setup of nodes is inferior to an
arrangement that we call a symmetric simple FBAS. All algorithms described in
this paper are implemented in the Python package Stellar Observatory, which is
also used in some of the computed examples.</description><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvHVDLBTDhG0jwb-yMoaKA1MJA9-hL_aW1FLvIthDh6lELy3m3Iz2E3HFWK6s1e4D07b9q3nJRMy4bfUPedlBOGKD4A0y0izDN2WcK0dFuOp6TL6eQ6XhOdIMOExR09HH-gVh8RNodE2LAWOjHnAuGvCKLEaaMt_9dkv3mab9-qbbvz6_rbltBY3TVMGROWtDWgBKDUmwwQhgzHARY5rQzrpGstaJ1UjM9OAPDZUamOG9GJZfk_u_2Cuo_kw-Q5v4C668w-Qu0_EjJ</recordid><startdate>20191203</startdate><enddate>20191203</enddate><creator>Gaul, André</creator><creator>Khoffi, Ismail</creator><creator>Liesen, Jörg</creator><creator>Stüber, Torsten</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20191203</creationdate><title>Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems</title><author>Gaul, André ; Khoffi, Ismail ; Liesen, Jörg ; Stüber, Torsten</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-60e0d38a587a42b440b72277bc2a80d5d7d6309829d3505bd7abbd7af04116f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Gaul, André</creatorcontrib><creatorcontrib>Khoffi, Ismail</creatorcontrib><creatorcontrib>Liesen, Jörg</creatorcontrib><creatorcontrib>Stüber, Torsten</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gaul, André</au><au>Khoffi, Ismail</au><au>Liesen, Jörg</au><au>Stüber, Torsten</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems</atitle><date>2019-12-03</date><risdate>2019</risdate><abstract>We give an introduction to federated Byzantine agreement systems (FBAS) with
many examples ranging from small "academic" cases to the current Stellar
network. We then analyze the main concepts from a mathematical and an
algorithmic point of view. Based on work of Lachowski we derive algorithms for
quorum enumeration, checking quorum intersection, and computing the intact
nodes with respect to a given set of ill-behaved (Byzantine) nodes. We also
show that from the viewpoint of the intactness probability of nodes, which we
introduce in this paper, a hierarchical setup of nodes is inferior to an
arrangement that we call a symmetric simple FBAS. All algorithms described in
this paper are implemented in the Python package Stellar Observatory, which is
also used in some of the computed examples.</abstract><doi>10.48550/arxiv.1912.01365</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1912.01365 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1912_01365 |
| source | arXiv.org |
| subjects | Computer Science - Distributed, Parallel, and Cluster Computing |
| title | Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T23%3A52%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Mathematical%20Analysis%20and%20Algorithms%20for%20Federated%20Byzantine%20Agreement%20Systems&rft.au=Gaul,%20Andr%C3%A9&rft.date=2019-12-03&rft_id=info:doi/10.48550/arxiv.1912.01365&rft_dat=%3Carxiv_GOX%3E1912_01365%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |