Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
This paper is on the consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the consensus problem in such a context consists of enriching the system with addi...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on dependable and secure computing 2005-01, Vol.2 (1), p.46-56 |
|---|---|
| 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 | 56 |
|---|---|
| container_issue | 1 |
| container_start_page | 46 |
| container_title | IEEE transactions on dependable and secure computing |
| container_volume | 2 |
| creator | Friedman, R. Mostefaoui, A. Raynal, M. |
| description | This paper is on the consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the consensus problem in such a context consists of enriching the system with additional oracles that are powerful enough to cope with the uncertainty and unpredictability created by the combined effect of Byzantine behavior and asynchrony. This paper presents two kinds of Byzantine asynchronous consensus protocols using two types of oracles, namely, a common coin that provides processes with random values and a failure detector oracle. Both allow the processes to decide in one communication step in favorable circumstances. The first is a randomized protocol for an oblivious scheduler model that assumes n > 6f. The second one is a failure detector-based protocol that assumes n > tif. These protocols are designed to be particularly simple and efficient in terms of communication steps, the number of messages they generate in each step, and the size of messages. So, although they are not optimal in the number of Byzantine processes that can be tolerated, they are particularly efficient when we consider the number of communication steps they require to decide and the number and size of the messages they use. In that sense, they are practically appealing. |
| doi_str_mv | 10.1109/TDSC.2005.13 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_901719519</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1416864</ieee_id><sourcerecordid>901719519</sourcerecordid><originalsourceid>FETCH-LOGICAL-c345t-18daf2b3014126d4a3a2aaf7b604af51f3d6acdd8faf83dc135bc366ea0345503</originalsourceid><addsrcrecordid>eNp90U1rGzEQBuCltNDU7a23XpYc2kvW1ehjV3tMnE8w9GAXchNj7YisWUuOtD5sf31kHAj0kJMEeka8w1sU34HNAVj7e329Wsw5Y2oO4kNxBq2EijHQH_NdSVWptoHPxZeUtoxxqVt5Vjyu-t1-oBJ9V5Jzve3Jj2WIaAeqNpioK23wiXw6pHIfwxhsGFLpQiwxTd4-xeBDfrqa_qEfe09lmtJIu_S1-ORwSPTt9ZwVf29v1ov7avnn7mFxuayskGqsQHfo-EYwkMDrTqJAjuiaTc0kOgVOdDXartMOnRadBaE2VtQ1IcvziolZ8ev0bw73fKA0ml2fLA0DesrBTMuggVZBm-XPdyXXTDWyaTI8_w9uwyH6vIXhrFaca80zujghG0NKkZzZx36HcTLAzLENc2zDHNswIDL_ceI9Eb1RCbWupXgB3ReGxQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>206522882</pqid></control><display><type>article</type><title>Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems</title><source>IEEE Electronic Library (IEL)</source><creator>Friedman, R. ; Mostefaoui, A. ; Raynal, M.</creator><creatorcontrib>Friedman, R. ; Mostefaoui, A. ; Raynal, M.</creatorcontrib><description>This paper is on the consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the consensus problem in such a context consists of enriching the system with additional oracles that are powerful enough to cope with the uncertainty and unpredictability created by the combined effect of Byzantine behavior and asynchrony. This paper presents two kinds of Byzantine asynchronous consensus protocols using two types of oracles, namely, a common coin that provides processes with random values and a failure detector oracle. Both allow the processes to decide in one communication step in favorable circumstances. The first is a randomized protocol for an oblivious scheduler model that assumes n > 6f. The second one is a failure detector-based protocol that assumes n > tif. These protocols are designed to be particularly simple and efficient in terms of communication steps, the number of messages they generate in each step, and the size of messages. So, although they are not optimal in the number of Byzantine processes that can be tolerated, they are particularly efficient when we consider the number of communication steps they require to decide and the number and size of the messages they use. In that sense, they are practically appealing.</description><identifier>ISSN: 1545-5971</identifier><identifier>EISSN: 1941-0018</identifier><identifier>DOI: 10.1109/TDSC.2005.13</identifier><identifier>CODEN: ITDSCM</identifier><language>eng</language><publisher>Washington: IEEE</publisher><subject>Agreements ; Byzantine process ; Coins ; Communication ; Computation ; Computer Society ; Context ; Detectors ; distributed algorithm ; Distributed algorithms ; Distributed computing ; Distributed processing ; Failure ; Fault detection ; Fault tolerance ; Fault tolerant systems ; Index Terms- Asynchronous distributed system ; Information systems ; Messages ; Optimization ; Protocol ; Protocols ; random oracle ; randomized protocol ; Sensors ; Specifications ; Studies ; Systems management ; Uncertainty ; unreliable failure detector</subject><ispartof>IEEE transactions on dependable and secure computing, 2005-01, Vol.2 (1), p.46-56</ispartof><rights>Copyright IEEE Computer Society Jan-Mar 2005</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c345t-18daf2b3014126d4a3a2aaf7b604af51f3d6acdd8faf83dc135bc366ea0345503</citedby><cites>FETCH-LOGICAL-c345t-18daf2b3014126d4a3a2aaf7b604af51f3d6acdd8faf83dc135bc366ea0345503</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1416864$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1416864$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Friedman, R.</creatorcontrib><creatorcontrib>Mostefaoui, A.</creatorcontrib><creatorcontrib>Raynal, M.</creatorcontrib><title>Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems</title><title>IEEE transactions on dependable and secure computing</title><addtitle>TDSC</addtitle><description>This paper is on the consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the consensus problem in such a context consists of enriching the system with additional oracles that are powerful enough to cope with the uncertainty and unpredictability created by the combined effect of Byzantine behavior and asynchrony. This paper presents two kinds of Byzantine asynchronous consensus protocols using two types of oracles, namely, a common coin that provides processes with random values and a failure detector oracle. Both allow the processes to decide in one communication step in favorable circumstances. The first is a randomized protocol for an oblivious scheduler model that assumes n > 6f. The second one is a failure detector-based protocol that assumes n > tif. These protocols are designed to be particularly simple and efficient in terms of communication steps, the number of messages they generate in each step, and the size of messages. So, although they are not optimal in the number of Byzantine processes that can be tolerated, they are particularly efficient when we consider the number of communication steps they require to decide and the number and size of the messages they use. In that sense, they are practically appealing.</description><subject>Agreements</subject><subject>Byzantine process</subject><subject>Coins</subject><subject>Communication</subject><subject>Computation</subject><subject>Computer Society</subject><subject>Context</subject><subject>Detectors</subject><subject>distributed algorithm</subject><subject>Distributed algorithms</subject><subject>Distributed computing</subject><subject>Distributed processing</subject><subject>Failure</subject><subject>Fault detection</subject><subject>Fault tolerance</subject><subject>Fault tolerant systems</subject><subject>Index Terms- Asynchronous distributed system</subject><subject>Information systems</subject><subject>Messages</subject><subject>Optimization</subject><subject>Protocol</subject><subject>Protocols</subject><subject>random oracle</subject><subject>randomized protocol</subject><subject>Sensors</subject><subject>Specifications</subject><subject>Studies</subject><subject>Systems management</subject><subject>Uncertainty</subject><subject>unreliable failure detector</subject><issn>1545-5971</issn><issn>1941-0018</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp90U1rGzEQBuCltNDU7a23XpYc2kvW1ehjV3tMnE8w9GAXchNj7YisWUuOtD5sf31kHAj0kJMEeka8w1sU34HNAVj7e329Wsw5Y2oO4kNxBq2EijHQH_NdSVWptoHPxZeUtoxxqVt5Vjyu-t1-oBJ9V5Jzve3Jj2WIaAeqNpioK23wiXw6pHIfwxhsGFLpQiwxTd4-xeBDfrqa_qEfe09lmtJIu_S1-ORwSPTt9ZwVf29v1ov7avnn7mFxuayskGqsQHfo-EYwkMDrTqJAjuiaTc0kOgVOdDXartMOnRadBaE2VtQ1IcvziolZ8ev0bw73fKA0ml2fLA0DesrBTMuggVZBm-XPdyXXTDWyaTI8_w9uwyH6vIXhrFaca80zujghG0NKkZzZx36HcTLAzLENc2zDHNswIDL_ceI9Eb1RCbWupXgB3ReGxQ</recordid><startdate>200501</startdate><enddate>200501</enddate><creator>Friedman, R.</creator><creator>Mostefaoui, A.</creator><creator>Raynal, M.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7SP</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>200501</creationdate><title>Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems</title><author>Friedman, R. ; Mostefaoui, A. ; Raynal, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c345t-18daf2b3014126d4a3a2aaf7b604af51f3d6acdd8faf83dc135bc366ea0345503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Agreements</topic><topic>Byzantine process</topic><topic>Coins</topic><topic>Communication</topic><topic>Computation</topic><topic>Computer Society</topic><topic>Context</topic><topic>Detectors</topic><topic>distributed algorithm</topic><topic>Distributed algorithms</topic><topic>Distributed computing</topic><topic>Distributed processing</topic><topic>Failure</topic><topic>Fault detection</topic><topic>Fault tolerance</topic><topic>Fault tolerant systems</topic><topic>Index Terms- Asynchronous distributed system</topic><topic>Information systems</topic><topic>Messages</topic><topic>Optimization</topic><topic>Protocol</topic><topic>Protocols</topic><topic>random oracle</topic><topic>randomized protocol</topic><topic>Sensors</topic><topic>Specifications</topic><topic>Studies</topic><topic>Systems management</topic><topic>Uncertainty</topic><topic>unreliable failure detector</topic><toplevel>online_resources</toplevel><creatorcontrib>Friedman, R.</creatorcontrib><creatorcontrib>Mostefaoui, A.</creatorcontrib><creatorcontrib>Raynal, M.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Electronics & Communications Abstracts</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on dependable and secure computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Friedman, R.</au><au>Mostefaoui, A.</au><au>Raynal, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems</atitle><jtitle>IEEE transactions on dependable and secure computing</jtitle><stitle>TDSC</stitle><date>2005-01</date><risdate>2005</risdate><volume>2</volume><issue>1</issue><spage>46</spage><epage>56</epage><pages>46-56</pages><issn>1545-5971</issn><eissn>1941-0018</eissn><coden>ITDSCM</coden><abstract>This paper is on the consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the consensus problem in such a context consists of enriching the system with additional oracles that are powerful enough to cope with the uncertainty and unpredictability created by the combined effect of Byzantine behavior and asynchrony. This paper presents two kinds of Byzantine asynchronous consensus protocols using two types of oracles, namely, a common coin that provides processes with random values and a failure detector oracle. Both allow the processes to decide in one communication step in favorable circumstances. The first is a randomized protocol for an oblivious scheduler model that assumes n > 6f. The second one is a failure detector-based protocol that assumes n > tif. These protocols are designed to be particularly simple and efficient in terms of communication steps, the number of messages they generate in each step, and the size of messages. So, although they are not optimal in the number of Byzantine processes that can be tolerated, they are particularly efficient when we consider the number of communication steps they require to decide and the number and size of the messages they use. In that sense, they are practically appealing.</abstract><cop>Washington</cop><pub>IEEE</pub><doi>10.1109/TDSC.2005.13</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1545-5971 |
| ispartof | IEEE transactions on dependable and secure computing, 2005-01, Vol.2 (1), p.46-56 |
| issn | 1545-5971 1941-0018 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_901719519 |
| source | IEEE Electronic Library (IEL) |
| subjects | Agreements Byzantine process Coins Communication Computation Computer Society Context Detectors distributed algorithm Distributed algorithms Distributed computing Distributed processing Failure Fault detection Fault tolerance Fault tolerant systems Index Terms- Asynchronous distributed system Information systems Messages Optimization Protocol Protocols random oracle randomized protocol Sensors Specifications Studies Systems management Uncertainty unreliable failure detector |
| title | Simple and efficient oracle-based consensus protocols for asynchronous Byzantine 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-09T21%3A06%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Simple%20and%20efficient%20oracle-based%20consensus%20protocols%20for%20asynchronous%20Byzantine%20systems&rft.jtitle=IEEE%20transactions%20on%20dependable%20and%20secure%20computing&rft.au=Friedman,%20R.&rft.date=2005-01&rft.volume=2&rft.issue=1&rft.spage=46&rft.epage=56&rft.pages=46-56&rft.issn=1545-5971&rft.eissn=1941-0018&rft.coden=ITDSCM&rft_id=info:doi/10.1109/TDSC.2005.13&rft_dat=%3Cproquest_RIE%3E901719519%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=206522882&rft_id=info:pmid/&rft_ieee_id=1416864&rfr_iscdi=true |