Clairvoyant state machine replication
We consider the state machine replication problem in semi-synchronous systems subject to Byzantine server failures. We propose a new solution to the problem in the form of a protocol for the generalized consensus problem. The protocol solves the consensus problem in a setting in which information ab...
Saved in:
| Published in | Information and computation Vol. 285; p. 104701 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.05.2022
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0890-5401 1090-2651 |
| DOI | 10.1016/j.ic.2021.104701 |
Cover
Loading…
| Abstract | We consider the state machine replication problem in semi-synchronous systems subject to Byzantine server failures. We propose a new solution to the problem in the form of a protocol for the generalized consensus problem. The protocol solves the consensus problem in a setting in which information about conflicts between transactions is available (such information can be in the form of transaction read and write sets). Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. For n servers of which f may be faulty, this protocol requires n>4f. |
|---|---|
| AbstractList | We consider the state machine replication problem in semi-synchronous systems subject to Byzantine server failures. We propose a new solution to the problem in the form of a protocol for the generalized consensus problem. The protocol solves the consensus problem in a setting in which information about conflicts between transactions is available (such information can be in the form of transaction read and write sets). Unlike most prior proposals (for generalized or classical consensus), which use a leader to order transactions, this protocol is leaderless, and relies on non-skipping timestamps for transaction ordering. Being leaderless, the protocol does not need to pause for leader elections. The use of non-skipping timestamps permits servers to commit transactions as soon as they know that no conflicting transaction can be ordered earlier. For n servers of which f may be faulty, this protocol requires n>4f. |
| ArticleNumber | 104701 |
| Author | Bazzi, Rida Herlihy, Maurice |
| Author_xml | – sequence: 1 givenname: Rida surname: Bazzi fullname: Bazzi, Rida email: bazzi@asu.edu organization: Arizona State University, Tempe, AZ, USA – sequence: 2 givenname: Maurice surname: Herlihy fullname: Herlihy, Maurice email: mph@cs.brown.edu organization: Brown University, Providence, RI, USA |
| BookMark | eNp1j0FPwzAMRiM0JLrBnWMvHFvstGkbbmiCgTSJy-5RSB2RqkunpJq0f0-mcuVkW_Kzv7dmKz95YuwRoUTA5nkonSk5cExj3QLesAxBQsEbgSuWQZd6UQPesXWMAwCiqJuMPW1H7cJ5umg_53HWM-VHbX6cpzzQaXRGz27y9-zW6jHSw1_dsMP722H7Uey_dp_b131heCfnQlZke9ujTTEqS4JbQVK0wIUQAFXXtjVKXtVNem27xlrzrQnSkm07Xclqw2A5a8IUYyCrTsEddbgoBHW1VINyRl0t1WKZkJcFoRTr7CioaBx5Q70LZGbVT-5_-BeyW1nQ |
| Cites_doi | 10.1145/2673577 10.1145/571637.571640 10.1007/s004460100061 10.1109/TDSC.2006.35 10.1109/TIT.1985.1057074 10.1145/359340.359342 10.1145/98163.98167 10.1007/BF01667080 10.1145/2658994 10.1109/TDSC.2010.70 10.1145/359545.359563 10.1145/1095809.1095817 10.1145/3149.214121 10.1145/279227.279229 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Inc. |
| Copyright_xml | – notice: 2021 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ic.2021.104701 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1090-2651 |
| ExternalDocumentID | 10_1016_j_ic_2021_104701 S089054012100016X |
| GrantInformation_xml | – fundername: The National Science Foundation grantid: 1917990 funderid: https://doi.org/10.13039/100000001 |
| GroupedDBID | --K --M --Z -~X .~1 0R~ 1B1 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CAG COF CS3 DM4 DU5 E3Z EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HVGLF HZ~ H~9 IHE IXB J1W KOM LG5 LX9 M41 MHUIS MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ SDF SDG SDP SES SEW SPC SPCBC SSV SSW SSZ T5K TN5 WH7 WUQ XJT XPP ZMT ZU3 ZY4 ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH |
| ID | FETCH-LOGICAL-c289t-93efdfd1f0213fe52f5e957025550038774192346546f86ffcbae0f5ef78a393 |
| IEDL.DBID | .~1 |
| ISSN | 0890-5401 |
| IngestDate | Tue Jul 01 00:51:00 EDT 2025 Fri Feb 23 02:39:13 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Byzantine Generalized Consensus Ledger State machine |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c289t-93efdfd1f0213fe52f5e957025550038774192346546f86ffcbae0f5ef78a393 |
| OpenAccessLink | https://doi.org/10.1016/j.ic.2021.104701 |
| ParticipantIDs | crossref_primary_10_1016_j_ic_2021_104701 elsevier_sciencedirect_doi_10_1016_j_ic_2021_104701 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | May 2022 2022-05-00 |
| PublicationDateYYYYMMDD | 2022-05-01 |
| PublicationDate_xml | – month: 05 year: 2022 text: May 2022 |
| PublicationDecade | 2020 |
| PublicationTitle | Information and computation |
| PublicationYear | 2022 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Pedone, Schiper (br0300) 2002; 15 Moraru, Andersen, Kaminsky (br0250) 2013 Borran, Schiper (br0090) 2010 Clement, Wong, Alvisi, Dahlin, Marchetti (br0120) 2009 Schneider (br0340) 1990; 22 Cachin (br0100) 2016 Lamport (br0190) May 1998; 16 NEO (br0280) ElGamal (br0140) 1985; 31 Kotla, Alvisi, Dahlin, Clement, Wong (br0170) 2007; vol. 41 Mao, Junqueira, Marzullo (br0210) 2008 Rivest, Shamir, Adleman (br0330) 1978; 21 Ben-Or, Kelmer, Rabin (br0080) 1994 Milosevic, Biely, Schiper (br0240) Sept. 2013 Sutra, Shapiro (br0360) 2011 Cowling, Myers, Liskov, Rodrigues, Shrira (br0130) 2006 Srikanth, Toueg (br0350) 1987; 2 Amir, Coan, Kirsch, Lane (br0020) 2011; 8 Castro, Liskov (br0110) Nov. 2002; 20 Lamport (br0200) March 2005 Mostefaoui, Moumen, Raynal (br0260) 2014 Nakamoto (br0270) 2008 Ben-Or (br0070) 1983 Bazzi, Ding (br0050) 2004 Zielinski (br0380) 2006 Van Renesse, Altinbuken (br0370) 2015; 47 Aublin, Guerraoui, Knežević, Quéma, Vukolić (br0030) Jan 2015; 32 Martin, Alvisi (br0220) 2006; 3 Abd-El-Malek, Ganger, Goodson, Reiter, Wylie (br0010) 2005; 39 Miller, Xia, Croman, Shi, Song (br0230) 2016 Izumi, Masuzawa (br0160) 2006 Fischer, Lynch, Paterson (br0150) 1985; 32 Ongaro, Ousterhout (br0290) 2014 Pires, Ravi, Rodrigues (br0320) 2017 Bellare, Canetti, Krawczyk (br0060) 1996; vol. 96 Aublin, Mokhtar, Quéma (br0040) 2013 Lamport (br0180) Jul 1978; 21 Peluso, Turcu, Palmieri, Losa, Ravindran (br0310) 2016 Miller (10.1016/j.ic.2021.104701_br0230) 2016 Castro (10.1016/j.ic.2021.104701_br0110) 2002; 20 Lamport (10.1016/j.ic.2021.104701_br0200) 2005 Milosevic (10.1016/j.ic.2021.104701_br0240) 2013 Cachin (10.1016/j.ic.2021.104701_br0100) 2016 Clement (10.1016/j.ic.2021.104701_br0120) 2009 Lamport (10.1016/j.ic.2021.104701_br0180) 1978; 21 Mostefaoui (10.1016/j.ic.2021.104701_br0260) 2014 Peluso (10.1016/j.ic.2021.104701_br0310) 2016 Sutra (10.1016/j.ic.2021.104701_br0360) 2011 Van Renesse (10.1016/j.ic.2021.104701_br0370) 2015; 47 Izumi (10.1016/j.ic.2021.104701_br0160) 2006 NEO (10.1016/j.ic.2021.104701_br0280) Schneider (10.1016/j.ic.2021.104701_br0340) 1990; 22 Ben-Or (10.1016/j.ic.2021.104701_br0070) 1983 Borran (10.1016/j.ic.2021.104701_br0090) 2010 Aublin (10.1016/j.ic.2021.104701_br0030) 2015; 32 Mao (10.1016/j.ic.2021.104701_br0210) 2008 Aublin (10.1016/j.ic.2021.104701_br0040) 2013 ElGamal (10.1016/j.ic.2021.104701_br0140) 1985; 31 Fischer (10.1016/j.ic.2021.104701_br0150) 1985; 32 Ongaro (10.1016/j.ic.2021.104701_br0290) 2014 Rivest (10.1016/j.ic.2021.104701_br0330) 1978; 21 Moraru (10.1016/j.ic.2021.104701_br0250) 2013 Amir (10.1016/j.ic.2021.104701_br0020) 2011; 8 Bellare (10.1016/j.ic.2021.104701_br0060) 1996; vol. 96 Srikanth (10.1016/j.ic.2021.104701_br0350) 1987; 2 Bazzi (10.1016/j.ic.2021.104701_br0050) 2004 Zielinski (10.1016/j.ic.2021.104701_br0380) 2006 Abd-El-Malek (10.1016/j.ic.2021.104701_br0010) 2005; 39 Cowling (10.1016/j.ic.2021.104701_br0130) 2006 Kotla (10.1016/j.ic.2021.104701_br0170) 2007; vol. 41 Nakamoto (10.1016/j.ic.2021.104701_br0270) 2008 Lamport (10.1016/j.ic.2021.104701_br0190) 1998; 16 Pedone (10.1016/j.ic.2021.104701_br0300) 2002; 15 Ben-Or (10.1016/j.ic.2021.104701_br0080) 1994 Pires (10.1016/j.ic.2021.104701_br0320) 2017 Martin (10.1016/j.ic.2021.104701_br0220) 2006; 3 |
| References_xml | – start-page: 358 year: 2013 end-page: 372 ident: br0250 article-title: There is more consensus in egalitarian parliaments publication-title: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles – volume: 20 start-page: 398 year: Nov. 2002 end-page: 461 ident: br0110 article-title: Practical byzantine fault tolerance and proactive recovery publication-title: ACM Trans. Comput. Syst. – start-page: 153 year: 2009 end-page: 168 ident: br0120 article-title: Making byzantine fault tolerant systems tolerate byzantine faults publication-title: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation – volume: 3 start-page: 202 year: 2006 end-page: 215 ident: br0220 article-title: Fast byzantine consensus publication-title: IEEE Trans. Dependable Secure Comput. – start-page: 183 year: 1994 end-page: 192 ident: br0080 article-title: Asynchronous secure computations with optimal resilience (extended abstract) publication-title: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing – start-page: 369 year: 2008 end-page: 384 ident: br0210 article-title: Mencius: building efficient replicated state machines for wans publication-title: Proceedings of the 8th OSDI Conference – volume: 32 year: Jan 2015 ident: br0030 article-title: The next 700 BFT protocols publication-title: ACM Trans. Comput. Syst. – volume: 31 start-page: 469 year: 1985 end-page: 472 ident: br0140 article-title: A public key cryptosystem and a signature scheme based on discrete logarithms publication-title: IEEE Trans. Inf. Theory – volume: vol. 41 start-page: 45 year: 2007 end-page: 58 ident: br0170 article-title: Zyzzyva: Speculative Byzantine Fault Tolerance publication-title: ACM SIGOPS Operating Systems Review – volume: 16 start-page: 133 year: May 1998 end-page: 169 ident: br0190 article-title: The part-time parliament publication-title: ACM Trans. Comput. Syst. – volume: vol. 96 start-page: 1 year: 1996 end-page: 15 ident: br0060 article-title: Keying Hash Functions for Message Authentication publication-title: Crypto – year: 2016 ident: br0100 article-title: Architecture of the hyperledger blockchain fabric publication-title: Workshop on Distributed Cryptocurrencies and Consensus Ledgers – start-page: 305 year: 2014 end-page: 320 ident: br0290 article-title: In search of an understandable consensus algorithm publication-title: Proceedings of the USENIX Annual Technical Conference – volume: 8 start-page: 564 year: 2011 end-page: 577 ident: br0020 article-title: Prime: Byzantine replication under attack publication-title: IEEE Trans. Dependable Secure Comput. – ident: br0280 article-title: Neo contract whitepaper – start-page: 24 year: 2006 end-page: 33 ident: br0380 article-title: Optimistically terminating consensus: all asynchronous consensus protocols in one framework publication-title: Parallel and Distributed Computing, 2006. ISPDC'06. The Fifth International Symposium on – start-page: 27 year: 1983 end-page: 30 ident: br0070 article-title: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols publication-title: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing – start-page: 67 year: 2010 end-page: 78 ident: br0090 article-title: A leader-free byzantine consensus algorithm publication-title: Proceedings of the 11th Int. Conf. on Dist. Computing and Networking – volume: 15 start-page: 97 year: 2002 end-page: 107 ident: br0300 article-title: Handling message semantics with generic broadcast protocols publication-title: Distrib. Comput. – start-page: 203 year: 2017 end-page: 218 ident: br0320 article-title: Generalized paxos made byzantine (and less complex) publication-title: Stabilization, Safety, and Security of Distributed Systems – volume: 21 year: Jul 1978 ident: br0180 article-title: Time, clocks, and the ordering of events in a distributed system publication-title: Commun. ACM – volume: 21 start-page: 120 year: 1978 end-page: 126 ident: br0330 article-title: A method for obtaining digital signatures and public-key cryptosystems publication-title: Commun. ACM – start-page: 61 year: Sept. 2013 end-page: 70 ident: br0240 article-title: Bounded delay in byzantine-tolerant state machine replication publication-title: 2013 IEEE 32nd International Symposium on Reliable Distributed Systems – volume: 47 start-page: 42 year: 2015 ident: br0370 article-title: Paxos made moderately complex publication-title: ACM Comput. Surv. – start-page: 405 year: 2004 end-page: 419 ident: br0050 article-title: Non-skipping timestamps for byzantine data storage systems publication-title: Int. Symp. on Dist. Comp. (DISC) – volume: 32 start-page: 374 year: 1985 end-page: 382 ident: br0150 article-title: Impossibility of distributed consensus with one faulty process publication-title: J. ACM – volume: 39 start-page: 59 year: 2005 end-page: 74 ident: br0010 article-title: Fault-scalable byzantine fault-tolerant services publication-title: Oper. Syst. Rev. – start-page: 255 year: 2011 end-page: 264 ident: br0360 article-title: Fast genuine generalized consensus publication-title: Reliable Distributed Systems (SRDS), 2011 30th IEEE Symposium on – volume: 2 start-page: 80 year: 1987 end-page: 94 ident: br0350 article-title: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms publication-title: Distrib. Comput. – year: 2008 ident: br0270 article-title: Bitcoin: A Peer-to-Peer Electronic Cash System – year: March 2005 ident: br0200 article-title: Generalized consensus and paxos – start-page: 31 year: 2016 end-page: 42 ident: br0230 article-title: The honey badger of BFT protocols publication-title: ACM CCS – start-page: 297 year: 2013 end-page: 306 ident: br0040 article-title: RBFT: Redundant Byzantine Fault Tolerance publication-title: Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems – start-page: 2 year: 2014 end-page: 9 ident: br0260 article-title: Signature-free asynchronous byzantine consensus with publication-title: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing – start-page: 156 year: 2016 end-page: 167 ident: br0310 article-title: Making fast consensus generally faster publication-title: Dependable Systems and Networks (DSN), 2016 46th Annual IEEE/IFIP International Conference on – start-page: 177 year: 2006 end-page: 190 ident: br0130 article-title: Hq replication: a hybrid quorum protocol for byzantine fault tolerance publication-title: Proceedings of the 7th Symposium on Operating Systems Design and Implementation – start-page: 224 year: 2006 end-page: 237 ident: br0160 article-title: One-step consensus solvability publication-title: Proceedings of the 20th International Conference on Distributed Computing – volume: 22 start-page: 299 year: 1990 end-page: 319 ident: br0340 article-title: Implementing fault-tolerant services using the state machine approach: a tutorial publication-title: ACM Comput. Surv. – ident: 10.1016/j.ic.2021.104701_br0280 – start-page: 31 year: 2016 ident: 10.1016/j.ic.2021.104701_br0230 article-title: The honey badger of BFT protocols – start-page: 24 year: 2006 ident: 10.1016/j.ic.2021.104701_br0380 article-title: Optimistically terminating consensus: all asynchronous consensus protocols in one framework – start-page: 177 year: 2006 ident: 10.1016/j.ic.2021.104701_br0130 article-title: Hq replication: a hybrid quorum protocol for byzantine fault tolerance – volume: 47 start-page: 42 issue: 3 year: 2015 ident: 10.1016/j.ic.2021.104701_br0370 article-title: Paxos made moderately complex publication-title: ACM Comput. Surv. doi: 10.1145/2673577 – start-page: 405 year: 2004 ident: 10.1016/j.ic.2021.104701_br0050 article-title: Non-skipping timestamps for byzantine data storage systems – volume: vol. 41 start-page: 45 year: 2007 ident: 10.1016/j.ic.2021.104701_br0170 article-title: Zyzzyva: Speculative Byzantine Fault Tolerance – year: 2008 ident: 10.1016/j.ic.2021.104701_br0270 – start-page: 305 year: 2014 ident: 10.1016/j.ic.2021.104701_br0290 article-title: In search of an understandable consensus algorithm – volume: 20 start-page: 398 issue: 4 year: 2002 ident: 10.1016/j.ic.2021.104701_br0110 article-title: Practical byzantine fault tolerance and proactive recovery publication-title: ACM Trans. Comput. Syst. doi: 10.1145/571637.571640 – year: 2016 ident: 10.1016/j.ic.2021.104701_br0100 article-title: Architecture of the hyperledger blockchain fabric – start-page: 156 year: 2016 ident: 10.1016/j.ic.2021.104701_br0310 article-title: Making fast consensus generally faster – start-page: 358 year: 2013 ident: 10.1016/j.ic.2021.104701_br0250 article-title: There is more consensus in egalitarian parliaments – volume: 15 start-page: 97 issue: 2 year: 2002 ident: 10.1016/j.ic.2021.104701_br0300 article-title: Handling message semantics with generic broadcast protocols publication-title: Distrib. Comput. doi: 10.1007/s004460100061 – start-page: 224 year: 2006 ident: 10.1016/j.ic.2021.104701_br0160 article-title: One-step consensus solvability – volume: 3 start-page: 202 issue: 3 year: 2006 ident: 10.1016/j.ic.2021.104701_br0220 article-title: Fast byzantine consensus publication-title: IEEE Trans. Dependable Secure Comput. doi: 10.1109/TDSC.2006.35 – start-page: 183 year: 1994 ident: 10.1016/j.ic.2021.104701_br0080 article-title: Asynchronous secure computations with optimal resilience (extended abstract) – volume: 31 start-page: 469 issue: 4 year: 1985 ident: 10.1016/j.ic.2021.104701_br0140 article-title: A public key cryptosystem and a signature scheme based on discrete logarithms publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1985.1057074 – volume: vol. 96 start-page: 1 year: 1996 ident: 10.1016/j.ic.2021.104701_br0060 article-title: Keying Hash Functions for Message Authentication – volume: 21 start-page: 120 issue: 2 year: 1978 ident: 10.1016/j.ic.2021.104701_br0330 article-title: A method for obtaining digital signatures and public-key cryptosystems publication-title: Commun. ACM doi: 10.1145/359340.359342 – volume: 22 start-page: 299 issue: 4 year: 1990 ident: 10.1016/j.ic.2021.104701_br0340 article-title: Implementing fault-tolerant services using the state machine approach: a tutorial publication-title: ACM Comput. Surv. doi: 10.1145/98163.98167 – volume: 2 start-page: 80 issue: 2 year: 1987 ident: 10.1016/j.ic.2021.104701_br0350 article-title: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms publication-title: Distrib. Comput. doi: 10.1007/BF01667080 – start-page: 203 year: 2017 ident: 10.1016/j.ic.2021.104701_br0320 article-title: Generalized paxos made byzantine (and less complex) – volume: 32 issue: 4 year: 2015 ident: 10.1016/j.ic.2021.104701_br0030 article-title: The next 700 BFT protocols publication-title: ACM Trans. Comput. Syst. doi: 10.1145/2658994 – start-page: 67 year: 2010 ident: 10.1016/j.ic.2021.104701_br0090 article-title: A leader-free byzantine consensus algorithm – start-page: 255 year: 2011 ident: 10.1016/j.ic.2021.104701_br0360 article-title: Fast genuine generalized consensus – volume: 8 start-page: 564 issue: 4 year: 2011 ident: 10.1016/j.ic.2021.104701_br0020 article-title: Prime: Byzantine replication under attack publication-title: IEEE Trans. Dependable Secure Comput. doi: 10.1109/TDSC.2010.70 – start-page: 153 year: 2009 ident: 10.1016/j.ic.2021.104701_br0120 article-title: Making byzantine fault tolerant systems tolerate byzantine faults – start-page: 27 year: 1983 ident: 10.1016/j.ic.2021.104701_br0070 article-title: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols – year: 2005 ident: 10.1016/j.ic.2021.104701_br0200 – volume: 21 issue: 7 year: 1978 ident: 10.1016/j.ic.2021.104701_br0180 article-title: Time, clocks, and the ordering of events in a distributed system publication-title: Commun. ACM doi: 10.1145/359545.359563 – start-page: 61 year: 2013 ident: 10.1016/j.ic.2021.104701_br0240 article-title: Bounded delay in byzantine-tolerant state machine replication – volume: 39 start-page: 59 issue: 5 year: 2005 ident: 10.1016/j.ic.2021.104701_br0010 article-title: Fault-scalable byzantine fault-tolerant services publication-title: Oper. Syst. Rev. doi: 10.1145/1095809.1095817 – start-page: 297 year: 2013 ident: 10.1016/j.ic.2021.104701_br0040 article-title: RBFT: Redundant Byzantine Fault Tolerance – start-page: 2 year: 2014 ident: 10.1016/j.ic.2021.104701_br0260 article-title: Signature-free asynchronous byzantine consensus with t<n/3, O(n2) messages and O(1) expected time – volume: 32 start-page: 374 issue: 2 year: 1985 ident: 10.1016/j.ic.2021.104701_br0150 article-title: Impossibility of distributed consensus with one faulty process publication-title: J. ACM doi: 10.1145/3149.214121 – volume: 16 start-page: 133 issue: 2 year: 1998 ident: 10.1016/j.ic.2021.104701_br0190 article-title: The part-time parliament publication-title: ACM Trans. Comput. Syst. doi: 10.1145/279227.279229 – start-page: 369 year: 2008 ident: 10.1016/j.ic.2021.104701_br0210 article-title: Mencius: building efficient replicated state machines for wans |
| SSID | ssj0011546 |
| Score | 2.3397877 |
| Snippet | We consider the state machine replication problem in semi-synchronous systems subject to Byzantine server failures. We propose a new solution to the problem in... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 104701 |
| SubjectTerms | Byzantine Consensus Generalized Ledger State machine |
| Title | Clairvoyant state machine replication |
| URI | https://dx.doi.org/10.1016/j.ic.2021.104701 |
| Volume | 285 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB5KvejBR1Wsj5KDHjzEvLPZYwmW-qCIVshtSbK7EKmxlHj1t7uz2ZSKePEUCLuwzLIz3zDffANwSWIaC5Xu2Jwk3Fb4X9oFQSFXN1T42sPBVlrtcxZPX8P7LMp6kHa9MEirNL6_9enaW5s_jrGms6wq58VNKOINVMBC4JJhB3tIkNZ387WmeaDajK5XqsVIAvBMqbLleFUoYuh7WOgkZizMr9C0EW4m-7BrcKI1bo9yAD1RD2Cvm8FgmSc5gJ0NQcFDuEoXebVCZYq6sXSvkPWu2ZLCWol1pfoI5pPbeTq1zSAEu1T5UGPTQEguuSfVWQMpIl9GgkYE04EIS3sKwiFQQ2m0WCaxlGWRC1ctkiTJAxocQ7_-qMUJWILnPvFy7qrQGIZ5mRSoFpmUnFLJCxoO4bozAVu2ches44G9sapkaC7WmmsIQWcj9uPKmPLGf-46_deuM9j2se9AMw3Pod-sPsWFQgNNMdLXPYKtcfr8-ITfu4fp7BtKprI0 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VdAAGHgVEeWaAgSFq3o7HqqJKaclCkbpZSWxLQRCqKPx_fIlTFSEWVsuWrLN8953uu-8A7khIQ6HSHYuTiFsK_0srIyjkavsKXzs42KpR-0zC-NV_WgWrHky6XhikVWrf3_r0xlvrlZG25mhdFKMXO6KIN1ABC4HLagf6qE7lG9Afz-ZxsikmOLpfR-1HHoCjq5UtzatAHUPXwVon0ZNhfkWnrYgzPYIDDRXNcXubY-iJcgCH3RgGU__KAexvaQqewP3kPS0qFKcoa7NpFzI_GsKkMCuxKVafwnL6uJzElp6FYOUqJaot6gnJJXekuqsnReDKQNCAYEYQYHVPoTjEaqiOFsoolDLPUmGrTZJEqUe9MzDKz1Kcgyl46hIn5baKjr6f5lGGgpFRzimVPKP-EB46E7B1q3jBOirYGytyhuZirbmG4HU2Yj9ejSmH_Oepi3-duoXdePm8YItZMr-EPRfbEBri4RUYdfUlrhU4qLMb_fjf8ZKzUA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Clairvoyant+state+machine+replication&rft.jtitle=Information+and+computation&rft.au=Bazzi%2C+Rida&rft.au=Herlihy%2C+Maurice&rft.date=2022-05-01&rft.issn=0890-5401&rft.volume=285&rft.spage=104701&rft_id=info:doi/10.1016%2Fj.ic.2021.104701&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ic_2021_104701 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon |