hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost
We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt the order from the primary and send replies to the clients. As in prior work such as Zyzzyva, when replicas...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on dependable and secure computing 2015-01, Vol.12 (1), p.58-70 |
|---|---|
| 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 | 70 |
|---|---|
| container_issue | 1 |
| container_start_page | 58 |
| container_title | IEEE transactions on dependable and secure computing |
| container_volume | 12 |
| creator | Duan, Sisi Peisert, Sean Levitt, Karl N. |
| description | We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt the order from the primary and send replies to the clients. As in prior work such as Zyzzyva, when replicas are out of order, clients can detect the inconsistency and help replicas converge on the total ordering. However, we take a different approach than previous work that has four distinct benefits: it requires many fewer cryptographic operations, it moves critical jobs to the clients with no additional costs, faulty clients can be detected and identified, and performance in the presence of client participation will not degrade as long as the primary is correct. The correctness is guaranteed by a three-phase checkpoint subprotocol similar to PBFT, which is tailored to our needs. The protocol is triggered by the primary when a certain number of requests are executed or by clients when they detect an inconsistency. |
| doi_str_mv | 10.1109/TDSC.2014.2312331 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6775264</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6775264</ieee_id><sourcerecordid>1816046670</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-38204d64f51de1a2cf77206841fa51f5563c936b134cc98a05bf168a80bba0c83</originalsourceid><addsrcrecordid>eNpdkD1PwzAURS0EEqXwAxBLJBaWFD9_xUZioIECUhFDw2w5rqO6SpMSJ6Dy60nUioHp3eHcq6eD0CXgCQBWt9njIp0QDGxCKBBK4QiNQDGIMQZ53GfOeMxVAqfoLIQ1xoRJxUbofjWdZXfRYutsV5rWf7louvsxVesrF81MV7ZRVpeuMZV10bdvV9Gbr_ym20RpHdpzdFKYMriLwx2jj9lTlr7E8_fn1_RhHlsqVBtTSTBbClZwWDowxBZJQrCQDArDoeBcUKuoyIEya5U0mOcFCGkkznODraRjdLPf3Tb1Z-dCqzc-WFeWpnJ1FzRIEJgJkeAevf6HruuuqfrvNAgmKVOUDBTsKdvUITSu0NvGb0yz04D1IFQPQvUgVB-E9p2rfcc75_54kSScCEZ_ASmobw8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1648349320</pqid></control><display><type>article</type><title>hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost</title><source>IEEE Electronic Library (IEL)</source><creator>Duan, Sisi ; Peisert, Sean ; Levitt, Karl N.</creator><creatorcontrib>Duan, Sisi ; Peisert, Sean ; Levitt, Karl N.</creatorcontrib><description>We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt the order from the primary and send replies to the clients. As in prior work such as Zyzzyva, when replicas are out of order, clients can detect the inconsistency and help replicas converge on the total ordering. However, we take a different approach than previous work that has four distinct benefits: it requires many fewer cryptographic operations, it moves critical jobs to the clients with no additional costs, faulty clients can be detected and identified, and performance in the presence of client participation will not degrade as long as the primary is correct. The correctness is guaranteed by a three-phase checkpoint subprotocol similar to PBFT, which is tailored to our needs. The protocol is triggered by the primary when a certain number of requests are executed or by clients when they detect an inconsistency.</description><identifier>ISSN: 1545-5971</identifier><identifier>EISSN: 1941-0018</identifier><identifier>DOI: 10.1109/TDSC.2014.2312331</identifier><identifier>CODEN: ITDSCM</identifier><language>eng</language><publisher>Washington: IEEE</publisher><subject>client/server ; Clients ; Computation ; Concurrent computing ; Costs ; Cryptography ; Digital signatures ; Distributed systems ; Fault tolerance ; Fault tolerant systems ; Minimum cost ; Optimization ; Protocol ; Protocols ; Replicas ; Resilience ; Speculation ; state machine replication ; Studies ; Switches</subject><ispartof>IEEE transactions on dependable and secure computing, 2015-01, Vol.12 (1), p.58-70</ispartof><rights>Copyright IEEE Computer Society Jan-Feb 2015</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-38204d64f51de1a2cf77206841fa51f5563c936b134cc98a05bf168a80bba0c83</citedby><cites>FETCH-LOGICAL-c369t-38204d64f51de1a2cf77206841fa51f5563c936b134cc98a05bf168a80bba0c83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6775264$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6775264$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Duan, Sisi</creatorcontrib><creatorcontrib>Peisert, Sean</creatorcontrib><creatorcontrib>Levitt, Karl N.</creatorcontrib><title>hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost</title><title>IEEE transactions on dependable and secure computing</title><addtitle>TDSC</addtitle><description>We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt the order from the primary and send replies to the clients. As in prior work such as Zyzzyva, when replicas are out of order, clients can detect the inconsistency and help replicas converge on the total ordering. However, we take a different approach than previous work that has four distinct benefits: it requires many fewer cryptographic operations, it moves critical jobs to the clients with no additional costs, faulty clients can be detected and identified, and performance in the presence of client participation will not degrade as long as the primary is correct. The correctness is guaranteed by a three-phase checkpoint subprotocol similar to PBFT, which is tailored to our needs. The protocol is triggered by the primary when a certain number of requests are executed or by clients when they detect an inconsistency.</description><subject>client/server</subject><subject>Clients</subject><subject>Computation</subject><subject>Concurrent computing</subject><subject>Costs</subject><subject>Cryptography</subject><subject>Digital signatures</subject><subject>Distributed systems</subject><subject>Fault tolerance</subject><subject>Fault tolerant systems</subject><subject>Minimum cost</subject><subject>Optimization</subject><subject>Protocol</subject><subject>Protocols</subject><subject>Replicas</subject><subject>Resilience</subject><subject>Speculation</subject><subject>state machine replication</subject><subject>Studies</subject><subject>Switches</subject><issn>1545-5971</issn><issn>1941-0018</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkD1PwzAURS0EEqXwAxBLJBaWFD9_xUZioIECUhFDw2w5rqO6SpMSJ6Dy60nUioHp3eHcq6eD0CXgCQBWt9njIp0QDGxCKBBK4QiNQDGIMQZ53GfOeMxVAqfoLIQ1xoRJxUbofjWdZXfRYutsV5rWf7louvsxVesrF81MV7ZRVpeuMZV10bdvV9Gbr_ym20RpHdpzdFKYMriLwx2jj9lTlr7E8_fn1_RhHlsqVBtTSTBbClZwWDowxBZJQrCQDArDoeBcUKuoyIEya5U0mOcFCGkkznODraRjdLPf3Tb1Z-dCqzc-WFeWpnJ1FzRIEJgJkeAevf6HruuuqfrvNAgmKVOUDBTsKdvUITSu0NvGb0yz04D1IFQPQvUgVB-E9p2rfcc75_54kSScCEZ_ASmobw8</recordid><startdate>201501</startdate><enddate>201501</enddate><creator>Duan, Sisi</creator><creator>Peisert, Sean</creator><creator>Levitt, Karl N.</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>JQ2</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201501</creationdate><title>hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost</title><author>Duan, Sisi ; Peisert, Sean ; Levitt, Karl N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-38204d64f51de1a2cf77206841fa51f5563c936b134cc98a05bf168a80bba0c83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>client/server</topic><topic>Clients</topic><topic>Computation</topic><topic>Concurrent computing</topic><topic>Costs</topic><topic>Cryptography</topic><topic>Digital signatures</topic><topic>Distributed systems</topic><topic>Fault tolerance</topic><topic>Fault tolerant systems</topic><topic>Minimum cost</topic><topic>Optimization</topic><topic>Protocol</topic><topic>Protocols</topic><topic>Replicas</topic><topic>Resilience</topic><topic>Speculation</topic><topic>state machine replication</topic><topic>Studies</topic><topic>Switches</topic><toplevel>online_resources</toplevel><creatorcontrib>Duan, Sisi</creatorcontrib><creatorcontrib>Peisert, Sean</creatorcontrib><creatorcontrib>Levitt, Karl N.</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 Computer Science Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering 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><jtitle>IEEE transactions on dependable and secure computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Duan, Sisi</au><au>Peisert, Sean</au><au>Levitt, Karl N.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost</atitle><jtitle>IEEE transactions on dependable and secure computing</jtitle><stitle>TDSC</stitle><date>2015-01</date><risdate>2015</risdate><volume>12</volume><issue>1</issue><spage>58</spage><epage>70</epage><pages>58-70</pages><issn>1545-5971</issn><eissn>1941-0018</eissn><coden>ITDSCM</coden><abstract>We present hBFT, a hybrid, Byzantine fault-tolerant, replicated state machine protocol with optimal resilience. Under normal circumstances, hBFT uses speculation, i.e., replicas directly adopt the order from the primary and send replies to the clients. As in prior work such as Zyzzyva, when replicas are out of order, clients can detect the inconsistency and help replicas converge on the total ordering. However, we take a different approach than previous work that has four distinct benefits: it requires many fewer cryptographic operations, it moves critical jobs to the clients with no additional costs, faulty clients can be detected and identified, and performance in the presence of client participation will not degrade as long as the primary is correct. The correctness is guaranteed by a three-phase checkpoint subprotocol similar to PBFT, which is tailored to our needs. The protocol is triggered by the primary when a certain number of requests are executed or by clients when they detect an inconsistency.</abstract><cop>Washington</cop><pub>IEEE</pub><doi>10.1109/TDSC.2014.2312331</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1545-5971 |
| ispartof | IEEE transactions on dependable and secure computing, 2015-01, Vol.12 (1), p.58-70 |
| issn | 1545-5971 1941-0018 |
| language | eng |
| recordid | cdi_ieee_primary_6775264 |
| source | IEEE Electronic Library (IEL) |
| subjects | client/server Clients Computation Concurrent computing Costs Cryptography Digital signatures Distributed systems Fault tolerance Fault tolerant systems Minimum cost Optimization Protocol Protocols Replicas Resilience Speculation state machine replication Studies Switches |
| title | hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T08%3A41%3A05IST&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=hBFT:%20Speculative%20Byzantine%20Fault%20Tolerance%20with%20Minimum%20Cost&rft.jtitle=IEEE%20transactions%20on%20dependable%20and%20secure%20computing&rft.au=Duan,%20Sisi&rft.date=2015-01&rft.volume=12&rft.issue=1&rft.spage=58&rft.epage=70&rft.pages=58-70&rft.issn=1545-5971&rft.eissn=1941-0018&rft.coden=ITDSCM&rft_id=info:doi/10.1109/TDSC.2014.2312331&rft_dat=%3Cproquest_RIE%3E1816046670%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=1648349320&rft_id=info:pmid/&rft_ieee_id=6775264&rfr_iscdi=true |