Most Cited Byzantine Consensus Publications

Last updated October 26th, 2017.

    1. CONCURRENCY CONTROL AND RECOVERY IN DATABASE SYSTEMS“. PA Bernstein, V Hadzilacos, N Goodman. 1987. courses.cs.washington.edu . 5808 cites.
    2. Distributed algorithms“. NA Lynch. 1996. books.google.com . 5319 cites.
    3. The Byzantine generals problem“. L Lamport, R Shostak, M Pease. 1982. dl.acm.org ACM Transactions on Programming …. 4827 cites.
    4. Impossibility of distributed consensus with one faulty process“. MJ Fischer, NA Lynch, MS Paterson. 1985. dl.acm.org Journal of the ACM (JACM). 4421 cites.
    5. How to play any mental game“. O Goldreich, S Micali, A Wigderson. 1987. dl.acm.org Proceedings of the nineteenth …. 3580 cites.
    6. Unreliable failure detectors for reliable distributed systems“. TD Chandra, S Toueg. 1996. dl.acm.org Journal of the ACM (JACM). 3095 cites.
    7. Oceanstore: An architecture for global-scale persistent storage“. J Kubiatowicz, D Bindel, Y Chen, S Czerwinski, …. 2000. dl.acm.org ACM Sigplan …. 3078 cites.
    8. Completeness theorems for non-cryptographic fault-tolerant distributed computation“. M Ben-Or, S Goldwasser, A Wigderson. 1988. dl.acm.org Proceedings of the twentieth …. 2221 cites.
    9. Implementing fault-tolerant services using the state machine approach: A tutorial“. FB Schneider. 1990. dl.acm.org ACM Computing Surveys (CSUR). 2218 cites.
    10. PVS: A prototype verification system“. S Owre, JM Rushby, N Shankar. 1992. Springer International Conference on Automated …. 1948 cites.
    11. Internet time synchronization: the network time protocol“. DL Mills. 1991. ieeexplore.ieee.org IEEE Transactions on communications. 1926 cites.
    12. Multiparty unconditionally secure protocols“. D Chaum, C Crépeau, I Damgard. 1988. dl.acm.org … annual ACM symposium on Theory of …. 1536 cites.
    13. Practical Byzantine fault tolerance“. M Castro, B Liskov. 1999. usenix.org OSDI. 1466 cites.
    14. Consensus in the presence of partial synchrony“. C Dwork, N Lynch, L Stockmeyer. 1988. dl.acm.org Journal of the ACM (JACM). 1252 cites.
    15. A practical scheme for non-interactive verifiable secret sharing“. P Feldman. 1987. ieeexplore.ieee.org Foundations of Computer Science, 1987., 28th …. 1165 cites.
    16. The weakest failure detector for solving consensus“. TD Chandra, V Hadzilacos, S Toueg. 1996. dl.acm.org Journal of the ACM (JACM). 1160 cites.
    17. Practical Byzantine fault tolerance and proactive recovery“. M Castro, B Liskov. 2002. dl.acm.org ACM Transactions on Computer Systems (TOCS). 998 cites.
    18. Verifiable secret sharing and multiparty protocols with honest majority“. T Rabin, M Ben-Or. 1989. dl.acm.org Proceedings of the twenty-first annual ACM …. 918 cites.
    19. Practical threshold signatures“. V Shoup. 2000. Springer Advances in Cryptology—EUROCRYPT 2000. 793 cites.
    20. PRISM: A tool for automatic verification of probabilistic systems“. A Hinton, M Kwiatkowska, G Norman, …. 2006. Springer … Conference on Tools and …. 757 cites.
    21. On the minimal synchronism needed for distributed consensus“. D Dolev, C Dwork, L Stockmeyer. 1987. dl.acm.org Journal of the ACM (JACM). 744 cites.
    22. Byzantine quorum systems“. D Malkhi, M Reiter. 1998. Springer Distributed computing. 673 cites.
    23. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols“. M Ben-Or. 1983. dl.acm.org Proceedings of the second annual ACM symposium on …. 655 cites.
    24. Pond: The OceanStore Prototype.“. SC Rhea, PR Eaton, D Geels, H Weatherspoon, …. 2003. usenix.org FAST. 639 cites.
    25. PRISM: Probabilistic symbolic model checker“. M Kwiatkowska, G Norman, D Parker. 2002. Springer Computer Performance Evaluation …. 626 cites.
    26. Byzantine theology: Historical trends and doctrinal themes“. J Meyendorff. 1979. books.google.com . 616 cites.
    27. How to withstand mobile virus attacks“. R Ostrovsky, M Yung. 1991. dl.acm.org Proceedings of the tenth annual ACM symposium …. 595 cites.
    28. Total order broadcast and multicast algorithms: Taxonomy and survey“. X Défago, A Schiper, P Urbán. 2004. dl.acm.org ACM Computing Surveys (CSUR). 573 cites.
    29. Corporate identity and corporate communications: creating a competitive advantage“. JMT Balmer, ER Gray. 1999. emeraldinsight.com Corporate Communications: An …. 546 cites.
    30. Corporate identity and corporate communications: creating a competitive advantage“. JMT Balmer, ER Gray. 1999. emeraldinsight.com Corporate Communications: An …. 546 cites.
    31. Atomic broadcast: From simple message diffusion to Byzantine agreement“. F Cristian, H Aghili, R Strong, D Dolev. 1986. pdfs.semanticscholar.org . 535 cites.
    32. The Byzantine generals strike again“. D Dolev. 1982. Elsevier Journal of algorithms. 530 cites.
    33. Handbook of game theory with economic applications“. RJ Aumann, S Hart. 1992. books.google.com . 523 cites.
    34. Handbook of game theory with economic applications“. RJ Aumann, S Hart. 1992. books.google.com . 523 cites.
    35. Optimal clock synchronization“. TK Srikanth, S Toueg. 1987. dl.acm.org Journal of the ACM (JACM). 511 cites.
    36. The consensus problem in fault-tolerant computing“. M Barborak, A Dahbura, M Malek. 1993. dl.acm.org ACM Computing Surveys (CSur). 503 cites.
    37. A lower bound for the time to assure interactive consistency“. MJ Fischer, NA Lynch. 1982. Elsevier Information processing letters. 468 cites.
    38. Karma: A secure economic framework for peer-to-peer resource sharing“. V Vishnumurthy, S Chandrakumar, …. 2003. kayapo.tribler.org Workshop on Economics …. 465 cites.
    39. Randomized byzantine generals“. MO Rabin. 1983. ieeexplore.ieee.org Foundations of Computer Science, 1983., 24th …. 448 cites.
    40. Self-checking and fault-tolerant digital design“. PK Lala. 2001. books.google.com . 440 cites.
    41. Authenticated algorithms for Byzantine agreement“. D Dolev, HR Strong. 1983. SIAM SIAM Journal on Computing. 429 cites.
    42. New multiparty authentication services and key agreement protocols“. G Ateniese, M Steiner, G Tsudik. 2000. ieeexplore.ieee.org IEEE journal on selected …. 426 cites.
    43. Reaching approximate agreement in the presence of faults“. D Dolev, NA Lynch, SS Pinter, EW Stark, …. 1986. dl.acm.org Journal of the ACM …. 417 cites.
    44. The Mur ϕ verification system“. DL Dill. 1996. Springer International Conference on Computer Aided …. 410 cites.
    45. Zyzzyva: speculative byzantine fault tolerance“. R Kotla, L Alvisi, M Dahlin, A Clement, …. 2007. dl.acm.org ACM SIGOPS Operating …. 404 cites.
    46. Network layer protocols with byzantine robustness“. RJ Perlman. 1988. dspace.mit.edu . 395 cites.
    47. Asynchronous consensus and broadcast protocols“. G Bracha, S Toueg. 1985. dl.acm.org Journal of the ACM (JACM). 387 cites.
    48. Broadcast protocols for distributed systems“. PM Melliar-Smith, LE Moser, …. 1990. ieeexplore.ieee.org IEEE Transactions on …. 374 cites.
    49. The consensus problem in unreliable distributed systems (a brief survey)“. MJ Fischer. 1983. Springer … Conference on Fundamentals of Computation Theory. 369 cites.
    50. Using time instead of timeout for fault-tolerant distributed systems.“. L Lamport. 1984. dl.acm.org ACM Transactions on Programming Languages and …. 363 cites.
    51. Distributed systems“. F Schneider, A Tanenbaum. 1993. researchgate.net ch. Replication Management using …. 348 cites.
    52. Memory requirements for agreement among unreliable asynchronous processes“. MC Loui, HH Abu-Amara. 1987. Advances in Computing research. 346 cites.
    53. Closure and convergence: A foundation of fault-tolerant computing“. A Arora, M Gouda. 1993. ieeexplore.ieee.org IEEE Transactions on Software …. 340 cites.
    54. PeerReview: Practical accountability for distributed systems“. A Haeberlen, P Kouznetsov, P Druschel. 2007. dl.acm.org ACM SIGOPS operating …. 338 cites.
    55. Separating agreement from execution for Byzantine fault tolerant services“. J Yin, JP Martin, A Venkataramani, L Alvisi, …. 2003. dl.acm.org ACM SIGOPS Operating …. 337 cites.
    56. Bus architectures for safety-critical embedded systems“. J Rushby. 2001. Springer Embedded Software. 335 cites.
    57. Maintenance-free global data storage“. S Rhea, C Wells, P Eaton, D Geels, …. 2001. ieeexplore.ieee.org IEEE internet …. 334 cites.
    58. Fast paxos“. L Lamport. 2006. Springer Distributed Computing. 333 cites.
    59. Detecting genuine multipartite continuous-variable entanglement“. P van Loock, A Furusawa. 2003. APS Physical Review A. 332 cites.
    60. Secure agreement protocols: Reliable and atomic group multicast in Rampart“. MK Reiter. 1994. dl.acm.org Proceedings of the 2nd ACM Conference on Computer …. 319 cites.
    61. Fault-scalable Byzantine fault-tolerant services“. M Abd-El-Malek, GR Ganger, GR Goodson, …. 2005. dl.acm.org ACM SIGOPS …. 317 cites.
    62. Multi party computations: past and present“. S Goldwasser. 1997. dl.acm.org Proceedings of the sixteenth annual ACM symposium …. 313 cites.
    63. Byzantine generals in action: Implementing fail-stop processors“. FB Schneider. 1984. dl.acm.org ACM Transactions on Computer Systems (TOCS). 310 cites.
    64. Foundations of Secure Interactive Computing.“. D Beaver. 1991. Springer Crypto. 306 cites.
    65. Fault tolerance in collaborative sensor networks for target detection“. T Clouqueur, KK Saluja, …. 2004. ieeexplore.ieee.org IEEE transactions on …. 293 cites.
    66. The MAFT architecture for distributed fault tolerance“. RM Keichafer, CJ Walter, AM Finn, …. 1988. ieeexplore.ieee.org IEEE Transactions on …. 279 cites.
    67. Replicated distributed programs“. EC Cooper. 1985. dl.acm.org . 279 cites.
    68. The Delta-4 approach to dependability in open distributed computing systems.“. D Powell, G Bonn, DT Seaton, P Verissimo, …. 1988. pdfs.semanticscholar.org …. 276 cites.
    69. BAR fault tolerance for cooperative services“. AS Aiyer, L Alvisi, A Clement, M Dahlin, …. 2005. dl.acm.org ACM SIGOPS operating …. 274 cites.
    70. Byzantine modification detection in multicast networks using randomized network coding“. T Ho, B Leong, R Koetter, M Médard, …. 2004. ieeexplore.ieee.org … Theory, 2004. ISIT …. 272 cites.
    71. Early consensus in an asynchronous system with a weak failure detector“. A Schiper. 1997. Springer Distributed Computing. 270 cites.
    72. Transmission-line theory“. V King, J Saia. 1955. Citeseer 30 [7]-, Transmission-line Theory. 267 cites.
    73. Authenticated group key agreement and friends“. G Ateniese, M Steiner, G Tsudik. 1998. dl.acm.org … of the 5th ACM conference on …. 266 cites.
    74. Early stopping in Byzantine agreement“. D Dolev, R Reischuk, HR Strong. 1990. dl.acm.org Journal of the ACM (JACM). 261 cites.
    75. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance“. J Cowling, D Myers, B Liskov, R Rodrigues, …. 2006. dl.acm.org Proceedings of the 7th …. 261 cites.
    76. Toward a cloud computing research agenda“. K Birman, G Chockler, R van Renesse. 2009. dl.acm.org ACM SIGACt News. 259 cites.
    77. The Rampart toolkit for building high-integrity services“. MK Reiter. 1995. Springer Theory and Practice in Distributed Systems. 250 cites.
    78. Optimal algorithms for Byzantine agreement“. P Feldman, S Micali. 1988. dl.acm.org Proceedings of the twentieth annual ACM …. 246 cites.
    79. Allocation and scheduling of precedence-related periodic tasks“. K Ramamritham. 1995. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 241 cites.
    80. Fast randomized consensus using shared memory“. J Aspnes, M Herlihy. 1990. Elsevier Journal of algorithms. 239 cites.
    81. On the possibility and impossibility of achieving clock synchronization“. D Dolev, J Halpern, HR Strong. 1984. dl.acm.org … of the sixteenth annual ACM symposium …. 238 cites.
    82. An asynchronous [(n-1)/3]-resilient consensus protocol“. G Bracha. 1984. dl.acm.org Proceedings of the third annual ACM symposium on …. 235 cites.
    83. Knowledge and common knowledge in a Byzantine environment: Crash failures“. C Dwork, Y Moses. 1990. Elsevier Information and Computation. 233 cites.
    84. Fast byzantine consensus“. JP Martin, L Alvisi. 2006. ieeexplore.ieee.org IEEE Transactions on Dependable and …. 232 cites.
    85. Intrusion-tolerant architectures: Concepts and design“. P Veríssimo, N Neves, M Correia. 2003. Springer Architecting Dependable Systems. 230 cites.
    86. Intrusion-tolerant architectures: Concepts and design“. P Veríssimo, N Neves, M Correia. 2003. Springer Architecting Dependable Systems. 230 cites.
    87. Efficient Byzantine-tolerant erasure-coded storage“. GR Goodson, JJ Wylie, GR Ganger, …. 2004. ieeexplore.ieee.org … Systems and Networks …. 223 cites.
    88. Design and analysis of distributed algorithms“. N Santoro. 2006. books.google.com . 220 cites.
    89. Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography“. C Cachin, K Kursawe, V Shoup. 2000. dl.acm.org Proceedings of the nineteenth annual …. 216 cites.
    90. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults.“. A Clement, EL Wong, L Alvisi, M Dahlin, M Marchetti. 2009. static.usenix.org NSDI. 215 cites.
    91. Fault-tolerant clock synchronization“. JY Halpern, B Simons, R Strong, D Dolev. 1984. dl.acm.org Proceedings of the third …. 215 cites.
    92. Interactive consistency with multiple failure modes“. P Thambidurai, YK Park. 1988. ieeexplore.ieee.org Reliable Distributed Systems, 1988 …. 211 cites.
    93. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony“. E Gafni. 1998. dl.acm.org Proceedings of the seventeenth annual ACM …. 211 cites.
    94. Fast asynchronous Byzantine agreement with optimal resilience“. R Canetti, T Rabin. 1993. dl.acm.org Proceedings of the twenty-fifth annual ACM …. 209 cites.
    95. PRISM 2.0: A tool for probabilistic model checking“. M Kwiatkowska, G Norman, …. 2004. ieeexplore.ieee.org Quantitative Evaluation of …. 204 cites.
    96. Taming aggressive replication in the Pangaea wide-area file system“. Y Saito, C Karamanolis, M Karlsson, …. 2002. dl.acm.org ACM SIGOPS Operating …. 204 cites.
    97. Consensus with dual failure modes“. FJ Meyer, DK Pradhan. 1991. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 201 cites.
    98. Heartbeat: A timeout-free failure detector for quiescent reliable communication“. MK Aguilera, W Chen, S Toueg. 1997. Springer International Workshop on Distributed …. 195 cites.
    99. Hierarchical cubic networks“. K Ghose, KR Desai. 1995. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 194 cites.
    100. Programming simultaneous actions using common knowledge“. Y Moses, MR Tuttle. 1988. Springer Algorithmica. 194 cites.
    101. A new fault-tolerant algorithm for clock synchronization“. J Lundelius, N Lynch. 1984. dl.acm.org Proceedings of the third annual ACM symposium …. 189 cites.
    102. Understanding protocols for Byzantine clock synchronization“. FB Schneider. 1987. ecommons.cornell.edu . 185 cites.
    103. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms“. TK Srikanth, S Toueg. 1987. Springer Distributed Computing. 185 cites.
    104. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability“. M Waidner, B Pfitzmann. 1989. researchgate.net J.-J. Quisquater and J. Vandewalle …. 182 cites.
    105. Revisiting the relationship between non-blocking atomic commitment and consensus“. R Guerraoui. 1995. Springer Distributed Algorithms. 179 cites.
    106. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement“. A Bar-Noy, D Dolev, C Dwork, HR Strong. 1987. dl.acm.org Proceedings of the sixth …. 176 cites.
    107. Easy impossibility proofs for distributed consensus problems“. MJ Fischer, NA Lynch, M Merritt. 1986. Springer Distributed Computing. 172 cites.
    108. Secure and scalable replication in Phalanx“. D Malkhi, MK Reiter. 1998. ieeexplore.ieee.org Reliable Distributed Systems, 1998 …. 172 cites.
    109. Efficient Multiparty Protocols Using Circuit Randomization.“. D Beaver. 1991. Springer Crypto. 170 cites.
    110. Atomic broadcast: From simple message diffusion to Byzantine agreement“. F Cristian, H Aghili, R Strong, D Dolev. 1995. Elsevier Information and Computation. 167 cites.
    111. Bounds on information exchange for Byzantine agreement“. D Dolev, R Reischuk. 1985. dl.acm.org Journal of the ACM (JACM). 167 cites.
    112. Distributed agreement in the presence of processor and communication faults“. KJ Perry, S Toueg. 1986. ieeexplore.ieee.org IEEE Transactions on Software …. 167 cites.
    113. SITAR: A scalable intrusion-tolerant architecture for distributed services“. F Wang, F Gong, C Sargor, …. 2003. users.nccs.gov Workshop on …. 167 cites.
    114. Secure and efficient asynchronous broadcast protocols“. C Cachin, K Kursawe, F Petzold, V Shoup. 2001. Springer Annual International …. 165 cites.
    115. Asynchronous secure computation“. M Ben-Or, R Canetti, O Goldreich. 1993. dl.acm.org Proceedings of the twenty-fifth annual …. 165 cites.
    116. Polynomial algorithms for multiple processor agreement“. D Dolev, HR Strong. 1982. dl.acm.org Proceedings of the fourteenth annual ACM …. 163 cites.
    117. How to build a highly available system using consensus“. BW Lampson. 1996. Springer International Workshop on Distributed Algorithms. 163 cites.
    118. An optimal probabilistic protocol for synchronous Byzantine agreement“. P Feldman, S Micali. 1997. SIAM SIAM Journal on Computing. 161 cites.
    119. A model-theoretic analysis of knowledge“. R Fagin, JY Halpern, MY Vardi. 1991. dl.acm.org Journal of the ACM (JACM). 161 cites.
    120. Synchronous and asynchronous“. F Cristian. 1996. dl.acm.org Communications of the ACM. 159 cites.
    121. Upright cluster services“. A Clement, M Kapritsos, S Lee, Y Wang, …. 2009. dl.acm.org Proceedings of the …. 159 cites.
    122. Randomization in byzantine agreement“. B Chor, C Dwork. 1989. Advances in Computer Research. 155 cites.
    123. Detectors and correctors: A theory of fault-tolerance components“. A Arora, SS Kulkarni. 1998. ieeexplore.ieee.org Distributed Computing Systems, 1998 …. 155 cites.
    124. The many faces of consensus in distributed systems“. J Turek, D Shasha. 1992. ieeexplore.ieee.org Computer. 154 cites.
    125. Self-stabilizing clock synchronization in the presence of byzantine faults“. S Dolev, JL Welch. 2004. dl.acm.org Journal of the ACM (JACM). 154 cites.
    126. Asynchronous verifiable secret sharing and proactive cryptosystems“. C Cachin, K Kursawe, A Lysyanskaya, …. 2002. dl.acm.org Proceedings of the 9th …. 152 cites.
    127. A fault-tolerant protocol for atomic broadcast“. SW Luan, VD Gligor. 1990. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 152 cites.
    128. A fault-tolerant protocol for atomic broadcast“. SW Luan, VD Gligor. 1990. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 152 cites.
    129. Time is not a healer“. N Santoro, P Widmayer. 1989. Springer STACS 89. 151 cites.
    130. Model checking for probability and time: from theory to practice“. M Kwiatkowska. 2003. ieeexplore.ieee.org Logic in Computer Science, 2003 …. 150 cites.
    131. Reputation propagation and agreement in mobile ad-hoc networks“. Y Liu, YR Yang. 2003. ieeexplore.ieee.org … and Networking, 2003. WCNC 2003. 2003 …. 146 cites.
    132. An O (log n) expected rounds randomized byzantine generals protocol“. G Bracha. 1987. dl.acm.org Journal of the ACM (JACM). 145 cites.
    133. Consensus routing: The Internet as a distributed system“. JP John, E Katz-Bassett, A Krishnamurthy, …. 2008. usenix.org Proceedings of the 5th …. 144 cites.
    134. Inexact agreement: accuracy, precision, and graceful degradation“. SR Mahaney, FB Schneider. 1985. dl.acm.org Proceedings of the fourth annual ACM …. 142 cites.
    135. Fault tolerance in networks of bounded degree“. C Dwork, D Peleg, N Pippenger, E Upfal. 1988. SIAM SIAM Journal on Computing. 141 cites.
    136. Byzantine generals and transaction commit protocols“. L Lamport, M Fischer. 1982. pdfs.semanticscholar.org . 140 cites.
    137. Randomized byzantine agreements“. S Toueg. 1984. dl.acm.org Proceedings of the third annual ACM symposium on …. 139 cites.
    138. Broadcast in radio networks tolerating byzantine adversarial behavior“. CY Koo. 2004. dl.acm.org Proceedings of the twenty-third annual ACM …. 139 cites.
    139. Cryptographic support for fault-tolerant distributed computing“. Y Minsky, R Van Renesse, FB Schneider, …. 1996. dl.acm.org Proceedings of the 7th …. 139 cites.
    140. The next 700 BFT protocols“. R Guerraoui, N Knežević, V Quéma, …. 2010. dl.acm.org Proceedings of the 5th …. 137 cites.
    141. An efficient algorithm for Byzantine agreement without authentication“. D Dolev, MJ Fischer, R Fowler, NA Lynch, …. 1982. Elsevier Information and …. 134 cites.
    142. When selfish meets evil: Byzantine players in a virus inoculation game“. T Moscibroda, S Schmid, R Wattenhofer. 2006. dl.acm.org … of the twenty-fifth annual ACM …. 134 cites.
    143. Cryptographic protocols“. MJ Merritt. 1983. dl.acm.org . 134 cites.
    144. A survey of peer-to-peer storage techniques for distributed file systems“. R Hasan, Z Anwar, W Yurcik, …. 2005. ieeexplore.ieee.org … , 2005. ITCC 2005 …. 133 cites.
    145. A survey of peer-to-peer storage techniques for distributed file systems“. R Hasan, Z Anwar, W Yurcik, …. 2005. ieeexplore.ieee.org … , 2005. ITCC 2005 …. 133 cites.
    146. Travelling through wormholes: a new look at distributed systems models“. PE Veríssimo. 2006. dl.acm.org ACM SIGACT News. 132 cites.
    147. Secure intrusion-tolerant replication on the Internet“. C Cachin, JA Poritz. 2002. ieeexplore.ieee.org … Systems and Networks, 2002. DSN 2002 …. 132 cites.
    148. Symmetry reduction for probabilistic model checking“. M Kwiatkowska, G Norman, D Parker. 2006. Springer CAV. 132 cites.
    149. Streets of Byzantium: Network architectures for fast reliable broadcasts“. O Babaoglu, R Drummond. 1985. ieeexplore.ieee.org IEEE Transactions on Software …. 130 cites.
    150. Unreliable intrusion detection in distributed computations“. D Malkhi, M Reiter. 1997. ieeexplore.ieee.org Computer Security Foundations Workshop …. 129 cites.
    151. On the cost of fault-tolerant consensus when there are no faults: preliminary version“. I Keidar, S Rajsbaum. 2001. dl.acm.org ACM SIGACT News. 129 cites.
    152. Thema: Byzantine-fault-tolerant middleware for web-service applications“. MG Merideth, A Iyengar, T Mikalsen, …. 2005. ieeexplore.ieee.org … , 2005. SRDS 2005 …. 129 cites.
    153. Quantum solution to the Byzantine agreement problem“. M Fitzi, N Gisin, U Maurer. 2001. APS Physical Review Letters. 126 cites.
    154. How to tolerate half less one Byzantine nodes in practical distributed systems“. M Correia, NF Neves, …. 2004. ieeexplore.ieee.org … Distributed Systems, 2004 …. 126 cites.
    155. Extending binary Byzantine agreement to multivalued Byzantine agreement“. R Turpin, BA Coan. 1984. Elsevier Information Processing Letters. 125 cites.
    156. A formally verified algorithm for interactive consistency under a hybrid fault model“. P Lincoln, J Rushby. 1993. ieeexplore.ieee.org … Computing, 1993. FTCS-23. Digest of …. 124 cites.
    157. Issues of fault tolerance in concurrent computations.“. V Hadzilacos. 1986. Dissertation Abstracts International Part B: Science and …. 123 cites.
    158. Maintaining security in the presence of transient faults“. R Canetti, A Herzberg. 1994. Springer Advances in Cryptology—CRYPTO’94. 120 cites.
    159. Distributing trust with the Rampart toolkit“. M Reiter. 1996. dl.acm.org Communications of the ACM. 119 cites.
    160. Secure distributed cluster formation in wireless sensor networks“. K Sun, P Peng, P Ning, C Wang. 2006. ieeexplore.ieee.org … Conference, 2006. ACSAC’ …. 119 cites.
    161. Comment on “Experimental demonstration of a quantum protocol for byzantine agreement and liar detection”“. F Gao, FZ Guo, QY Wen, FC Zhu. 2008. APS Physical review letters. 118 cites.
    162. Fully polynomial byzantine agreement for processors in rounds“. JA Garay, Y Moses. 1998. SIAM SIAM Journal on Computing. 117 cites.
    163. Zyzzyva: Speculative byzantine fault tolerance“. R Kotla, L Alvisi, M Dahlin, A Clement, …. 2009. dl.acm.org ACM Transactions on …. 117 cites.
    164. Towards optimal distributed consensus“. P Berman, JA Garay, KJ Perry. 1989. ieeexplore.ieee.org Foundations of Computer …. 116 cites.
    165. Active disk paxos with infinitely many processes“. G Chockler, D Malkhi. 2005. Springer Distributed Computing. 115 cites.
    166. Secure time synchronization in sensor networks“. S Ganeriwal, C Pöpper, S Čapkun, …. 2008. dl.acm.org ACM Transactions on …. 114 cites.
    167. High throughput Byzantine fault tolerance“. R Kotla, M Dahlin. 2004. ieeexplore.ieee.org Dependable Systems and Networks, 2004 …. 112 cites.
    168. Perfectly-secure MPC with linear communication complexity“. Z Beerliová-Trubíniová, M Hirt. 2008. Springer Theory of cryptography. 112 cites.
    169. Amp: A highly parallel atomic multicast protocol“. P Verissimo, L Rodrigues, M Baptista. 1989. dl.acm.org ACM SIGCOMM Computer …. 112 cites.
    170. Resilient asymptotic consensus in robust networks“. HJ LeBlanc, H Zhang, X Koutsoukos, …. 2013. ieeexplore.ieee.org IEEE Journal on …. 111 cites.
    171. Byzantine disk paxos: optimal resilience with byzantine shared memory“. I Abraham, G Chockler, I Keidar, D Malkhi. 2006. Springer Distributed Computing. 111 cites.
    172. A hundred impossibility proofs for distributed computing“. N Lynch. 1989. dl.acm.org Proceedings of the eighth annual ACM Symposium on …. 111 cites.
    173. Efficient byzantine fault-tolerance“. GS Veronese, M Correia, AN Bessani, …. 2013. ieeexplore.ieee.org IEEE Transactions …. 110 cites.
    174. Early delivery totally ordered multicast in asynchronous environments“. D Dolev, S Kramer, D Malki. 1993. ieeexplore.ieee.org … , 1993. FTCS-23. Digest of Papers …. 108 cites.
    175. Byzantine fault detectors for solving consensus“. KP Kihlstrom, LE Moser, …. 2003. academic.oup.com The Computer …. 107 cites.
    176. Cooperative intrusion detection in wireless sensor networks“. I Krontiris, Z Benenson, T Giannetsos, F Freiling, …. 2009. Springer Wireless sensor …. 107 cites.
    177. Bitcoin-NG: A Scalable Blockchain Protocol.“. I Eyal, AE Gencer, EG Sirer, R Van Renesse. 2016. usenix.org NSDI. 107 cites.
    178. Randomized protocols for asynchronous consensus“. J Aspnes. 2003. Springer Distributed Computing. 106 cites.
    179. A survey of fault-tolerance and fault-recovery techniques in parallel systems“. M Treaster. 2005. arxiv.org arXiv preprint cs/0501002. 106 cites.
    180. Efficient secure multi-party computation“. M Hirt, U Maurer, B Przydatek. 2000. Springer … Conference on the Theory and Application …. 105 cites.
    181. The state machine approach: A tutorial“. FB Schneider. 1990. Springer Fault-Tolerant Distributed Computing. 105 cites.
    182. Fault-tolerant broadcasts“. FB Schneider, D Gries, RD Schlichting. 1984. Elsevier Science of Computer …. 105 cites.
    183. Tolerating byzantine faults in transaction processing systems using commit barrier scheduling“. B Vandiver, H Balakrishnan, B Liskov, …. 2007. dl.acm.org ACM SIGOPS Operating …. 104 cites.
    184. Collective coin flipping, robust voting schemes and minima of Banzhaf values“. M Ben-Or, N Linial. 1985. ieeexplore.ieee.org … of Computer Science, 1985., 26th Annual …. 103 cites.
    185. A short introduction to failure detectors for asynchronous distributed systems“. M Reynal. 2005. dl.acm.org ACM SIGACT News. 102 cites.
    186. Asynchronous Byzantine agreement protocols“. G Bracha. 1987. Elsevier Information and Computation. 101 cites.
    187. From consensus to atomic broadcast: Time-free Byzantine-resistant protocols without signatures“. M Correia, NF Neves, P Veríssimo. 2005. academic.oup.com The Computer Journal. 100 cites.
    188. Intrusion-tolerant middleware: The road to automatic security“. PE Verissimo, NF Neves, C Cachin, …. 2006. ieeexplore.ieee.org IEEE Security & …. 100 cites.
    189. Extracting guarantees from chaos“. J Kubiatowicz. 2003. dl.acm.org Communications of the ACM. 99 cites.
    190. DepSpace: a Byzantine fault-tolerant coordination service“. AN Bessani, EP Alchieri, M Correia, …. 2008. dl.acm.org ACM SIGOPS Operating …. 98 cites.
    191. Systematic formal verification for fault-tolerant time-triggered algorithms“. J Rushby. 1999. ieeexplore.ieee.org IEEE Transactions on Software Engineering. 96 cites.
    192. Systematic formal verification for fault-tolerant time-triggered algorithms“. J Rushby. 1999. ieeexplore.ieee.org IEEE Transactions on Software Engineering. 96 cites.
    193. On the composition of authenticated byzantine agreement“. Y Lindell, A Lysyanskaya, T Rabin. 2006. dl.acm.org Journal of the ACM (JACM). 95 cites.
    194. Lower bounds for asynchronous consensus“. L Lamport. 2003. Springer Future Directions in Distributed Computing. 95 cites.
    195. Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector.“. KP Kihlstrom, LE Moser, …. 1997. ai2-s2-pdfs.s3.amazonaws.com …. 93 cites.
    196. State machine replication for the masses with BFT-SMaRt“. A Bessani, J Sousa, EEP Alchieri. 2014. ieeexplore.ieee.org Dependable Systems and …. 93 cites.
    197. Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults“. L Gong, P Lincoln, J Rushby. 1998. emerald-ids.net Dependable Computing and Fault …. 92 cites.
    198. Method for distributed transaction commit and recovery using Byzantine agreement within clusters of processors“. C Mohan, R Strong, S Finkelstein. 1983. dl.acm.org Proceedings of the second annual …. 92 cites.
    199. Fireflies: scalable support for intrusion-tolerant network overlays“. H Johansen, A Allavena, R Van Renesse. 2006. dl.acm.org ACM SIGOPS Operating …. 92 cites.
    200. Achievable cases in an asynchronous environment“. H Attiya, A Bar-Noy, D Dolev, D Koller, …. 1987. ieeexplore.ieee.org … of Computer Science …. 92 cites.
    201. On reliable broadcast in a radio network“. V Bhandari, NH Vaidya. 2005. dl.acm.org Proceedings of the twenty-fourth annual ACM …. 92 cites.
    202. Easy impossibility proofs for distributed consensus problems“. MJ Fischer, NA Lynch, M Merritt. 1990. Springer Fault-tolerant distributed computing. 91 cites.
    203. Byzantine fault tolerance, from theory to reality“. K Driscoll, B Hall, H Sivencrona, P Zumsteg. 2003. Springer SafeComp. 91 cites.
    204. Reliable broadcast in radio networks: The bounded collision case“. CY Koo, V Bhandari, J Katz, NH Vaidya. 2006. dl.acm.org … of the twenty-fifth annual ACM …. 91 cites.
    205. Statistical trust establishment in wireless sensor networks“. MJ Probst, SK Kasera. 2007. ieeexplore.ieee.org Parallel and Distributed Systems, 2007 …. 91 cites.
    206. A comparison of voting strategies for fault-tolerant distributed systems“. DM Blough, GF Sullivan. 1990. ieeexplore.ieee.org Reliable Distributed Systems, 1990 …. 90 cites.
    207. A layered analysis of consensus“. Y Moses, S Rajsbaum. 2002. SIAM SIAM Journal on Computing. 90 cites.
    208. Paxos replicated state machines as the basis of a high-performance data store“. WJ Bolosky, D Bradshaw, RB Haagens, …. 2011. usenix.org … on Networked Systems …. 90 cites.
    209. Tolerance to unbounded byzantine faults“. M Nesterenko, A Arora. 2002. ieeexplore.ieee.org Reliable Distributed Systems, 2002 …. 89 cites.
    210. Membership algorithms for asynchronous distributed systems“. LE Moser, PM Melliar-Smith, …. 1991. ieeexplore.ieee.org … Systems, 1991., 11th …. 89 cites.
    211. Iterative approximate byzantine consensus in arbitrary directed graphs“. NH Vaidya, L Tseng, G Liang. 2012. dl.acm.org … of the 2012 ACM symposium on …. 88 cites.
    212. Optimal Time Randomized Consensus-Making Resilient Algorithms Fast in Practice.“. ME Saks, N Shavit, H Woll. 1991. books.google.com SODA. 88 cites.
    213. Applications of Byzantine agreement in database systems“. H Garcia Molina, F Pittelli, S Davidson. 1986. dl.acm.org ACM Transactions on Database …. 87 cites.
    214. Uniform consensus is harder than consensus“. B Charron-Bost, A Schiper. 2004. Elsevier Journal of Algorithms. 87 cites.
    215. A high-throughput secure reliable multicast protocol“. D Malkhi, M Reiter. 1997. content.iospress.com Journal of Computer Security. 87 cites.
    216. A high-throughput secure reliable multicast protocol“. D Malkhi, M Reiter. 1997. content.iospress.com Journal of Computer Security. 87 cites.
    217. Exploiting omissive faults in synchronous approximate agreement“. MH Azadmanesh, RM Kieckhafer. 2000. ieeexplore.ieee.org IEEE Transactions on …. 86 cites.
    218. BFT Protocols Under Fire.“. A Singh, T Das, P Maniatis, P Druschel, T Roscoe. 2008. static.usenix.org NSDI. 85 cites.
    219. Asynchronous secure computations with optimal resilience“. M Ben-Or, B Kelmer, T Rabin. 1994. dl.acm.org … of the thirteenth annual ACM symposium …. 84 cites.
    220. Abuse-free multi-party contract signing“. JA Garay, PD MacKenzie. 1999. Springer DISC. 84 cites.
    221. A simple bivalency proof that t-resilient consensus requires t+ 1 rounds“. MK Aguilera, S Toueg. 1999. Elsevier Information Processing Letters. 83 cites.
    222. Byzantine replication under attack“. Y Amir, B Coan, J Kirsch, J Lane. 2008. ieeexplore.ieee.org Dependable Systems and …. 83 cites.
    223. Fault tolerant load management system and method“. C Dwork, JY Halpern, HR Strong Jr. 1996. Google Patents US Patent 5,513,354. 82 cites.
    224. Replica determinism and flexible scheduling in hard real-time dependable systems“. S Poledna, A Burns, A Wellings, …. 2000. ieeexplore.ieee.org IEEE transactions on …. 82 cites.
    225. Consensus in synchronous systems: A concise guided tour“. M Raynal. 2002. ieeexplore.ieee.org … Computing, 2002. Proceedings. 2002 Pacific Rim …. 81 cites.
    226. Secure computation without agreement“. S Goldwasser, Y Lindell. 2002. Springer Distributed Computing. 81 cites.
    227. The design of a robust peer-to-peer system“. R Rodrigues, B Liskov, L Shrira. 2002. dl.acm.org Proceedings of the 10th workshop on …. 81 cites.
    228. Tolerating a linear number of faults in networks of bounded degree“. E Upfal. 1994. Elsevier Information and Computation. 80 cites.
    229. Replication“. B Charron-Bost, F Pedone, A Schiper. 2010. Springer LNCS. 80 cites.
    230. Encapsulating failure detection: From crash to byzantine failures“. A Doudou, B Garbinato, R Guerraoui. 2002. Springer Reliable Software Technologies …. 80 cites.
    231. A new solution for the Byzantine generals problem“. R Reischuk. 1985. Elsevier Information and Control. 80 cites.
    232. Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error“. WK Shih, JWS Liu. 1995. ieeexplore.ieee.org IEEE Transactions on Computers. 80 cites.
    233. LIDeA: a distributed lightweight intrusion detection architecture for sensor networks“. I Krontiris, T Giannetsos, T Dimitriou. 2008. dl.acm.org Proceedings of the 4th …. 80 cites.
    234. Studies on Byzantine literature of the eleventh and twelfth centuries“. A Kazhdan, S Franklin. 1984. Maison des Sciences de l’Homme . 79 cites.
    235. Non-blocking atomic commit in asynchronous distributed systems with failure detectors“. R Guerraoui. 2002. Springer Distributed Computing. 78 cites.
    236. Survivability through customization and adaptability: The cactus approach“. MA Hiltunen, RD Schlichting, …. 2000. ieeexplore.ieee.org … and Exposition, 2000 …. 78 cites.
    237. The Political Background to the Baptism of Rus’: Byzantine-Russian Relations between 986-89“. A Poppe. 1976. JSTOR Dumbarton Oaks Papers. 78 cites.
    238. The Political Background to the Baptism of Rus’: Byzantine-Russian Relations between 986-89“. A Poppe. 1976. JSTOR Dumbarton Oaks Papers. 78 cites.
    239. CheapBFT: resource-efficient byzantine fault tolerance“. R Kapitza, J Behl, C Cachin, T Distler, …. 2012. dl.acm.org Proceedings of the 7th …. 77 cites.
    240. Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems.“. J Li, D Maziéres. 2007. usenix.org NSDI. 77 cites.
    241. Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems.“. J Li, D Maziéres. 2007. usenix.org NSDI. 77 cites.
    242. A theory of competitive analysis for distributed algorithms“. M Ajtai, J Aspnes, C Dwork, …. 1994. ieeexplore.ieee.org Foundations of Computer …. 77 cites.
    243. The consistent comparison problem in N-version software“. SS Brilliant, JC Knight, …. 1989. ieeexplore.ieee.org IEEE Transactions on …. 76 cites.
    244. The consistent comparison problem in N-version software“. SS Brilliant, JC Knight, …. 1989. ieeexplore.ieee.org IEEE Transactions on …. 76 cites.
    245. Muteness detectors for consensus with Byzantine processes“. A Doudou, A Schiper. 1997. Citeseer in Proceedings of the 17th ACM Symposium on …. 75 cites.
    246. Knowledge and common knowledge in a Byzantine environment I: crash failures“. C Dwork, Y Moses. 1986. dl.acm.org Proceedings of the 1986 Conference on Theoretical …. 75 cites.
    247. Robust distributed computing and sensing algorithm“. RR Brooks, SS Iyengar. 1996. ieeexplore.ieee.org Computer. 75 cites.
    248. Probabilistic model checking in practice: Case studies with PRISM“. M Kwiatkowska, G Norman, D Parker. 2005. dl.acm.org ACM SIGMETRICS Performance …. 75 cites.
    249. Fast distributed agreement“. S Toueg, KJ Perry, TK Srikanth. 1987. SIAM SIAM Journal on Computing. 74 cites.
    250. Distributing trust on the Internet“. C Cachin. 2001. ieeexplore.ieee.org Dependable Systems and Networks, 2001. DSN …. 74 cites.
    251. Towards optimal and efficient perfectly secure message transmission“. M Fitzi, M Franklin, J Garay, SH Vardhan. 2007. Springer Theory of Cryptography …. 74 cites.
    252. Asymptotically optimal algorithms for approximate agreement“. AD Fekete. 1990. Springer Distributed Computing. 73 cites.
    253. Replica determinism in distributed real-time systems: A brief survey“. S Poledna. 1994. Springer Real-Time Systems. 73 cites.
    254. Unifying synchronous and asynchronous message-passing models“. M Herlihy, S Rajsbaum, MR Tuttle. 1998. dl.acm.org Proceedings of the seventeenth …. 73 cites.
    255. Spin one’s wheels? Byzantine fault tolerance with a spinning primary“. GS Veronese, M Correia, AN Bessani, …. 2009. ieeexplore.ieee.org … Systems, 2009. SRDS’ …. 73 cites.
    256. The Case for Byzantine Fault Detection.“. A Haeberlen, P Kouznetsov, P Druschel. 2006. usenix.org HotDep. 72 cites.
    257. The quest for scalable blockchain fabric: Proof-of-work vs. BFT replication“. M Vukolić. 2015. Springer International Workshop on Open Problems in Network …. 72 cites.
    258. ZZ and the art of practical BFT execution“. T Wood, R Singh, A Venkataramani, P Shenoy, …. 2011. dl.acm.org Proceedings of the sixth …. 72 cites.
    259. Efficient fault-tolerant routings in networks“. A Broder, D Dolev, M Fischer, B Simons. 1987. Elsevier Information and Computation. 72 cites.
    260. A note on consensus on dual failure modes“. HS Siu, YH Chin, WP Yang. 1996. ieeexplore.ieee.org IEEE Transactions on Parallel …. 71 cites.
    261. Introspective failure analysis: Avoiding correlated failures in peer-to-peer systems“. H Weatherspoon, T Moscovitz, …. 2002. ieeexplore.ieee.org … Proceedings. 21st IEEE …. 71 cites.
    262. Fault-tolerant deployment of embedded software for cost-sensitive real-time feedback-control applications“. C Pinello, LP Carloni, …. 2004. dl.acm.org Proceedings of the …. 71 cites.
    263. Increasing web service dependability through consensus voting“. N Looker, M Munro, J Xu. 2005. ieeexplore.ieee.org Computer Software and Applications …. 71 cites.
    264. A simple proof of the uniform consensus synchronous lower bound“. I Keidar, S Rajsbaum. 2003. Elsevier Information Processing Letters. 70 cites.
    265. Rosebud: A scalable byzantine-fault-tolerant storage architecture“. R Rodrigues, B Liskov. 2003. dspace.mit.edu . 70 cites.
    266. Mechanical verification of a generalized protocol for byzantine fault tolerant clock synchronization“. N Shankar. 1992. Springer International Symposium on Formal Techniques in …. 69 cites.
    267. From partial consistency to global broadcast“. M Fitzi, U Maurer. 2000. dl.acm.org Proceedings of the thirty-second annual ACM …. 69 cites.
    268. A computer scientist looks at game theory“. JY Halpern. 2003. Elsevier Games and Economic Behavior. 68 cites.
    269. Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM.“. M Kwiatkowska, G Norman, R Segala. 2001. Springer CAV. 68 cites.
    270. Efficient byzantine agreement secure against general adversaries“. M Fitzi, U Maurer. 1998. Springer Distributed Computing. 67 cites.
    271. Byzantine agreement in the presence of mixed faults on processors and links“. HS Siu, YH Chin, WP Yang. 1998. ieeexplore.ieee.org IEEE Transactions on Parallel …. 67 cites.
    272. Asymptotically optimal distributed consensus“. P Berman, JA Garay. 1989. Springer International Colloquium on Automata, Languages …. 67 cites.
    273. Dynamic Byzantine quorum systems“. L Alvisi, D Malkhi, E Pierce, MK Reiter, …. 2000. ieeexplore.ieee.org … and Networks, 2000 …. 67 cites.
    274. Time and message efficient reliable broadcasts“. TD Chandra, S Toueg. 1990. Springer International Workshop on Distributed Algorithms. 67 cites.
    275. Towards secure and scalable computation in peer-to-peer networks“. V King, J Saia, V Sanwalani, …. 2006. ieeexplore.ieee.org Foundations of Computer …. 67 cites.
    276. An overview of formal verification for the time-triggered architecture“. J Rushby. 2002. Springer International Symposium on Formal Techniques in …. 67 cites.
    277. Resolving message complexity of byzantine agreement and beyond“. Z Galil, A Mayer, M Yung. 1995. ieeexplore.ieee.org Foundations of Computer Science …. 66 cites.
    278. A simple and efficient randomized byzantine agreement algorithm“. B Chor, BA Coan. 1985. ieeexplore.ieee.org IEEE Transactions on Software Engineering. 66 cites.
    279. Impossibility results and lower bounds for consensus under link failures“. U Schmid, B Weiss, I Keidar. 2009. SIAM SIAM Journal on Computing. 66 cites.
    280. Tight bounds for k-set agreement“. S Chaudhuri, M Erlihy, NA Lynch, …. 2000. dl.acm.org Journal of the ACM (JACM). 66 cites.
    281. A communication-efficient canonical form for fault-tolerant distributed protocols“. BA Coan. 1986. dl.acm.org Proceedings of the fifth annual ACM symposium on …. 65 cites.
    282. Unifying self-stabilization and fault-tolerance“. AS Gopal, KJ Perry. 1993. dl.acm.org Proceedings of the twelfth annual ACM symposium …. 65 cites.
    283. ‘Eventual’is earlier than’immediate’“. D Dolev, R Reischuk, HR Strong. 1982. ieeexplore.ieee.org Foundations of Computer …. 65 cites.
    284. Uniform consensus harder than consensus“. B Charron-Bost, A Schiper. 2000. infoscience.epfl.ch . 65 cites.
    285. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography“. C Cachin, K Kursawe, V Shoup. 2005. Springer Journal of Cryptology. 64 cites.
    286. Byzantizing Paxos by Refinement.“. L Lamport. 2011. Springer DISC. 64 cites.
    287. Diverse Replication for Single-Machine Byzantine-Fault Tolerance.“. BG Chun, P Maniatis, S Shenker. 2008. usenix.org USENIX Annual Technical Conference. 64 cites.
    288. Low complexity Byzantine-resilient consensus“. M Correia, NF Neves, LC Lung, P Veríssimo. 2005. Springer Distributed Computing. 63 cites.
    289. Efficient Byzantine-resilient reliable multicast on a hybrid failure model“. M Correia, LC Lung, NF Neves, …. 2002. ieeexplore.ieee.org … Proceedings. 21st IEEE …. 63 cites.
    290. Failure detection and randomization: A hybrid approach to solve consensus“. MK Aguilera, S Toueg. 1998. SIAM SIAM Journal on Computing. 63 cites.
    291. Optimal asynchronous agreement and leader election algorithm for complete networks with byzantine faulty links“. HM Sayeed, M Abu-Amara, H Abu-Amara. 1995. Springer Distributed Computing. 62 cites.
    292. Breaking the O (n 2) bit barrier: scalable byzantine agreement with an adaptive adversary“. V King, J Saia. 2011. dl.acm.org Journal of the ACM (JACM). 62 cites.
    293. Fault-tolerant agreement in synchronous message-passing systems“. M Raynal. 2010. morganclaypool.com Synthesis lectures on distributed computing theory. 62 cites.
    294. Distributed inference with byzantine data: State-of-the-art review on data falsification attacks“. A Vempaty, L Tong, PK Varshney. 2013. ieeexplore.ieee.org IEEE Signal Processing …. 62 cites.
    295. Modular construction of a Byzantine agreement protocol with optimal message bit complexity“. BA Coan, JL Welch. 1992. Elsevier Information and Computation. 61 cites.
    296. Consensus of multi-agent networks in the presence of adversaries using only local information“. HJ LeBlanc, H Zhang, S Sundaram, …. 2012. dl.acm.org Proceedings of the 1st …. 61 cites.
    297. Principal features of the VOLTAN family of reliable node architectures for distributed systems“. SK Shrivastava, PD Ezhilchelvan, …. 1992. ieeexplore.ieee.org IEEE Transactions …. 61 cites.
    298. Detectable Byzantine agreement secure against faulty majorities“. M Fitzi, D Gottesman, M Hirt, T Holenstein, …. 2002. dl.acm.org Proceedings of the twenty …. 60 cites.
    299. Fully polynomial Byzantine agreement in t+ 1 rounds“. JA Garay, Y Moses. 1993. dl.acm.org Proceedings of the twenty-fifth annual ACM …. 60 cites.
    300. Scaling Byzantine Fault-Tolerant Replication toWide Area Networks“. Y Amir, C Danilov, J Kirsch, J Lane, …. 2006. ieeexplore.ieee.org … and Networks, 2006 …. 60 cites.
    301. Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems“. R Friedman, A Mostefaoui, …. 2005. ieeexplore.ieee.org IEEE Transactions on …. 59 cites.
    302. Secure multi-party computation without agreement“. S Goldwasser, Y Lindell. 2005. Springer Journal of Cryptology. 59 cites.
    303. Byzantine fault tolerant public key authentication in peer-to-peer systems“. V Pathak, L Iftode. 2006. Elsevier Computer Networks. 58 cites.
    304. Reaching approximate agreement with mixed-mode faults“. RM Kieckhafer, MH Azadmanesh. 1994. ieeexplore.ieee.org IEEE Transactions on …. 58 cites.
    305. The disagreement power of an adversary“. C Delporte-Gallet, H Fauconnier, R Guerraoui, …. 2011. Springer Distributed …. 58 cites.
    306. The inherent cost of nonblocking commitment“. C Dwork, D Skeen. 1983. dl.acm.org Proceedings of the second annual ACM symposium …. 58 cites.
    307. Automatically increasing the fault-tolerance of distributed systems“. G Neiger, S Toueg. 1988. dl.acm.org Proceedings of the seventh annual ACM …. 58 cites.
    308. Peercube: A hypercube-based p2p overlay robust against collusion and churn“. E Anceaume, R Ludinard, A Ravoaja, …. 2008. ieeexplore.ieee.org Self-Adaptive and …. 57 cites.
    309. Enhancing bitcoin security and performance with strong consistency via collective signing“. EK Kogias, P Jovanovic, N Gailly, I Khoffi, …. 2016. usenix.org 25th USENIX Security …. 57 cites.
    310. Fast asynchronous byzantine agreement and leader election with full information“. BM Kapron, D Kempe, V King, J Saia, …. 2010. dl.acm.org ACM Transactions on …. 56 cites.
    311. Unconditional Byzantine agreement for any number of faulty processors“. B Pfitzmann, M Waidner. 1992. Springer STACS 92. 56 cites.
    312. A different look at secure distributed computation“. PF Syverson. 1997. ieeexplore.ieee.org Computer Security Foundations Workshop, 1997 …. 56 cites.
    313. Consensus with byzantine failures and little system synchrony“. MK Aguilera, C Delporte-Gallet, …. 2006. ieeexplore.ieee.org … and Networks, 2006 …. 55 cites.
    314. Message-optimal protocols for Byzantine agreement“. V Hadzilacos, JY Halpern. 1993. Springer Mathematical Systems Theory. 55 cites.
    315. Byzantine agreement in a generalized connected network“. SC Wang, YH Chin, KQ Yan. 1995. ieeexplore.ieee.org IEEE Transactions on Parallel …. 54 cites.
    316. On expected constant-round protocols for Byzantine agreement“. J Katz, CY Koo. 2006. Springer CRYPTO. 54 cites.
    317. Agreement in synchronous networks with ubiquitous faults“. N Santoro, P Widmayer. 2007. Elsevier Theoretical Computer Science. 54 cites.
    318. A continuum of failure models for distributed computing“. JA Garay, KJ Perry. 1992. Springer International Workshop on Distributed Algorithms. 54 cites.
    319. Prime: Byzantine replication under attack“. Y Amir, B Coan, J Kirsch, J Lane. 2011. ieeexplore.ieee.org IEEE Transactions on …. 54 cites.
    320. Method for achieving multiple processor agreement optimized for no faults“. D Dolev, HR Strong. 1986. Google Patents US Patent 4,569,015. 53 cites.
    321. Randomized intrusion-tolerant asynchronous services“. H Moniz, NF Neves, M Correia, …. 2006. ieeexplore.ieee.org … Systems and Networks …. 53 cites.
    322. Computer science and game theory: A brief survey“. JY Halpern. 2007. arxiv.org arXiv preprint cs/0703148. 53 cites.
    323. Agreement-related problems: From semi-passive replication to totally ordered broadcast“. X Défago. 2000. researchgate.net . 53 cites.
    324. Formal specification and verification of a fault-masking and transient-recovery model for digital flight-control systems“. J Rushby. 1992. Springer International Symposium on Formal Techniques in …. 53 cites.
    325. A probabilistically correct leader election protocol for large groups“. I Gupta, R Van Renesse, K Birman. 2000. Springer Distributed Computing. 53 cites.
    326. The formal verification of an algorithm for interactive consistency under a hybrid fault model“. P Lincoln, J Rushby. 1993. Springer Computer Aided Verification. 53 cites.
    327. Efficient update diffusion in byzantine environments“. D Malkhi, MK Reiter, O Rodeh, …. 2001. ieeexplore.ieee.org … , 2001. Proceedings. 20th …. 52 cites.
    328. Synchronization issues in real-time systems“. N Suri, MM Hugue, CJ Walter. 1994. ieeexplore.ieee.org Proceedings of the IEEE. 52 cites.
    329. The Byzantine Firing Squad Problem.“. JE Burns, NA Lynch. 1985. dtic.mil . 51 cites.
    330. Dependability and performance evaluation of intrusion-tolerant server architectures“. V Gupta, V Lam, HGV Ramasamy, WH Sanders, …. 2003. Springer LADC. 51 cites.
    331. The Ripple protocol consensus algorithm“. D Schwartz, N Youngs, A Britto. 2014. the-blockchain.com Ripple Labs Inc White Paper. 50 cites.
    332. Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes“. J Bruck, R Cypher, CT Ho. 1995. ieeexplore.ieee.org IEEE Transactions on Computers. 50 cites.
    333. Authenticated Byzantine fault tolerance without public-key cryptography“. M Castro, B Liskov. 1999. 129.69.211.95 . 50 cites.
    334. Cloture votes: n/4-resilient distributed consensus int+ 1 rounds“. P Berman, JA Garay. 1993. Springer Theory of Computing Systems. 50 cites.
    335. On the reliability of consensus-based fault-tolerant distributed computing systems“. Ö Babaoğlu. 1987. dl.acm.org ACM Transactions on Computer Systems (TOCS). 50 cites.
    336. The New Testament in the Original Greek: Byzantine Textform, 2005“. MA Robinson, WG Pierpont. 2005. books.google.com . 50 cites.
    337. Beyond nash equilibrium: Solution concepts for the 21st century“. JY Halpern. 2008. dl.acm.org Proceedings of the twenty-seventh ACM symposium on …. 50 cites.
    338. A robust noncryptographic protocol for collective coin flipping“. M Saks. 1989. SIAM SIAM Journal on Discrete Mathematics. 50 cites.
    339. From binary consensus to multivalued consensus in asynchronous message-passing systems“. A Mostefaoui, M Raynal, F Tronel. 2000. Elsevier Information Processing Letters. 49 cites.
    340. Bit optimal distributed consensus“. P Berman, JA Garay, KJ Perry. 1992. Springer Computer science. 49 cites.
    341. Efficient byzantine broadcast in wireless ad-hoc networks“. V Drabkin, R Friedman, M Segal. 2005. ieeexplore.ieee.org Dependable Systems and …. 49 cites.
    342. A Simple and Efficient Byzantine Generals Algorithm.“. NA Lynch, MJ Fischer, R Fowler. 1982. dtic.mil . 49 cites.
    343. Tight bounds for asynchronous randomized consensus“. H Attiya, K Censor. 2008. dl.acm.org Journal of the ACM (JACM). 49 cites.
    344. Byzantine agreement“. HR Strong, D Dolev. 1982. w3.cs.huji.ac.il . 48 cites.
    345. Game-theoretic aspects of computing“. N Linial. 1994. Elsevier Handbook of game theory with economic applications. 48 cites.
    346. Exploiting symbolic techniques in automated synthesis of distributed programs with large state space“. B Bonakdarpour, SS Kulkarni. 2007. ieeexplore.ieee.org Distributed Computing Systems …. 48 cites.
    347. Secure and highly-available aggregation queries in large-scale sensor networks via set sampling“. H Yu. 2011. Springer Distributed Computing. 48 cites.
    348. Secure and highly-available aggregation queries in large-scale sensor networks via set sampling“. H Yu. 2011. Springer Distributed Computing. 48 cites.
    349. BFT-WS: A Byzantine fault tolerance framework for web services“. W Zhao. 2007. ieeexplore.ieee.org EDOC Conference Workshop, 2007. EDOC’07 …. 47 cites.
    350. Tolerating corrupted communication“. M Biely, J Widder, B Charron-Bost, A Gaillard, …. 2007. dl.acm.org Proceedings of the …. 47 cites.
    351. Stabilizing consensus with the power of two choices“. B Doerr, LA Goldberg, L Minder, T Sauerwald, …. 2011. dl.acm.org Proceedings of the …. 47 cites.
    352. Simple constant-time consensus protocols in realistic failure models“. B Chor, M Merritt, DB Shmoys. 1989. dl.acm.org Journal of the ACM (JACM). 47 cites.
    353. Efficient middleware for byzantine fault tolerant database replication“. R Garcia, R Rodrigues, N Preguiça. 2011. dl.acm.org Proceedings of the sixth conference …. 47 cites.
    354. Le Christ dans la théologie byzantine“. J Meyendorff. 1969. Éditions du Cerf . 47 cites.
    355. Linear time byzantine self-stabilizing clock synchronization“. A Daliot, D Dolev, H Parnas. 2003. Springer OPODIS. 46 cites.
    356. A comparison of the Byzantine agreement problem and the transaction commit problem“. J Gray. 1990. Springer Fault-Tolerant Distributed Computing. 46 cites.
    357. The middleware architecture of MAFTIA: A blueprint“. P Veríssimo, NF Neves, M Correia. 2000. repositorio.ul.pt . 46 cites.
    358. Pease. The byzantine generals problem“. S Lamport. 1995. IEEE Computer Society Press . 46 cites.
    359. A characterization of eventual Byzantine agreement“. JY Halpern, Y Moses, O Waarts. 1990. dl.acm.org Proceedings of the ninth annual ACM …. 45 cites.
    360. Reaching (and maintaining) agreement in the presence of mobile faults“. JA Garay. 1994. Springer International Workshop on Distributed Algorithms. 45 cites.
    361. Optimal early stopping in distributed consensus“. P Berman, JA Garay, KJ Perry. 1992. Springer International Workshop on Distributed …. 45 cites.
    362. New hybrid fault models for asynchronous approximate agreement“. MH Azadmanesh, RM Kieckhafer. 1996. ieeexplore.ieee.org IEEE Transactions on …. 45 cites.
    363. Robustness of information diffusion algorithms to locally bounded adversaries“. H Zhang, S Sundaram. 2012. ieeexplore.ieee.org American Control Conference (ACC) …. 45 cites.
    364. Fast self-stabilizing byzantine tolerant digital clock synchronization“. M Ben-Or, D Dolev, EN Hoch. 2008. dl.acm.org Proceedings of the twenty-seventh ACM …. 45 cites.
    365. Weakening security assumptions and oblivious transfer“. C Crépeau, J Kilian. 1990. dl.acm.org Proceedings on Advances in cryptology. 45 cites.
    366. A simple method for generating and sharing pseudo-random functions, with applications to clipper-like key escrow systems“. S Micali, R Sidney. 1995. Springer Annual International Cryptology Conference. 45 cites.
    367. Formally verified byzantine agreement in presence of link faults“. U Schmid, B Weiss, J Rushby. 2002. ieeexplore.ieee.org Distributed Computing Systems …. 44 cites.
    368. Computing in totally anonymous asynchronous shared memory systems“. H Attiya, A Gorbach, S Moran. 2002. Elsevier Information and Computation. 44 cites.
    369. A conceptual design for a reliable optical bus (ROBUS)“. PS Miner, M Malekpour, W Torres. 2002. ieeexplore.ieee.org Digital Avionics Systems …. 44 cites.
    370. Efficient changing of replica sets in distributed fault-tolerant computing system“. JR Lorch, JR Howell, JR Douceur. 2008. Google Patents US Patent 7,334,154. 44 cites.
    371. Optimally efficient multi-valued byzantine agreement“. M Fitzi, M Hirt. 2006. dl.acm.org Proceedings of the twenty-fifth annual ACM symposium …. 43 cites.
    372. Fast quantum Byzantine agreement“. M Ben-Or, A Hassidim. 2005. dl.acm.org Proceedings of the thirty-seventh annual ACM …. 43 cites.
    373. Flipping coins in many pockets (Byzantine agreement on uniformly random values)“. AZ Broder, D Dolev. 1984. ieeexplore.ieee.org … of Computer Science, 1984. 25th Annual …. 43 cites.
    374. Diffusion without false rumors: On propagating updates in a Byzantine environment“. D Malkhi, Y Mansour, MK Reiter. 2003. Elsevier Theoretical Computer Science. 43 cites.
    375. Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures.“. C Ho, R Van Renesse, M Bickford, D Dolev. 2008. static.usenix.org NSDI. 43 cites.
    376. A tight lower bound for k-set agreement“. S Chaudhuri, M Herlihy, NA Lynch, …. 1993. ieeexplore.ieee.org … of Computer Science …. 43 cites.
    377. Almost-everywhere secure computation“. J Garay, R Ostrovsky. 2008. Springer Advances in Cryptology–EUROCRYPT 2008. 43 cites.
    378. The complexity of adding failsafe fault-tolerance“. SS Kulkarni, A Ebnenasir. 2002. ieeexplore.ieee.org Distributed Computing Systems …. 43 cites.
    379. Achieving independence in logarithmic number of rounds“. B Chor, MO Rabin. 1987. dl.acm.org Proceedings of the sixth annual ACM Symposium on …. 43 cites.
    380. Отказоустойчивые методы обеспечения взаимной информационной согласованности в распределенных вычислительных системах“. БA Генинсон, ЛА Панкова, …. 1989. mathnet.ru Автоматика и …. 43 cites.
    381. Consensus in networked multi-agent systems with adversaries“. HJ LeBlanc, XD Koutsoukos. 2011. dl.acm.org … of the 14th international conference on …. 42 cites.
    382. Bounds on the time to reach agreement in the presence of timing uncertainty“. H Attiya, C Dwork, N Lynch, L Stockmeyer. 1991. dl.acm.org Proceedings of the twenty …. 42 cites.
    383. Optimal agreement protocol in malicious faulty processors and faulty links“. KQ Yan, YH Chin, SC Wang. 1992. ieeexplore.ieee.org IEEE Transactions on …. 42 cites.
    384. Preventing state divergence in replicated distributed programs“. A Tulley, SK Shrivastava. 1990. ieeexplore.ieee.org Reliable Distributed Systems, 1990 …. 42 cites.
    385. Consensus in Byzantine asynchronous systems“. R Baldoni, JM Hélary, M Raynal, L Tangui. 2003. Elsevier Journal of Discrete Algorithms. 41 cites.
    386. Coordinated traversal:(t+ 1)-round Byzantine agreement in polynomial time“. Y Moses, O Waarts. 1988. ieeexplore.ieee.org … of Computer Science, 1988., 29th Annual …. 41 cites.
    387. Stabilizing consensus in mobile networks“. D Angluin, MJ Fischer, H Jiang. 2006. Springer International Conference on Distributed …. 41 cites.
    388. Load balanced scalable byzantine agreement through quorum building, with full information“. V King, S Lonargan, J Saia, A Trehan. 2011. Springer International Conference on …. 41 cites.
    389. Probabilistic lower bounds for byzantine agreement“. A Karlin, A Yao. 1986. Unpublished document. 41 cites.
    390. Low cost approximate agreement in partially connected networks“. RM Kieckhafer, MH Azadmanesh. 1993. Citeseer Journal of Computing and Information. 41 cites.
    391. Distributed function evaluation in the presence of transmission faults“. N Santoro, P Widmayer. 1990. Springer Algorithms. 41 cites.
    392. Byzantine fault-tolerant MapReduce: Faults are not just crashes“. P Costa, M Pasin, AN Bessani, …. 2011. ieeexplore.ieee.org … Technology and Science …. 40 cites.
    393. The best of both worlds: A hybrid approach to solve consensus“. A Mostefaoui, M Raynal, F Tronel. 2000. ieeexplore.ieee.org Dependable Systems and …. 40 cites.
    394. Increasing performance in Byzantine fault-tolerant systems with on-demand replica consistency“. T Distler, R Kapitza. 2011. dl.acm.org Proceedings of the sixth conference on Computer …. 40 cites.
    395. Fault-local distributed mending“. S Kutten, D Peleg. 1999. Elsevier Journal of Algorithms. 40 cites.
    396. Exposing computationally-challenged Byzantine impostors“. J Aspnes, C Jackson, A Krishnamurthy. 2005. allquantor.at . 39 cites.
    397. Consensus under unreliable transmission“. KQ Yan, SC Wang, YH Chin. 1999. Elsevier Information Processing Letters. 39 cites.
    398. Requirements for agreement in a distributed system“. D Dolev, HR Strong. 1982. DDB. 39 cites.
    399. Randomization and failure detection: A hybrid approach to solve consensus“. MK Aguilera, S Toueg. 1996. Springer International Workshop on Distributed Algorithms. 39 cites.
    400. The stellar consensus protocol: A federated model for internet-level consensus“. D Mazieres. 2015. weusecoins.com Stellar Development Foundation. 39 cites.
    401. Efficient asynchronous consensus with the weak adversary scheduler“. Y Aumann. 1997. dl.acm.org Proceedings of the sixteenth annual ACM symposium …. 39 cites.
    402. Distributed key generation for the internet“. A Kate, I Goldberg. 2009. ieeexplore.ieee.org … Computing Systems, 2009. ICDCS’09. 29th …. 39 cites.
    403. A compiler that increases the fault tolerance of asynchronous protocols“. BA Coan. 1988. ieeexplore.ieee.org IEEE Transactions on Computers. 39 cites.
    404. Multidimensional approximate agreement in Byzantine asynchronous systems“. H Mendes, M Herlihy. 2013. dl.acm.org Proceedings of the forty-fifth annual ACM …. 38 cites.
    405. Polynomial time synthesis of Byzantine agreement“. SS Kulkarni, A Arora, A Chippada. 2001. ieeexplore.ieee.org … Distributed Systems, 2001 …. 38 cites.
    406. Byzantine agreement in constant expected time“. P Feldman, S Micali. 1985. ieeexplore.ieee.org … of Computer Science, 1985., 26th Annual …. 38 cites.
    407. Optimal early stopping uniform consensus in synchronous systems with process omission failures“. PR Parvédy, M Raynal. 2004. dl.acm.org Proceedings of the sixteenth annual ACM …. 38 cites.
    408. Byzantine disk paxos: optimal resilience with byzantine shared memory“. I Abraham, GV Chockler, I Keidar, …. 2004. dl.acm.org Proceedings of the twenty …. 38 cites.
    409. Resilient-optimal interactive consistency in constant time“. M Ben-Or, R El-Yaniv. 2003. Springer Distributed Computing. 38 cites.
    410. Distributed commit with bounded waiting“. D Dolev, HR Strong. 1982. noodle.cs.huji.ac.il . 38 cites.
    411. A necessary and sufficient condition for transforming limited accuracy failure detectors“. E Anceaume, A Fernández, A Mostéfaoui, …. 2004. Elsevier Journal of Computer and …. 38 cites.
    412. Optimal Byzantine-resilient convergence in uni-dimensional robot networks“. Z Bouzid, MG Potop-Butucaru, S Tixeuil. 2010. Elsevier Theoretical Computer Science. 38 cites.
    413. Optimal Byzantine-resilient convergence in uni-dimensional robot networks“. Z Bouzid, MG Potop-Butucaru, S Tixeuil. 2010. Elsevier Theoretical Computer Science. 38 cites.
    414. Bosco: One-step byzantine asynchronous consensus“. YJ Song, R van Renesse. 2008. Springer International Symposium on Distributed …. 37 cites.
    415. The best of both worlds: Guaranteeing termination in fast randomized byzantine agreement protocols“. O Goldreich, E Petrank. 1990. Elsevier Information Processing Letters. 37 cites.
    416. Optimistic byzantine agreement“. K Kursawe. 2002. ieeexplore.ieee.org … , 2002. Proceedings. 21st IEEE Symposium on. 37 cites.
    417. Distributed consensus revisited“. G Neiger. 1994. Elsevier Information processing letters. 37 cites.
    418. Byzantine fault-tolerant web services for n-tier and service oriented architectures“. SL Pallemulle, HD Thorvaldsson, …. 2008. ieeexplore.ieee.org … Systems, 2008. ICDCS …. 37 cites.
    419. A qualitative analysis of the intrusion-tolerance capabilities of the MAFTIA architecture“. R Stroud, I Welch, J Warne, …. 2004. ieeexplore.ieee.org Dependable Systems and …. 37 cites.
    420. Byzantine-resistant total ordering algorithms“. LE Moser, PM Melliar-Smith. 1999. Elsevier Information and Computation. 36 cites.
    421. The honey badger of BFT protocols“. A Miller, Y Xia, K Croman, E Shi, D Song. 2016. dl.acm.org Proceedings of the 2016 ACM …. 36 cites.
    422. Byzantine consensus with unknown participants“. E Alchieri, A Bessani, J da Silva Fraga, …. 2008. Springer Principles of Distributed …. 35 cites.
    423. Anonymous byzantine consensus from moderately-hard puzzles: A model for bitcoin“. A Miller, JJ LaViola Jr. 2014. nakamotoinstitute.org … /anonymous-byzantine-consensus. 35 cites.
    424. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience“. I Abraham, D Dolev, JY Halpern. 2008. dl.acm.org … of the twenty-seventh ACM symposium …. 35 cites.
    425. Optimal resilience asynchronous approximate agreement“. I Abraham, Y Amit, D Dolev. 2004. Springer OPODIS. 35 cites.
    426. Solving vector consensus with a wormhole“. NF Neves, M Correia, …. 2005. ieeexplore.ieee.org IEEE Transactions on …. 35 cites.
    427. The customizable fault/error model for dependable distributed systems“. CJ Walter, N Suri. 2003. Elsevier Theoretical Computer Science. 35 cites.
    428. Architecture of the Hyperledger blockchain fabric“. C Cachin. 2016. pdfs.semanticscholar.org … Distributed Cryptocurrencies and Consensus …. 35 cites.
    429. Fail-stop processors“. FB Schneider. 1983. Digest of Papers from Spring CompCon. 35 cites.
    430. The distributed firing squad problem“. BA Coan, D Dolev, C Dwork, L Stockmeyer. 1985. dl.acm.org Proceedings of the …. 35 cites.
    431. The consistent comparison problem in N-version software“. SS Brilliant, JC Knight, NG Leveson. 1987. dl.acm.org ACM SIGSOFT Software …. 35 cites.
    432. How to model link failures: A perception-based fault model“. U Schmid. 2001. ieeexplore.ieee.org Dependable Systems and Networks, 2001. DSN …. 35 cites.
    433. A secure sharding protocol for open blockchains“. L Luu, V Narayanan, C Zheng, K Baweja, …. 2016. dl.acm.org Proceedings of the …. 35 cites.
    434. Self-stabilizing byzantine digital clock synchronization“. EN Hoch, D Dolev, A Daliot. 2006. Springer SSS. 34 cites.
    435. Byzantine agreement in the full-information model in O (log n) rounds“. M Ben-Or, E Pavlov, V Vaikuntanathan. 2006. dl.acm.org … of the thirty-eighth annual ACM …. 34 cites.
    436. Verifying randomized Byzantine agreement“. M Kwiatkowska, G Norman. 2002. Springer FORTE. 34 cites.
    437. Byzantine agreement secure against general adversaries in the dual failure model“. B Altmann, M Fitzi, U Maurer. 1999. Springer International Symposium on Distributed …. 34 cites.
    438. EBAWA: Efficient Byzantine agreement for wide-area networks“. GS Veronese, M Correia, AN Bessani, …. 2010. ieeexplore.ieee.org … (HASE), 2010 IEEE …. 34 cites.
    439. Reliable Broadcast in a Computational Hybrid Model with Byzantine Faults, Crashes, and Recoveries.“. M Backes, C Cachin. 2003. zurich.ibm.com DSN. 34 cites.
    440. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast“. HGV Ramasamy, C Cachin. 2005. Springer OPODIS. 34 cites.
    441. Low complexity resilient consensus in networked multi-agent systems with adversaries“. HJ LeBlanc, XD Koutsoukos. 2012. dl.acm.org Proceedings of the 15th ACM international …. 34 cites.
    442. On k-set consensus problems in asynchronous systems“. R De Prisco, D Malkhi, M Reiter. 2001. ieeexplore.ieee.org IEEE Transactions on Parallel …. 34 cites.
    443. Consensus in the presence of partial synchrony (preliminary version)“. C Dwork, N Lynch, L Stockmeyer. 1984. dl.acm.org Proceedings of the third annual ACM …. 34 cites.
    444. On protocol security in the cryptographic model“. JB Nielsen. 2003. brics.dk . 34 cites.
    445. Middleware support for voting and data fusion“. DE Bakken, Z Zhan, CC Jones, …. 2001. ieeexplore.ieee.org … Systems and Networks …. 34 cites.
    446. Asynchronous byzantine consensus“. C Attiya, D Dolev, J Gil. 1984. dl.acm.org Proceedings of the third annual ACM …. 33 cites.
    447. From Byzantine consensus to BFT state machine replication: A latency-optimal transformation“. J Sousa, A Bessani. 2012. ieeexplore.ieee.org Dependable Computing Conference …. 33 cites.
    448. Grouping byzantine agreement“. KQ Yan, SC Wang. 2005. Elsevier Computer Standards & Interfaces. 33 cites.
    449. Byzantine failures and security: Arbitrary is not (always) random“. FC Gärtner. 2003. infoscience.epfl.ch . 33 cites.
    450. Efficient player-optimal protocols for strong and differential consensus“. M Fitzi, JA Garay. 2003. dl.acm.org Proceedings of the twenty-second annual symposium …. 33 cites.
    451. Efficient data aggregation middleware for wireless sensor networks“. M Kumar, L Schwiebert, …. 2004. ieeexplore.ieee.org Mobile Ad-hoc and …. 33 cites.
    452. The Fault Detection Problem.“. A Haeberlen, P Kuznetsov. 2009. Springer OPODIS. 33 cites.
    453. Using knowledge to optimally achieve coordination in distributed systems“. G Neiger, R Bazzi. 1992. dl.acm.org Proceedings of the 4th conference on Theoretical …. 33 cites.
    454. Designing algorithms for dependent process failures“. F Junqueira, K Marzullo. 2003. Springer Future directions in distributed computing. 33 cites.
    455. Best-case complexity of asynchronous Byzantine consensus“. P Dutta, R Guerraoui, M Vukolic. 2005. academia.edu . 32 cites.
    456. Connectivity requirements for Byzantine agreement under restricted types of failures“. V Hadzilacos. 1987. Springer Distributed Computing. 32 cites.
    457. Consensus in the presence of timing uncertainty: omission and byzantine failures“. S Ponzio. 1991. dl.acm.org Proceedings of the tenth annual ACM symposium on …. 32 cites.
    458. Unconditional Byzantine agreement and multi-party computation secure against dishonest minorities from scratch“. M Fitzi, N Gisin, U Maurer, O Von Rotz. 2002. Springer … on the Theory and Applications of …. 32 cites.
    459. Experimental demonstration of a quantum protocol for byzantine agreement and liar detection“. S Gaertner, M Bourennane, C Kurtsiefer, A Cabello, …. 2008. APS Physical review …. 32 cites.
    460. Steward: Scaling Byzantine fault-tolerant replication to wide area networks“. Y Amir, C Danilov, D Dolev, J Kirsch, …. 2010. ieeexplore.ieee.org … on Dependable and …. 32 cites.
    461. Synchronous consensus for dependent process failures“. FP Junqueira, K Marzullo. 2003. ieeexplore.ieee.org Distributed Computing Systems …. 32 cites.
    462. Achieving efficient agreement within a dual-failure cloud-computing environment“. SS Wang, KQ Yan, SC Wang. 2011. Elsevier Expert Systems with Applications. 32 cites.
    463. Future directions in distributed computing: research and position papers“. A Schiper, AA Shvartsman, H Weatherspoon, BY Zhao. 2003. books.google.com . 32 cites.
    464. Bitcoin meets strong consistency“. C Decker, J Seidel, R Wattenhofer. 2016. dl.acm.org Proceedings of the 17th International …. 32 cites.
    465. The noisy oracle problem“. U Feige, A Shamir, M Tennenholtz. 1988. Springer … on the Theory and Application of …. 32 cites.
    466. Smart redundancy for distributed computation“. Y Brun, G Edwards, JY Bang, …. 2011. ieeexplore.ieee.org … Systems (ICDCS), 2011 …. 32 cites.
    467. Toward trustworthy coordination of Web services business activities“. H Chai, H Zhang, W Zhao, …. 2013. ieeexplore.ieee.org IEEE Transactions …. 32 cites.
    468. The distributed firing squad problem“. BA Coan, D Dolev, C Dwork, L Stockmeyer. 1989. SIAM SIAM Journal on Computing. 32 cites.
    469. Fault-injection-based testing of fault-tolerant algorithms in message-passing parallel computers“. DM Blough, T Torii. 1997. ieeexplore.ieee.org Fault-Tolerant Computing, 1997. FTCS-27 …. 32 cites.
    470. Round-efficient secure computation in point-to-point networks“. J Katz, CY Koo. 2007. Springer Advances in Cryptology-EUROCRYPT 2007. 32 cites.
    471. Byzantine agreement given partial broadcast“. J Considine, M Fitzi, M Franklin, LA Levin, U Maurer, …. 2005. Springer Journal of …. 31 cites.
    472. Byzantine Agreement Under Restricted Types of Failures:(not Telling the Truth is Different from Telling Lies)“. V Hadzilacos. 1983. Center for Research in Computing … . 31 cites.
    473. A tight lower bound for randomized synchronous consensus“. Z Bar-Joseph, M Ben-Or. 1998. dl.acm.org Proceedings of the seventeenth annual ACM …. 31 cites.
    474. Booting clock synchronization in partially synchronous systems“. J Widder. 2003. Springer DISC. 31 cites.
    475. Optimistic Asynchronous Atomic Broadcast.“. K Kursawe, V Shoup. 2005. Springer ICALP. 31 cites.
    476. A framework to support survivable web services“. W Li, J He, Q Ma, IL Yen, F Bastani, …. 2005. ieeexplore.ieee.org Parallel and Distributed …. 31 cites.
    477. System and method for effectuating distributed consensus among members of a processor set in a multiprocessor computing system through the use of shared storage …“. JM Reuter, L Lamport, E Gafni. 2002. Google Patents US Patent 6,463,532. 31 cites.
    478. The k-simultaneous consensus problem“. Y Afek, E Gafni, S Rajsbaum, M Raynal, …. 2010. Springer Distributed Computing. 31 cites.
    479. On self-stabilizing synchronous actions despite byzantine attacks“. D Dolev, EN Hoch. 2007. Springer DISC. 30 cites.
    480. Stability of long-lived consensus“. S Dolev, S Rajsbaum. 2003. Elsevier Journal of Computer and System Sciences. 30 cites.
    481. Continual on-line diagnosis of hybrid faults“. CJ Walter, N Suri, MM Hugue. 1995. Springer Dependable Computing for Critical …. 30 cites.
    482. Secure reliable multicast protocols in a WAN“. D Malkhi, M Merritt, O Rodeh. 1997. ieeexplore.ieee.org Distributed Computing Systems …. 30 cites.
    483. Efficient asynchronous secure multiparty distributed computation“. K Srinathan, CP Rangan. 2000. Springer International Conference on Cryptology in India. 30 cites.
    484. Distributed agreement and its relation with error-correcting codes“. R Friedman, A Mostéfaoui, S Rajsbaum, …. 2002. Springer Distributed Computing. 29 cites.
    485. Lower bounds for randomized consensus under a weak adversary“. H Attiya, K Censor-Hillel. 2010. SIAM SIAM Journal on Computing. 29 cites.
    486. Complexity issues in automated synthesis of failsafe fault-tolerance“. SS Kulkarni, A Ebnenasir. 2005. ieeexplore.ieee.org IEEE Transactions on Dependable …. 29 cites.
    487. Reasoning about uncertainty in fault-tolerant distributed systems“. MJ Fischer, LD Zuck. 1988. Springer International Symposium on Formal Techniques in …. 29 cites.
    488. Secure content access and replication in pure p2p networks“. E Palomar, JME Tapiador, JC Hernandez-Castro, …. 2008. Elsevier Computer …. 29 cites.
    489. Byzantine agreement with homonyms“. C Delporte-Gallet, H Fauconnier, R Guerraoui, …. 2011. dl.acm.org Proceedings of the 30th …. 28 cites.
    490. On the improbability of reaching Byzantine agreements“. RL Graham, AC Yao. 1989. dl.acm.org Proceedings of the twenty-first annual ACM …. 28 cites.
    491. Zyzzyva: speculative byzantine fault tolerance“. R Kotla, A Clement, E Wong, L Alvisi, …. 2008. dl.acm.org Communications of the …. 28 cites.
    492. Reaching fault diagnosis agreement under a hybrid fault model“. HS Hsiao, YH Chin, WP Yang. 2000. ieeexplore.ieee.org IEEE Transactions on …. 28 cites.
    493. Simulating crash failures with many faulty processors“. R Bazzi, G Neiger. 1992. Springer Distributed Algorithms. 28 cites.
    494. Simulating crash failures with many faulty processors“. R Bazzi, G Neiger. 1992. Springer Distributed Algorithms. 28 cites.
    495. Pseudo-signatures, broadcast, and multi-party computation from correlated randomness“. M Fitzi, S Wolf, J Wullschleger. 2004. Springer CRYPTO. 28 cites.
    496. Byzantine vector consensus in complete graphs“. NH Vaidya, VK Garg. 2013. dl.acm.org Proceedings of the 2013 ACM symposium on …. 27 cites.
    497. Self-stabilization of byzantine protocols“. A Daliot, D Dolev. 2005. Springer Self-Stabilizing Systems. 27 cites.
    498. Synchronous consensus under hybrid process and link failures“. M Biely, U Schmid, B Weiss. 2011. Elsevier Theoretical Computer Science. 27 cites.
    499. Recursion in Distributed Computing.“. E Gafni, S Rajsbaum. 2010. Springer SSS. 27 cites.
    500. Supporting customized failure models for distributed software“. MA Hiltunen, V Immanuel, …. 1999. iopscience.iop.org Distributed Systems …. 27 cites.
    501. Bitcoin: under the hood“. A Zohar. 2015. dl.acm.org Communications of the ACM. 27 cites.
    502. Fast byzantine agreement in dynamic networks“. J Augustine, G Pandurangan, P Robinson. 2013. dl.acm.org Proceedings of the 2013 …. 26 cites.
    503. Sharing memory between Byzantine processes using policy-enforced tuple spaces“. AN Bessani, M Correia, …. 2009. ieeexplore.ieee.org IEEE Transactions on …. 26 cites.
    504. Simple constant-time consensus protocols in realistic failure models“. B Chor, M Merritt, DB Shmoys. 1985. dl.acm.org Proceedings of the fourth annual ACM …. 26 cites.
    505. Consensus of second-order multi-agent systems in the presence of locally bounded faults“. SM Dibaji, H Ishii. 2015. Elsevier Systems & Control Letters. 26 cites.
    506. The CRUTIAL reference critical information infrastructure architecture: a blueprint“. P Veríssimo, N Ferreira Neves, …. 2008. inderscienceonline.com International Journal of …. 26 cites.
    507. Customizable fault tolerance forwide-area replication“. Y Amir, B Coan, J Kirsch, J Lane. 2007. ieeexplore.ieee.org Reliable Distributed Systems …. 26 cites.
    508. Dynamic testing strategy for distributed systems“. FJ Meyer, DK Pradhan. 1989. ieeexplore.ieee.org IEEE Transactions on Computers. 26 cites.
    509. Dynamic testing strategy for distributed systems“. FJ Meyer, DK Pradhan. 1989. ieeexplore.ieee.org IEEE Transactions on Computers. 26 cites.
    510. The paxos register“. HC Li, A Clement, AS Aiyer, …. 2007. ieeexplore.ieee.org … Distributed Systems, 2007 …. 25 cites.
    511. Automatic generation of fault-tolerant corba-services“. A Polze, J Schwarz, M Malek. 2000. ieeexplore.ieee.org Technology of Object-Oriented …. 25 cites.
    512. Fault-tolerant distributed computing in full-information networks“. S Goldwasser, E Pavlov, …. 2006. ieeexplore.ieee.org … of Computer Science …. 25 cites.
    513. Byzantine consensus in asynchronous message-passing systems: a survey“. M Correia, GS Veronese, NF Neves, …. 2011. inderscienceonline.com … Journal of Critical …. 24 cites.
    514. Iterative Approximate Byzantine Consensus under a Generalized Fault Model.“. L Tseng, NH Vaidya. 2013. Springer ICDCN. 24 cites.
    515. Error-free multi-valued consensus with Byzantine failures“. G Liang, N Vaidya. 2011. dl.acm.org Proceedings of the 30th annual ACM SIGACT …. 24 cites.
    516. Byzantine agreement with a rational adversary“. A Groce, J Katz, A Thiruvengadam, V Zikas. 2012. Springer Automata, languages, and …. 24 cites.
    517. Simple and efficient asynchronous byzantine agreement with optimal resilience“. A Patra, A Choudhary, C Pandu Rangan. 2009. dl.acm.org Proceedings of the 28th ACM …. 24 cites.
    518. Information-theoretic pseudosignatures and byzantine agreement for t≥ n/3“. B Pfitzmann, M Waidner. 1996. academia.edu . 24 cites.
    519. Compositional design of multitolerant repetitive Byzantine agreement“. SS Kulkarni, A Arora. 1997. Springer … Conference on Foundations of Software Technology …. 24 cites.
    520. Tendermint: Consensus without mining“. J Kwon. 2014. cdn.relayto.com Draft v. 0.6, fall. 24 cites.
    521. BFT: the time is now“. A Clement, M Marchetti, E Wong, L Alvisi, …. 2008. dl.acm.org Proceedings of the 2nd …. 24 cites.
    522. Optimal resiliency against mobile faults“. H Buhrman, JA Garay, …. 1995. ieeexplore.ieee.org Fault-Tolerant Computing …. 24 cites.
    523. System for dynamic, scalable secure sub-grouping in mobile ad-hoc networks“. B Dutertre. 2002. Google Patents US Patent App. 10/185,961. 24 cites.
    524. System for dynamic, scalable secure sub-grouping in mobile ad-hoc networks“. B Dutertre. 2002. Google Patents US Patent App. 10/185,961. 24 cites.
    525. Fault detection for Byzantine quorum systems“. L Alvisi, D Malkhi, E Pierce, …. 1999. ieeexplore.ieee.org … Computing for Critical …. 24 cites.
    526. Iterative Byzantine Vector Consensus in Incomplete Graphs.“. NH Vaidya. 2014. books.google.com ICDCN. 23 cites.
    527. P systems and the Byzantine agreement“. MJ Dinneen, YB Kim, R Nicolescu. 2010. Elsevier The Journal of Logic and Algebraic …. 23 cites.
    528. Fast byzantine agreement“. N Braud-Santoni, R Guerraoui, F Huc. 2013. dl.acm.org … of the 2013 ACM symposium on …. 23 cites.
    529. Asynchronous agreement and its relation with error-correcting codes“. R Friedman, A Mostefaoui, …. 2007. ieeexplore.ieee.org IEEE Transactions on …. 23 cites.
    530. Families of consensus algorithms“. A Bar-Noy, D Dolev. 1988. Springer VLSI Algorithms and Architectures. 23 cites.
    531. The real byzantine generals“. K Driscoll, B Hall, M Paulitsch, …. 2004. ieeexplore.ieee.org … , 2004. DASC 04 …. 23 cites.
    532. Consensus algorithms with one-bit messages“. A Bar-Noy, D Dolev. 1991. Springer Distributed Computing. 23 cites.
    533. Reaching agreement among virtual subnets in hybrid failure mode“. SC Wang, KQ Yan, SS Wang, …. 2008. ieeexplore.ieee.org IEEE Transactions on …. 23 cites.
    534. A framework for responsive parallel computing in network-based systems“. M Malek, A Polze, M Werner. 1995. informatik.hu-berlin.de . 23 cites.
    535. A framework for responsive parallel computing in network-based systems“. M Malek, A Polze, M Werner. 1995. informatik.hu-berlin.de . 23 cites.
    536. Abstractions for fault tolerance in distributed systems“. FB Schneider. 1986. ecommons.cornell.edu . 23 cites.
    537. Two-threshold broadcast and detectable multi-party computation“. M Fitzi, M Hirt, T Holenstein, J Wullschleger. 2003. Springer Advances in Cryptology …. 23 cites.
    538. Hybrid consensus: Efficient consensus in the permissionless model“. R Pass, E Shi. 2017. drops.dagstuhl.de LIPIcs-Leibniz International Proceedings in …. 23 cites.
    539. Formal verification of an Oral Messages algorithm for interactive consistency“. J Rushby. 2003. dl.acm.org . 23 cites.
    540. Atomic broadcast in a real-time environment“. F Cristian, D Dolev, R Strong, H Aghili. 1990. Springer Fault-Tolerant Distributed …. 23 cites.
    541. Atomic broadcast in a real-time environment“. F Cristian, D Dolev, R Strong, H Aghili. 1990. Springer Fault-Tolerant Distributed …. 23 cites.
    542. Asynchronous Byzantine consensus with 2f+ 1 processes“. M Correia, GS Veronese, LC Lung. 2010. dl.acm.org … of the 2010 ACM symposium on …. 22 cites.
    543. Matrix representation of iterative approximate Byzantine consensus in directed graphs“. N Vaidya. 2012. arxiv.org arXiv preprint arXiv:1203.1888. 22 cites.
    544. From Almost Everywhere to Everywhere: Byzantine Agreement with Õ (n3/2) Bits.“. V King, J Saia. 2009. Springer DISC. 22 cites.
    545. Efficient algorithms for anonymous Byzantine agreement“. M Okun, A Barak. 2008. Springer Theory of Computing Systems. 22 cites.
    546. BFTW 3: why? when? where? workshop on the theory and practice of byzantine fault tolerance“. P Kuznetsov, R Rodrigues. 2010. dl.acm.org ACM SIGACT News. 22 cites.
    547. Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas“. M Serafini, P Bokor, D Dobre, …. 2010. ieeexplore.ieee.org … and Networks (DSN) …. 22 cites.
    548. Design and implementation of a Byzantine fault tolerance framework for web services“. W Zhao. 2009. Elsevier Journal of Systems and Software. 22 cites.
    549. Mechanical verification of a schematic byzantine clock synchronization algorithm“. N Shankar. 1991. dl.acm.org . 22 cites.
    550. Gossiping to reach consensus“. BS Chlebus, DR Kowalski. 2002. dl.acm.org Proceedings of the fourteenth annual ACM …. 22 cites.
    551. Semisynchrony and real time“. S Ponzio, R Strong. 1992. Springer Distributed Algorithms. 22 cites.
    552. Reducing communication costs in robust peer-to-peer networks“. J Saia, M Young. 2008. Elsevier Information Processing Letters. 22 cites.
    553. Signature-free asynchronous byzantine consensus with t< n/3 and o (n 2) messages“. A Mostefaoui, H Moumen, M Raynal. 2014. dl.acm.org … of the 2014 ACM symposium on …. 21 cites.
    554. Randomized byzantine agreement“. KJ Perry. 1985. ieeexplore.ieee.org IEEE Transactions on Software Engineering. 21 cites.
    555. A characterization of eventual Byzantine agreement“. JY Halpern, Y Moses, O Waarts. 2001. SIAM SIAM Journal on Computing. 21 cites.
    556. Adaptively secure broadcast“. M Hirt, V Zikas. 2010. dl.acm.org Proceedings of the 29th Annual international …. 21 cites.
    557. A byzantine fault tolerant distributed commit protocol“. W Zhao. 2007. ieeexplore.ieee.org … , Autonomic and Secure Computing, 2007. DASC …. 21 cites.
    558. Randomized asynchronous consensus with imperfect communications“. U Schmid, C Fetzer. 2003. ieeexplore.ieee.org Reliable Distributed Systems, 2003 …. 21 cites.
    559. On the diagnosis of Byzantine faults“. KVS Ramarao, JC Adams. 1988. ieeexplore.ieee.org Reliable Distributed Systems, 1988 …. 21 cites.
    560. Simultaneity is harder than agreement“. BA Coan, C Dwork. 1991. Elsevier Information and Computation. 21 cites.
    561. Design and implementation of a Byzantine fault tolerance framework for non-deterministic applications“. H Zhang, W Zhao, LE Moser, PM Melliar-Smith. 2011. IET IET software. 21 cites.
    562. Design and implementation of a Byzantine fault tolerance framework for non-deterministic applications“. H Zhang, W Zhao, LE Moser, PM Melliar-Smith. 2011. IET IET software. 21 cites.
    563. A conflict neighbouring negotiation algorithm for resource services in dynamic collaborations“. S Nepal, J Zic. 2008. ieeexplore.ieee.org Services Computing, 2008. SCC’08. IEEE …. 21 cites.
    564. To what extent was the Byzantine Empire the Suzerain of the Latin Crusading States?“. JL La Monte. 1932. JSTOR Byzantion. 21 cites.
    565. On expected constant-round protocols for Byzantine agreement“. J Katz, CY Koo. 2009. Elsevier Journal of Computer and System Sciences. 20 cites.
    566. A Faster P Solution for the Byzantine Agreement Problem.“. MJ Dinneen, YB Kim, R Nicolescu. 2010. Springer Int. Conf. on Membrane Computing. 20 cites.
    567. The Byzantine agreement problem: optimal early stopping“. AW Krings, T Feyer. 1999. ieeexplore.ieee.org … , 1999. HICSS-32. Proceedings of the …. 20 cites.
    568. How fast can eventual synchrony lead to consensus?“. P Dutta, R Guerraoui, L Lamport. 2005. ieeexplore.ieee.org Dependable Systems and …. 20 cites.
    569. Byzantine Fault Isolation in the Farsite Distributed File System.“. JR Douceur, J Howell. 2006. pdfs.semanticscholar.org IPTPS. 20 cites.
    570. Fast consensus in networks of bounded degree“. P Berman, JA Garay. 1993. Springer Distributed Computing. 20 cites.
    571. Experimental comparison of local and shared coin randomized consensus protocols“. H Moniz, NF Neves, M Correia, …. 2006. ieeexplore.ieee.org … Systems, 2006. SRDS’ …. 20 cites.
    572. Using conditions to expedite consensus in synchronous distributed systems“. A Mostefaoui, S Rajsbaum, M Raynal. 2003. Springer DISC. 20 cites.
    573. Consensus and membership in synchronous and asynchronous distributed systems“. A Galleni, D Powell. 1996. research.cs.ncl.ac.uk LAAS Report. 20 cites.
    574. Flipping persuasively in constant expected time“. C Dwork, D Shmoys, …. 1986. ieeexplore.ieee.org Foundations of Computer …. 20 cites.
    575. Degree-based clustering algorithms for wireless ad hoc networks under attack“. C Tselikis, S Mitropoulos, N Komninos, …. 2012. ieeexplore.ieee.org IEEE …. 20 cites.
    576. An agent-based intrusion detection system for local area networks“. J Sen. 2010. arxiv.org arXiv preprint arXiv:1011.1531. 20 cites.
    577. An agent-based intrusion detection system for local area networks“. J Sen. 2010. arxiv.org arXiv preprint arXiv:1011.1531. 20 cites.
    578. Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency.“. Z Milosevic, M Hutle, A Schiper. 2009. Springer OPODIS. 19 cites.
    579. SCP: A Computationally-Scalable Byzantine Consensus Protocol For Blockchains.“. L Luu, V Narayanan, K Baweja, C Zheng, …. 2015. weusecoins.com IACR Cryptology …. 19 cites.
    580. Self-stabilizing byzantine agreement“. A Daliot, D Dolev. 2006. dl.acm.org Proceedings of the twenty-fifth annual ACM …. 19 cites.
    581. A simple model for agreement in distributed systems“. D Dolev. 1990. Springer Fault-Tolerant Distributed Computing. 19 cites.
    582. BTS: A Byzantine fault-tolerant tuple space“. AN Bessani, J da Silva Fraga, LC Lung. 2006. dl.acm.org … of the 2006 ACM symposium on …. 19 cites.
    583. Objects shared by Byzantine processes“. D Malkhi, M Merritt, MK Reiter, G Taubenfeld. 2003. Springer Distributed Computing. 19 cites.
    584. Byzantine self-stabilizing pulse in a bounded-delay model“. D Dolev, EN Hoch. 2007. Springer SSS. 19 cites.
    585. Byzantine self-stabilizing pulse in a bounded-delay model“. D Dolev, EN Hoch. 2007. Springer SSS. 19 cites.
    586. Partitioning for efficient consensus“. M Barborak, M Malek. 1993. ieeexplore.ieee.org … , 1993, Proceeding of the Twenty-Sixth …. 19 cites.
    587. Byzantine fault-tolerant deferred update replication“. F Pedone, N Schiper. 2012. Springer Journal of the Brazilian Computer Society. 19 cites.
    588. Multi-party computation with hybrid security“. M Fitzi, T Holenstein, J Wullschleger. 2004. Springer EUROCRYPT. 19 cites.
    589. Sharing memory with semi-byzantine clients and faulty storage servers“. H Attiya, A Bar-Or. 2006. World Scientific Parallel Processing Letters. 19 cites.
    590. Byzantine agreement on mobile ad-hoc network“. SC Wang, WP Yang, CF Cheng. 2004. ieeexplore.ieee.org Networking, Sensing and …. 18 cites.
    591. On the price of equivocation in byzantine agreement“. A Jaffe, T Moscibroda, S Sen. 2012. dl.acm.org Proceedings of the 2012 ACM symposium …. 18 cites.
    592. Unconditional Byzantine agreement with good majority“. B Baum-Waidner, B Pfitzmann, M Waidner. 1991. Springer STACS 91. 18 cites.
    593. On the message complexity of binary byzantine agreement under crash failures“. ES Amdur, SM Weber, V Hadzilacos. 1992. Springer Distributed Computing. 18 cites.
    594. Synchronous consensus with mortal Byzantines“. J Widder, G Gridling, B Weiss, …. 2007. ieeexplore.ieee.org … Systems and Networks …. 18 cites.
    595. Reaching fault diagnosis agreement on an unreliable general network“. KQ Yan, SC Wang. 2005. Elsevier Information Sciences. 18 cites.
    596. Efficient distributed consensus with n=(3+ ɛ) t processors“. P Berman, JA Garay. 1991. Springer International Workshop on Distributed Algorithms. 18 cites.
    597. Patterns of communication in consensus protocols“. C Dwork, D Skeen. 1984. dl.acm.org Proceedings of the third annual ACM symposium on …. 18 cites.
    598. Fault tolerance in safety critical automotive applications: Cost of agreement as a limiting factor“. S Poledna. 1995. ieeexplore.ieee.org Fault-Tolerant Computing, 1995. FTCS-25. Digest …. 18 cites.
    599. A distributed approach for negotiating resource contributions in dynamic collaboration“. S Nepal, J Zic, J Chan. 2007. ieeexplore.ieee.org Parallel and Distributed Computing …. 18 cites.
    600. Probabilistic verification of a synchronous round-based consensus protocol“. HS Duggal, M Cukier, …. 1997. ieeexplore.ieee.org … Distributed Systems, 1997 …. 18 cites.
    601. Peer-to-peer techniques for data distribution in desktop grid computing platforms“. F Costa, L Silva, I Kelley, I Taylor. 2008. Springer Making Grids Work. 18 cites.
    602. Asynchronous approximate agreement“. AD Fekete. 1994. Elsevier Information and Computation. 18 cites.
    603. Distributed computing with imperfect randomness“. S Goldwasser, M Sudan, V Vaikuntanathan. 2005. Springer Distributed Computing. 18 cites.
    604. Turquois: Byzantine consensus in wireless ad hoc networks“. H Moniz, NF Neves, M Correia. 2010. ieeexplore.ieee.org Dependable Systems and …. 17 cites.
    605. Byzantine fault-tolerant consensus in wireless ad hoc networks“. H Moniz, NF Neves, M Correia. 2013. ieeexplore.ieee.org IEEE Transactions on Mobile …. 17 cites.
    606. An optimal probabilistic algorithm for synchronous byzantine agreement“. P Feldman, S Micali. 1989. Springer Automata, languages and programming. 17 cites.
    607. Fast byzantine paxos“. JP Martin, L Alvisi. 2004. cs.utexas.edu Proceedings of the International Conference on …. 17 cites.
    608. Total ordering algorithms for asynchronous Byzantine systems“. LE Moser, PM Melliar-Smith. 1995. Springer International Workshop on Distributed …. 17 cites.
    609. Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures.“. V Bhandari, NH Vaidya. 2007. pdfs.semanticscholar.org DIALM-POMC. 17 cites.
    610. Synchronous condition-based consensus“. A Mostefaoui, S Rajsbaum, M Raynal. 2006. Springer Distributed Computing. 17 cites.
    611. Agreement problems in fault-tolerant distributed systems“. B Charron-Bost. 2001. Springer SOFSEM. 17 cites.
    612. Byzantine Chain Replication.“. R Van Renesse, C Ho, N Schiper. 2012. Springer OPODIS. 17 cites.
    613. Quick atomic broadcast“. P Berman, AA Bharali. 1993. Springer International Workshop on Distributed Algorithms. 17 cites.
    614. The unstoppable orchestra: A responsive distributed application“. M Werner, A Polze, M Malek. 1996. ieeexplore.ieee.org … Distributed Systems, 1996 …. 17 cites.
    615. Optimal communication in networks with randomly distributed Byzantine faults“. DM Blough, A Pelc. 1993. Wiley Online Library Networks. 17 cites.
    616. Distributed trust: Supporting fault-tolerance and attack-tolerance“. FB Schneider, L Zhou. 2004. ecommons.cornell.edu . 17 cites.
    617. Adaptability and the Usefulness of Hints“. P Berman, JA Garay. 1998. Springer European Symposium on Algorithms. 17 cites.
    618. Asynchronous Computational VSS with Reduced Communication Complexity.“. M Backes, A Datta, A Kate. 2013. Springer CT-RSA. 17 cites.
    619. Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value“. A Mostéfaoui, M Raynal. 2010. Springer International Conference On Principles Of …. 16 cites.
    620. Byzantine algorithms in wireless sensors network“. R Klempous, J Nikodem, L Radosz, …. 2006. ieeexplore.ieee.org … and Automation, 2006 …. 16 cites.
    621. Optimal amortized distributed consensus“. A Barnoy, X Deng, JA Garay, T Kameda. 1995. Elsevier Information and Computation. 16 cites.
    622. A fault-tolerant scheme for an autonomous local wireless sensor network“. HC Hsieh, JS Leu, WK Shih. 2010. Elsevier Computer Standards & Interfaces. 16 cites.
    623. Towards low latency state machine replication for uncivil wide-area networks“. Y Mao, FP Junqueira, …. 2009. sysnet.sysnet.ucsd.edu Workshop on Hot Topics …. 16 cites.
    624. Comparing primary-backup and state machines for crash failures“. JB Sussman, K Marzullo. 1996. dl.acm.org Proceedings of the fifteenth annual ACM …. 16 cites.
    625. Method and apparatus for improved security in distributed-environment voting“. KA Kwiat, BC Hardekopf. 2004. Google Patents US Patent 6,704,887. 16 cites.
    626. Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing“. M Bellare, JA Garay, T Rabin. 1996. dl.acm.org Proceedings of the fifteenth annual ACM …. 16 cites.
    627. Automatic verification and discovery of byzantine consensus protocols“. P Zielinski. 2007. ieeexplore.ieee.org Dependable Systems and Networks, 2007. DSN’07 …. 15 cites.
    628. An improved byzantine agreement algorithm for synchronous systems with mobile faults“. N Banu, S Souissi, T Izumi, …. 2012. pdfs.semanticscholar.org International Journal of …. 15 cites.
    629. Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity“. A Patra. 2011. dl.acm.org Proceedings of the 15th international conference on …. 15 cites.
    630. Mobile Byzantine Agreement on Arbitrary Network.“. T Sasaki, Y Yamauchi, S Kijima, M Yamashita. 2013. books.google.com OPODIS. 15 cites.
    631. Agreement in the presence of faults, on networks of bounded degree“. M Ben-Or, D Ron. 1996. Elsevier Information Processing Letters. 15 cites.
    632. Agreement and atomic broadcast in asynchronous networks“. C Cachin, K Kursawe, V Shoup, F Petzold. 2005. Google Patents US Patent 6,931,431. 15 cites.
    633. On the (limited) power of non-equivocation“. A Clement, F Junqueira, A Kate, …. 2012. dl.acm.org Proceedings of the 2012 …. 15 cites.
    634. Randomized wait-free consensus using an atomicity assumption“. L Cheung. 2005. Springer OPODIS. 15 cites.
    635. Egocentric voting algorithms“. MH Aeadmanesh, AW Krings. 1997. ieeexplore.ieee.org IEEE Transactions on Reliability. 15 cites.
    636. Maximizing multi-sensor system dependability“. RR Brooks, SS Iyengar. 1996. ieeexplore.ieee.org Multisensor Fusion and Integration for …. 15 cites.
    637. Scalable and secure polling in dynamic distributed networks“. S Gambs, R Guerraoui, H Harkous, …. 2012. ieeexplore.ieee.org … (SRDS), 2012 IEEE …. 15 cites.
    638. Reliable broadcast in radio networks with locally bounded failures“. V Bhandari, NH Vaidya. 2010. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 15 cites.
    639. A Synthesized Algorithm for Interactive Consistency.“. A Gascón, A Tiwari. 2014. books.google.com NASA Formal Methods. 15 cites.
    640. Adaptively secure broadcast, revisited“. JA Garay, J Katz, R Kumaresan, HS Zhou. 2011. dl.acm.org Proceedings of the 30th …. 15 cites.
    641. A Leader-Free Byzantine Consensus Algorithm.“. F Borran, A Schiper. 2010. Springer ICDCN. 14 cites.
    642. Signature-free asynchronous binary Byzantine consensus with t< n/3, O (n2) messages, and O (1) expected time“. A Mostéfaoui, H Moumen, M Raynal. 2015. dl.acm.org Journal of the ACM (JACM). 14 cites.
    643. Modular construction of an efficient 1-bit Byzantine agreement protocol“. BA Coan, JL Welch. 1993. Springer Mathematical systems theory. 14 cites.
    644. Partially authenticated algorithms for byzantine agreement“. M Borcherding. 1996. pdfs.semanticscholar.org … of the 9th International Conference on …. 14 cites.
    645. Scalable byzantine agreement“. CS Lewis, J Saia. 2004. cs.unm.edu Technical Report. 14 cites.
    646. Achieving Byzantine agreement in a generalized network model“. SC Wang, YH Chin, KQ Yan, …. 1989. ieeexplore.ieee.org CompEuro’89.,’VLSI and …. 14 cites.
    647. Coordinated traversal:(t+ 1)-round Byzantine agreement in polynomial time“. Y Moses, O Waarts. 1994. Elsevier Journal of Algorithms. 14 cites.
    648. How to implement Bracha’s O (log n) byzantine agreement algorithm“. B Awerbuch, M Blum, B Chor, S Goldwasser, S Micali. 1985. Unpublished manuscript. 14 cites.
    649. Method of achieving optimistic multiple processor agreement in potentially asynchronous networks“. K Kursawe, V Shoup. 2004. Google Patents US Patent 6,754,845. 14 cites.
    650. The price of anonymity: Optimal consensus despite asynchrony, crash and anonymity“. F Bonnet, M Raynal. 2009. dl.acm.org Proceedings of the 23rd international conference …. 14 cites.
    651. Using trust in distributed consensus with adversaries in sensor and other networks“. X Liu, JS Baras. 2014. ieeexplore.ieee.org Information Fusion (FUSION), 2014 17th …. 14 cites.
    652. Byzantine multi-agent optimization: Part I“. L Su, N Vaidya. 2015. arxiv.org arXiv preprint arXiv:1506.04681. 14 cites.
    653. A simple median-based resilient consensus algorithm“. H Zhang, S Sundaram. 2012. ieeexplore.ieee.org Communication, Control, and …. 14 cites.
    654. Time bounds for decision problems in the presence of timing uncertainty and failures“. H Attiya, T Djerassi-Shintel. 2001. Elsevier Journal of Parallel and Distributed Computing. 14 cites.
    655. Time bounds for decision problems in the presence of timing uncertainty and failures“. H Attiya, T Djerassi-Shintel. 2001. Elsevier Journal of Parallel and Distributed Computing. 14 cites.
    656. Distributed agreement with optimal communication complexity“. S Gilbert, DR Kowalski. 2010. SIAM Proceedings of the twenty-first annual ACM-SIAM …. 14 cites.
    657. Distributed agreement with optimal communication complexity“. S Gilbert, DR Kowalski. 2010. SIAM Proceedings of the twenty-first annual ACM-SIAM …. 14 cites.
    658. Towards modeling and model checking fault-tolerant distributed algorithms“. A John, I Konnov, U Schmid, H Veith, …. 2013. Springer … SPIN Workshop on Model …. 14 cites.
    659. A theoretician’s view of fault tolerant distributed computing“. MJ Fischer. 1990. Springer Fault-tolerant distributed computing. 14 cites.
    660. A theoretician’s view of fault tolerant distributed computing“. MJ Fischer. 1990. Springer Fault-tolerant distributed computing. 14 cites.
    661. Selected Results from the Latest Decade of Quorum Systems Research.“. MG Merideth, MK Reiter. 2010. Springer Replication. 14 cites.
    662. On the performance of Byzantine fault-tolerant MapReduce“. P Costa, M Pasin, AN Bessani, …. 2013. ieeexplore.ieee.org IEEE Transactions on …. 14 cites.
    663. A fault-masking and transient-recovery model for digital flight-control systems“. J Rushby. 1993. Springer Formal techniques in real-time and fault-tolerant …. 14 cites.
    664. BFS solution for disjoint paths in P systems“. R Nicolescu, H Wu. 2011. Springer Unconventional Computation. 14 cites.
    665. BFS solution for disjoint paths in P systems“. R Nicolescu, H Wu. 2011. Springer Unconventional Computation. 14 cites.
    666. Byzantine consensus with few synchronous links“. M Hamouma, A Mostefaoui, G Trédan. 2007. Springer OPODIS. 13 cites.
    667. Practical Byzantine group communication“. V Drabkin, R Friedman, A Kama. 2006. ieeexplore.ieee.org … Computing Systems, 2006 …. 13 cites.
    668. Optimistically terminating consensus: All asynchronous consensus protocols in one framework“. P Zielinski. 2006. ieeexplore.ieee.org Parallel and Distributed Computing, 2006. ISPDC’ …. 13 cites.
    669. Fault-tolerant consensus in directed graphs“. L Tseng, NH Vaidya. 2015. dl.acm.org Proceedings of the 2015 ACM Symposium on …. 13 cites.
    670. On the reduction of atomic broadcast to consensus with Byzantine faults“. Z Milosevic, M Hutle, A Schiper. 2011. ieeexplore.ieee.org Reliable Distributed Systems …. 13 cites.
    671. Generic construction of consensus algorithms for benign and byzantine faults“. O Rütti, Z Milosevic, A Schiper. 2010. ieeexplore.ieee.org Dependable Systems and …. 13 cites.

#NAME?

  1. Lower bound for scalable byzantine agreement“. D Holtby, BM Kapron, V King. 2008. Springer Distributed Computing. 13 cites.
  2. Modular construction of nearly optimal Byzantine agreement protocols“. BA Coan, JL Welch. 1989. dl.acm.org Proceedings of the eighth annual ACM Symposium …. 13 cites.
  3. An optimal solution for byzantine agreement under a hierarchical cluster-oriented mobile ad hoc network“. SS Wang, KQ Yan, SC Wang. 2010. Elsevier Computers & electrical engineering. 13 cites.
  4. Scalable byzantine computation“. V King, J Saia. 2010. dl.acm.org ACM SIGACT News. 13 cites.
  5. Survivable consensus objects“. D Malkhi, MK Reiter. 1998. ieeexplore.ieee.org Reliable Distributed Systems, 1998 …. 13 cites.
  6. Byzantine fault tolerant coordination for web services atomic transactions“. W Zhao. 2007. Springer International Conference on Service-Oriented …. 13 cites.
  7. GRIP: Generic representatives in PRISM“. AF Donaldson, A Miller, D Parker. 2007. spiral.imperial.ac.uk . 13 cites.
  8. Resilient continuous-time consensus in fractional robust networks“. HJ LeBlanc, H Zhang, S Sundaram, …. 2013. ieeexplore.ieee.org American Control …. 13 cites.
  9. Enhanced dispatchability of aircrafts using multi-static configurations“. C Engel, E Jenn, PH Schmitt, R Coutinho, …. 2010. web1.see.asso.fr Embedded Real Time …. 13 cites.
  10. Byzantine paxos“. LB Lamport. 2009. Google Patents US Patent 7,565,433. 13 cites.
  11. Byzantium: Byzantine-Fault-Tolerant Database Replication Providing Snapshot Isolation.“. NM Preguiça, R Rodrigues, C Honorato, J Lourenço. 2008. static.usenix.org HotDep. 13 cites.
  12. BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration.“. S Duan, H Meling, S Peisert, H Zhang. 2014. books.google.com OPODIS. 13 cites.
  13. Tolerating arbitrary failures with state machine replication“. A Doudou, B Garbinato, R Guerraoui. 2005. infoscience.epfl.ch . 13 cites.
  14. Tolerating arbitrary failures with state machine replication“. A Doudou, B Garbinato, R Guerraoui. 2005. infoscience.epfl.ch . 13 cites.
  15. Gossip average consensus in a byzantine environment using stochastic set-valued observers“. D Silvestre, P Rosa, R Cunha, …. 2013. ieeexplore.ieee.org Decision and Control …. 12 cites.
  16. Proactive service migration for long-running Byzantine fault-tolerant systems“. W Zhao, H Zhang. 2009. IET IET software. 12 cites.
  17. Revisit consensus problem on dual link failure modes“. SC Wang, KQ Yan. 1998. ieeexplore.ieee.org Computer Software and Applications …. 12 cites.
  18. Modeling complexity in secure distributed computing“. C Cachin. 2003. Springer Future directions in distributed computing. 12 cites.
  19. Efficient statistical asynchronous verifiable secret sharing with optimal resilience“. A Patra, A Choudhary, CP Rangan. 2009. dl.acm.org Proceedings of the 4th international …. 12 cites.
  20. Efficient statistical asynchronous verifiable secret sharing with optimal resilience“. A Patra, A Choudhary, CP Rangan. 2009. dl.acm.org Proceedings of the 4th international …. 12 cites.
  21. Secure failure detection and consensus in trustedpals“. R Cortinas, FC Freiling, …. 2012. ieeexplore.ieee.org … on Dependable and …. 12 cites.
  22. Implementation of a customizable fault tolerance framework“. IL Yen, I Ahmed, R Jagannath, …. 1998. ieeexplore.ieee.org Object-Oriented Real …. 12 cites.
  23. A replication-and checkpoint-based approach for anomaly-based intrusion detection and recovery“. A Agbaria, R Friedman. 2005. ieeexplore.ieee.org Distributed Computing Systems …. 12 cites.
  24. Majority and unanimity in synchronous networks with ubiquitous dynamic faults“. N Santoro, P Widmayer. 2005. Springer Structural Information and Communication …. 12 cites.
  25. A robust and fault-tolerant distributed intrusion detection system“. J Sen. 2010. ieeexplore.ieee.org Parallel Distributed and Grid Computing (PDGC), 2010 …. 12 cites.
  26. Route bazaar: Automatic interdomain contract negotiation“. I Castro, A Panda, B Raghavan, S Shenker, S Gorinsky. 2015. usenix.org . 12 cites.
  27. Minimal Byzantine fault tolerance: Algorithm and evaluation“. GS Veronese, M Correia, AN Bessani, LC Lung, …. 2009. repositorio.ul.pt . 12 cites.
  28. Handling new adversaries in secure mobile ad-hoc networks“. VD Gligor. 2007. dtic.mil . 12 cites.
  29. Stabilizing consensus with many opinions“. L Becchetti, A Clementi, E Natale, F Pasquale, …. 2016. dl.acm.org Proceedings of the …. 12 cites.
  30. Computer system resilient to a wide class of failures“. JA Garay, KJ Perry. 1997. Google Patents US Patent 5,598,529. 12 cites.
  31. A formal correctness proof of the SPIDER diagnosis protocol“. A Geser, PS Miner. 2002. NASA; 1998 NASA CONFERENCE PUBLICATION. 12 cites.
  32. Assured cloud-based data analysis with ClusterBFT“. JJ Stephen, P Eugster. 2013. Springer ACM/IFIP/USENIX International Conference on …. 12 cites.
  33. Simple gradecast based algorithms“. M Ben-Or, D Dolev, EN Hoch. 2010. arxiv.org arXiv preprint arXiv:1007.1049. 11 cites.
  34. Efficient Byzantine agreement with faulty minority“. Z Beerliová-Trubíniová, M Hirt, M Riser. 2007. Springer Advances in Cryptology …. 11 cites.
  35. On byzantine agreement over (2, 3)-uniform hypergraphs“. DVS Ravikant, V Muthuramakrishnan, V Srikanth, …. 2004. Springer DISC. 11 cites.
  36. Tight bound on mobile byzantine agreement“. F Bonnet, X Défago, TD Nguyen, …. 2014. Springer … on Distributed Computing. 11 cites.
  37. Renaming in synchronous message passing systems with Byzantine failures“. M Okun, A Barak, E Gafni. 2008. Springer Distributed Computing. 11 cites.
  38. Brief Announcement: The BG-simulation for Byzantine mobile robots“. T Izumi, Z Bouzid, S Tixeuil, K Wada. 2011. Springer International Symposium on …. 11 cites.
  39. Bounded delay in Byzantine-tolerant state machine replication“. Z Milosevic, M Biely, A Schiper. 2013. ieeexplore.ieee.org Reliable Distributed Systems …. 11 cites.
  40. Bounded delay in Byzantine-tolerant state machine replication“. Z Milosevic, M Biely, A Schiper. 2013. ieeexplore.ieee.org Reliable Distributed Systems …. 11 cites.
  41. Byzantine fault-tolerant transaction processing for replicated databases“. AF Luiz, LC Lung, M Correia. 2011. ieeexplore.ieee.org Network Computing and …. 11 cites.
  42. Byzantine fault tolerant collaborative editing“. W Zhao, M Babi. 2013. IET . 11 cites.
  43. How to solve consensus in the smallest window of synchrony“. D Alistarh, S Gilbert, R Guerraoui, C Travers. 2008. Springer Distributed Computing. 11 cites.
  44. Continuous Consensus with Failures and Recoveries.“. T Mizrahi, Y Moses. 2008. Springer DISC. 11 cites.
  45. Decentralized consensus protocols with multi-port communication“. MS Chen, PS Yu, KL Wu. 1993. ieeexplore.ieee.org Distributed Computing Systems …. 11 cites.
  46. Decentralized consensus protocols with multi-port communication“. MS Chen, PS Yu, KL Wu. 1993. ieeexplore.ieee.org Distributed Computing Systems …. 11 cites.
  47. Improved fault tolerance and secure computation on sparse networks“. N Chandran, J Garay, R Ostrovsky. 2010. Springer International Colloquium on Automata …. 11 cites.
  48. Improved fault tolerance and secure computation on sparse networks“. N Chandran, J Garay, R Ostrovsky. 2010. Springer International Colloquium on Automata …. 11 cites.
  49. A bivalency proof of the lower bound for uniform consensus“. X Wang, YM Teo, J Cao. 2005. Elsevier Information Processing Letters. 11 cites.
  50. Methods and apparatus for scalable distributed management of wireless virtual private networks“. B Dutertre. 2007. Google Patents US Patent 7,246,232. 11 cites.
  51. A protocol for interledger payments“. S Thomas, E Schwartz. 2015. bravenewcoin.com URL https://interledger. org/interledger …. 11 cites.
  52. Solidus: An incentive-compatible cryptocurrency based on permissionless Byzantine consensus“. I Abraham, D Malkhi, K Nayak, L Ren, …. 2016. arxiv.org arXiv preprint arXiv …. 10 cites.
  53. Non-bayesian learning in the presence of byzantine agents“. L Su, NH Vaidya. 2016. Springer International Symposium on Distributed Computing. 10 cites.
  54. An optimal Byzantine agreement algorithm with arbitrary node and link failures“. M Biely. 2003. wwwold.ecs.tuwien.ac.at … IASTED International Conference on Parallel and …. 10 cites.
  55. Complexity of multi-value byzantine agreement“. G Liang, N Vaidya. 2010. arxiv.org arXiv preprint arXiv:1006.2422. 10 cites.
  56. Capacity of byzantine agreement with finite link capacity“. G Liang, N Vaidya. 2011. ieeexplore.ieee.org INFOCOM, 2011 Proceedings IEEE. 10 cites.
  57. An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time“. A Zamsky. 1996. dl.acm.org Proceedings of the fifteenth annual ACM symposium …. 10 cites.
  58. Iterative approximate consensus in the presence of byzantine link failures“. L Tseng, N Vaidya. 2014. Springer Networked Systems. 10 cites.
  59. Consensus with written messages under link faults“. B Weiss, U Schmid. 2001. ieeexplore.ieee.org Reliable Distributed Systems, 2001 …. 10 cites.
  60. Fast consensus in networks of bounded degree“. P Berman, JA Garay. 1990. Springer International Workshop on Distributed Algorithms. 10 cites.
  61. Fast Asynchronous Consensus with Optimal Resilience.“. I Abraham, MK Aguilera, D Malkhi. 2010. Springer DISC. 10 cites.
  62. Methods of approximate agreement for multisensor fusion“. RR Brooks, SS Iyengar. 1995. Signal Processing, Sensor Fusion and Target …. 10 cites.
  63. Evaluating Byzantine quorum systems“. WS Dantas, AN Bessani, …. 2007. ieeexplore.ieee.org … , 2007. SRDS 2007 …. 10 cites.
  64. Homonyms with forgeable identifiers“. C Delporte-Gallet, H Fauconnier. 2012. Springer International Colloquium on …. 10 cites.
  65. The synchronous condition-based consensus hierarchy“. A Mostéfaoui, S Rajsbaum, M Raynal. 2004. Springer DISC. 10 cites.
  66. Early-stopping k-set agreement in synchronous systems prone to any number of process crashes“. PR Parvedy, M Raynal, C Travers. 2005. Springer Lecture notes in computer science. 10 cites.
  67. Round complexity of authenticated broadcast with a dishonest majority“. JA Garay, J Katz, CY Koo, …. 2007. ieeexplore.ieee.org Foundations of Computer …. 10 cites.
  68. Multiparty equality function computation in networks with point-to-point links“. G Liang, N Vaidya. 2011. Springer International Colloquium on Structural Information and …. 10 cites.
  69. Reliable election in broadcast networks“. CT King, TB Gendreau, LM Ni. 1989. Elsevier Journal of Parallel and Distributed …. 10 cites.
  70. Real-time data management with clock-less reliable broadcast protocols“. P Veríssimo. 1990. ieeexplore.ieee.org … Data, 1990. Proceedings., Workshop on the. 10 cites.
  71. Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification and verification“. P Sinha, N Suri. 2001. ieeexplore.ieee.org Distributed Computing Systems, 2001. 21st …. 10 cites.
  72. The design and evaluation of a distributed reliable file system“. D Peric, T Bocek, FV Hecht, …. 2009. ieeexplore.ieee.org Parallel and …. 10 cites.
  73. Towards byzantine fault tolerance in many-core computing platforms“. CM Jeffery, RJO Figueiredo. 2007. ieeexplore.ieee.org Dependable Computing, 2007 …. 10 cites.
  74. Fault-detecting network membership protocols for unknown topologies“. K Echtle, M Leu. 1995. books.google.com Dependable Computing for Critical Applications. 10 cites.
  75. Distributed computing building blocks for rational agents“. Y Afek, Y Ginzberg, S Landau Feibish, …. 2014. dl.acm.org Proceedings of the 2014 …. 10 cites.
  76. Konsistenz und Fehlertoleranz in Verteilten Systemen—Das Problem der Byzantinischen Generäle“. R Reischuk, RD EARN. 1987. Springer GI—17. Jahrestagung Computerintegrierter …. 10 cites.
  77. Reaching approximate Byzantine consensus with multi-hop communication“. L Su, NH Vaidya. 2017. Elsevier Information and Computation. 9 cites.
  78. State machine replication with Byzantine faults“. C Cachin. 2010. Springer Replication. 9 cites.
  79. A p2p content authentication protocol based on byzantine agreement“. E Palomar, J Estevez-Tapiador, …. 2006. Springer Emerging Trends in …. 9 cites.
  80. Using Byzantine agreement in the design of IPS systems“. FCC Osorio. 2007. ieeexplore.ieee.org Performance, Computing, and Communications …. 9 cites.
  81. Byzantine agreement in polynomial expected time“. V King, J Saia. 2013. dl.acm.org Proceedings of the forty-fifth annual ACM symposium …. 9 cites.
  82. Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience.“. A Patra, CP Rangan. 2011. Springer ICITS. 9 cites.
  83. Capacity of Byzantine Agreement: Complete Characterization of Four-Node Networks“. G Liang, N Vaidya. 2010. dtic.mil . 9 cites.
  84. Decoupled quorum-based Byzantine-resilient coordination in open distributed systems“. AN Bessani, M Correia, …. 2007. ieeexplore.ieee.org … , 2007. NCA 2007 …. 9 cites.
  85. Authenticated Byzantine Generals in Dual Failure Model.“. A Gupta, P Gopal, P Bansal, K Srinathan. 2010. Springer ICDCN. 9 cites.
  86. Distributed consensus in the presence of sectional faults“. S Amitanand, I Sanketh, K Srinathant, V Vinod, …. 2003. dl.acm.org Proceedings of the …. 9 cites.
  87. An efficient Byzantine-resilient tuple space“. AN Bessani, M Correia, …. 2009. ieeexplore.ieee.org IEEE Transactions on …. 9 cites.
  88. Optimally simulating crash failures in a Byzantine environment“. R Bazzi, G Neiger. 1991. Springer International Workshop on Distributed Algorithms. 9 cites.
  89. Comparing the atomic commitment and consensus problems“. B Charron-Bost. 2003. Springer Future directions in distributed computing. 9 cites.
  90. Byzantine fault tolerant authentication“. V Pathak, L Iftode. 2002. academia.edu Poster at ACM WISE Workshop. 9 cites.
  91. An early fault diagnosis agreement under hybrid fault model“. ML Chiang, SC Wang, LY Tseng. 2009. Elsevier Expert Systems with Applications. 9 cites.
  92. Optimal agreement in a scale-free network environment“. SC Wang, KQ Yan, ML Chiang. 2006. content.iospress.com Informatica. 9 cites.
  93. Steward: Scaling byzantine fault-tolerant systems to wide area networks“. Y Amir, C Danilov, D Dolev, J Kirsch, …. 2005. ds2.cs.purdue.edu In Proceedings of the …. 9 cites.
  94. Synchronous counting and computational algorithm design“. D Dolev, JH Korhonen, C Lenzen, J Rybicki, …. 2013. Springer Symposium on Self …. 9 cites.
  95. On the correctness of an intrusion-tolerant group communication protocol“. M Layouni, J Hooman, S Tahar. 2003. Springer CHARME. 9 cites.
  96. From verified models to verifiable code“. L Lensink, CA Munoz, AE Goodloe. 2009. ntrs.nasa.gov . 9 cites.
  97. Making distributed applications robust“. C Ho, D Dolev, R Van Renesse. 2007. Springer International Conference On Principles …. 9 cites.
  98. Making distributed applications robust“. C Ho, D Dolev, R Van Renesse. 2007. Springer International Conference On Principles …. 9 cites.
  99. Revisiting liveness properties in the context of secure systems“. FC Gärtner. 2003. Springer Formal Aspects of Security. 9 cites.
  100. Anonymous agreement: The janus algorithm“. Z Bouzid, P Sutra, C Travers. 2011. Springer Principles of Distributed Systems. 9 cites.
  101. Resilient asymptotic consensus in asynchronous robust networks“. HJ LeBlanc, X Koutsoukos. 2012. ieeexplore.ieee.org Communication, Control, and …. 9 cites.
  102. A performance study on the signal-on-fail approach to imposing total order in the streets of byzantium“. QA Inayat, PD Ezhilchelvan. 2006. ieeexplore.ieee.org Dependable Systems and …. 9 cites.
  103. Achieving high efficient Byzantine Agreement with dual components failure mode on a multicasting network“. SC Wang, KQ Yan, CF Cheng. 2002. ieeexplore.ieee.org Parallel and Distributed …. 8 cites.
  104. Byzantine agreement protocol using hierarchical groups“. H Yoshino, N Hayashibara, …. 2005. ieeexplore.ieee.org Parallel and Distributed …. 8 cites.
  105. Byzantine Agreement Using Partial Authentication.“. P Bansal, P Gopal, A Gupta, K Srinathan, PK Vasishta. 2011. Springer DISC. 8 cites.
  106. On Byzantine generals with alternative plans“. M Correia, AN Bessani, P Veríssimo. 2008. Elsevier Journal of Parallel and Distributed …. 8 cites.
  107. Muteness failure detectors for consensus with Byzantine processes“. A Doudou, A Schiper. 1997. infoscience.epfl.ch . 8 cites.
  108. Broadcast using certified propagation algorithm in presence of byzantine faults“. L Tseng, N Vaidya, V Bhandari. 2012. arxiv.org arXiv preprint arXiv:1209.4620. 8 cites.
  109. Ocd: Obsessive consensus disorder (or repetitive consensus)“. D Dolev, EN Hoch. 2008. dl.acm.org Proceedings of the twenty-seventh ACM symposium …. 8 cites.
  110. Randomized agreement protocols“. M Ben-Or. 1990. Springer Fault-tolerant distributed computing. 8 cites.
  111. Scalable Quantum Consensus for Crash Failures.“. BS Chlebus, DR Kowalski, M Strojnowski. 2010. Springer DISC. 8 cites.
  112. A topological condition for solving fair exchange in byzantine environments“. B Garbinato, I Rickebusch. 2006. Springer International Conference on Information and …. 8 cites.
  113. Fast scalable deterministic consensus for crash failures“. BS Chlebus, DR Kowalski, M Strojnowski. 2009. dl.acm.org Proceedings of the 28th ACM …. 8 cites.
  114. Non-determinism in byzantine fault-tolerant replication“. C Cachin, S Schubert, M Vukolić. 2016. arxiv.org arXiv preprint arXiv:1603.07351. 8 cites.
  115. Early-deciding consensus is expensive“. D Dolev, C Lenzen. 2013. dl.acm.org Proceedings of the 2013 ACM symposium on …. 8 cites.
  116. Early-deciding consensus is expensive“. D Dolev, C Lenzen. 2013. dl.acm.org Proceedings of the 2013 ACM symposium on …. 8 cites.
  117. Achieving high efficient agreement with malicious faulty nodes on a cloud computing environment“. SC Wang, KQ Yan, SS Wang, CP Huang. 2009. dl.acm.org Proceedings of the 2nd …. 8 cites.
  118. Reaching strong consensus in the presence of mixed failure types“. HS Siu, YH Chin, WP Yang. 1998. Elsevier Information Sciences. 8 cites.
  119. Streets of consensus under unknown unreliable network“. SC Wang, ML Chiang, KQ Yan, KF Jea. 2005. dl.acm.org ACM SIGOPS Operating …. 8 cites.
  120. Reaching strong consensus in the presence of mixed failure types“. HS Siu, YH Chin, WP Yang. 1998. Elsevier Information Sciences. 8 cites.
  121. Streets of consensus under unknown unreliable network“. SC Wang, ML Chiang, KQ Yan, KF Jea. 2005. dl.acm.org ACM SIGOPS Operating …. 8 cites.
  122. Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience“. A Patra, A Choudhury, CP Rangan. 2010. Springer International Conference on …. 8 cites.
  123. Interaction patterns for byzantine fault tolerance computing“. H Chai, W Zhao. 2012. Springer Computer Applications for Web, Human Computer …. 8 cites.
  124. Classes of Byzantine Fault-Tolerant Algorithms for Dependable Distributed Systems.“. A Postma. 1998. doc.utwente.nl . 8 cites.
  125. Efficient construction of global time in socs despite arbitrary faults“. C Lenzen, M Függer, M Hofstätter, …. 2013. ieeexplore.ieee.org Digital System Design …. 8 cites.
  126. Efficient construction of global time in socs despite arbitrary faults“. C Lenzen, M Függer, M Hofstätter, …. 2013. ieeexplore.ieee.org Digital System Design …. 8 cites.
  127. The fail-heterogeneous architectural model“. M Serafini, N Suri. 2007. ieeexplore.ieee.org … Systems, 2007. SRDS 2007. 26th IEEE …. 8 cites.
  128. The fail-heterogeneous architectural model“. M Serafini, N Suri. 2007. ieeexplore.ieee.org … Systems, 2007. SRDS 2007. 26th IEEE …. 8 cites.
  129. Specialized n-modular redundant processors in large-scale distributed systems“. IL Yen. 1996. ieeexplore.ieee.org Reliable Distributed Systems, 1996. Proceedings., 15th …. 8 cites.
  130. Scheduling issues in survivability applications using hybrid fault models“. AW Krings, WS Harrison, A Azadmanesh, …. 2004. World Scientific Parallel Processing …. 8 cites.
  131. Application-aware byzantine fault tolerance“. W Zhao. 2014. ieeexplore.ieee.org … , Autonomic and Secure Computing (DASC), 2014 …. 8 cites.
  132. Using consensus for solving conflict situations in fault-tolerant distributed systems“. NT Nguyen. 2001. ieeexplore.ieee.org Cluster Computing and the Grid, 2001 …. 8 cites.
  133. Wait-free Byzantine consensus“. P Attie. 2002. Elsevier Information Processing Letters. 7 cites.
  134. Leaderless byzantine consensus“. L Lamport. 2010. Google Patents US Patent 7,797,457. 7 cites.
  135. Scalable and leaderless Byzantine consensus in cloud computing environments“. JB Lim, T Suh, JM Gil, H Yu. 2014. Springer Information Systems Frontiers. 7 cites.
  136. Approximate byzantine consensus in faulty asynchronous networks“. A Haseltalab, M Akar. 2015. ieeexplore.ieee.org American Control Conference (ACC) …. 7 cites.
  137. Multidimensional agreement in byzantine systems“. H Mendes, M Herlihy, N Vaidya, VK Garg. 2015. Springer Distributed Computing. 7 cites.
  138. Optimistic asynchronous Byzantine agreement“. K Kursawe. 2000. cse.ohio-state.edu . 7 cites.
  139. The Byzantine Agreement under mobile network“. SC Wang, KQ Yan, HC Hsieh. 2004. ieeexplore.ieee.org Networking, Sensing and …. 7 cites.
  140. A new solution for the Byzantine agreement problem“. HC Hsieh, ML Chiang. 2011. Elsevier Journal of Parallel and Distributed Computing. 7 cites.
  141. Consensus in the presence of mortal Byzantine faulty processes“. J Widder, M Biely, G Gridling, B Weiss, …. 2012. Springer Distributed …. 7 cites.
  142. The weighted byzantine agreement problem“. VK Garg, J Bridgman. 2011. ieeexplore.ieee.org Parallel & Distributed Processing …. 7 cites.
  143. Consensus when all processes may be Byzantine for some time“. M Biely, M Hutle. 2011. Elsevier Theoretical Computer Science. 7 cites.
  144. Is byzantine agreement useful in a distributed database?“. H Garcia-Molina, F Pittelli, S Davidson. 1984. dl.acm.org Proceedings of the 3rd ACM …. 7 cites.
  145. Byzantine Agreement under dual failure mobile network“. SC Wang, KQ Yan. 2006. Elsevier Computer Standards & Interfaces. 7 cites.
  146. Byzantine agreement with homonyms“. C Delporte-Gallet, H Fauconnier, R Guerraoui, …. 2013. Springer Distributed …. 7 cites.
  147. Degradable agreement in the presence of Byzantine faults“. NH Vaidya, DK Pradhan. 1993. ieeexplore.ieee.org Distributed Computing Systems …. 7 cites.
  148. Overcoming Byzantine failures using checkpointing“. A Agbaria, R Friedman. 2003. ideals.illinois.edu … Laboratory Report no. UILU-ENG-03 …. 7 cites.
  149. Coordinated traversal: Byzantine agreement in polynomial time“. O Waarts. 1988. M. Sc. thesis, Weizmann Institute of … . 7 cites.
  150. Conflict-free quorum-based bft protocols“. A Singh, P Maniatis, P Druschel, …. 2007. pdfs.semanticscholar.org Technical Report TR …. 7 cites.
  151. Byzantine agreement“. D Dolev, R Strong. 1982. IBM Research Report RJ3714 . 7 cites.
  152. Coordinated traversal: Byzantine agreement in polynomial time“. O Waarts. 1988. M. Sc. thesis, Weizmann Institute of … . 7 cites.
  153. Conflict-free quorum-based bft protocols“. A Singh, P Maniatis, P Druschel, …. 2007. pdfs.semanticscholar.org Technical Report TR …. 7 cites.
  154. Broadcast using certified propagation algorithm in presence of Byzantine faults“. L Tseng, N Vaidya, V Bhandari. 2015. Elsevier Information Processing Letters. 7 cites.
  155. The anatomy study of server-initial agreement for general hierarchy wired/wireless networks“. CF Cheng, SC Wang, T Liang. 2009. Elsevier Computer Standards & Interfaces. 7 cites.
  156. Capacity of cooperative fusion in the presence of Byzantine sensors“. O Kosut, L Tong. 2006. arxiv.org arXiv preprint cs/0607076. 7 cites.
  157. Capacity of cooperative fusion in the presence of Byzantine sensors“. O Kosut, L Tong. 2006. arxiv.org arXiv preprint cs/0607076. 7 cites.
  158. Distributed consensus in semi-synchronous systems“. P Berman, AA Bharali. 1992. ieeexplore.ieee.org Parallel Processing Symposium, 1992 …. 7 cites.
  159. A Simple Coding Theory-Based Characterization of Conditions for Solving Consensus“. R Friedman. 2002. csn.cs.technion.ac.il . 7 cites.
  160. Reaching fault diagnosis agreement on dual link failure mode“. SC Wang, KQ Yan. 2000. ieeexplore.ieee.org Parallel and Distributed Systems, 2000 …. 7 cites.
  161. Bounded cost algorithms for multivalued consensus using binary consensus instances“. J Zhang, W Chen. 2009. Elsevier Information Processing Letters. 7 cites.
  162. A faster Bitcoin network“. C Stathakopoulou, C Decker, …. 2015. pub.tik.ee.ethz.ch Tech. rep., ETH, Zurich …. 7 cites.
  163. A topological treatment of early-deciding set-agreement“. R Guerraoui, M Herlihy, B Pochon. 2009. Elsevier Theoretical Computer Science. 7 cites.
  164. Faster agreement via a spectral method for detecting malicious behavior“. V King, J Saia. 2014. dl.acm.org Proceedings of the twenty-fifth annual ACM-SIAM …. 7 cites.
  165. Verification of fault tolerant algorithms using PEP“. S Merkel. 1997. mediatum.ub.tum.de . 7 cites.
  166. Verification of fault tolerant algorithms using PEP“. S Merkel. 1997. mediatum.ub.tum.de . 7 cites.
  167. Consensus with oral/written messages: Link faults revisited“. U Schmid, B Weiss. 2001. auto.tuwien.ac.at Technical Report 183/1–110, Department of …. 7 cites.
  168. The Join algorithm: ordering messages in replicated systems“. L Mancini, G Pappalardo. 1988. Computing Laboratory, University of … . 7 cites.
  169. How the hidden hand shapes the market for software reliability“. K Birman, C Chandersekaran, D Dolev, …. 2006. cse.huji.ac.il … IEEE Workshop on …. 7 cites.
  170. How the hidden hand shapes the market for software reliability“. K Birman, C Chandersekaran, D Dolev, …. 2006. cse.huji.ac.il … IEEE Workshop on …. 7 cites.
  171. Tight bounds on early local decisions in uniform consensus“. P Dutta, R Guerraoui, B Pochon. 2003. Springer DISC. 7 cites.
  172. A flexible formal framework for masking/demasking faults“. B Ayeb, A Farhat. 2004. Elsevier Information Sciences. 7 cites.
  173. Multi-sided shared coins and randomized set-agreement“. K Censor Hillel. 2010. dl.acm.org Proceedings of the twenty-second annual ACM …. 7 cites.
  174. Byzantine fault-tolerance and beyond“. JPE Martin. 2006. repositories.lib.utexas.edu . 7 cites.
  175. The ‘Majority Text’and Byzantine Origins“. TR Ralston. 1992. cambridge.org New Testament Studies. 7 cites.
  176. Asynchronous byzantine consensus: Complexity, re and authentication“. P Dutta, R Guerraoui, M Vukolić. 2004. Citeseer Personal Communication. 6 cites.
  177. Optimal Time–Space Tradeoff for Shared Memory Leader Election“. Y Afek, G Stupp. 1997. Elsevier Journal of Algorithms. 6 cites.
  178. Leaderless byzantine paxos“. L Lamport. 2011. Distributed Computing: 25th International Symposium …. 6 cites.
  179. Byzantine convex consensus: An optimal algorithm“. L Tseng, N Vaidya. 2013. arxiv.org arXiv preprint arXiv:1307.1332. 6 cites.
  180. Performance study of Byzantine Agreement Protocol with artificial neural network“. KW Lee, HT Ewe. 2007. Elsevier Information Sciences. 6 cites.
  181. From Byzantine agreement to practical survivability: a position paper“. D Malkhi. 2002. ieeexplore.ieee.org … Distributed Systems, 2002. Proceedings. 21st IEEE …. 6 cites.
  182. From Byzantine agreement to practical survivability: a position paper“. D Malkhi. 2002. ieeexplore.ieee.org … Distributed Systems, 2002. Proceedings. 21st IEEE …. 6 cites.
  183. Byzantine agreement with homonyms in synchronous systems“. C Delporte-Gallet, H Fauconnier. 2012. Springer International Conference on …. 6 cites.
  184. Byzantine-resistant consensus based on a novel approach to intrusion tolerance“. M Correia, NF Neves, LC Lung, …. 2004. researchgate.net Proceedings of the 10th …. 6 cites.
  185. A Gracefully Degradable Algorithm for Byzantine Agreement.“. F Di Giandomenico, ML Guidotti, F Grandoni, …. 1987. SRDS. 6 cites.
  186. Artificial neural network based Byzantine agreement protocol“. KW Lee, HT Ewe. 2002. academia.edu Proceedings of the Sixth IASTED International …. 6 cites.
  187. Finite-time average consensus in a Byzantine environment using set-valued observers“. D Silvestre, P Rosa, JP Hespanha, …. 2014. ieeexplore.ieee.org American Control …. 6 cites.
  188. Objects shared by Byzantine processes“. D Malkhi, M Merritt, M Reiter, G Taubenfeld. 2000. Springer Distributed Computing. 6 cites.
  189. A quick distributed consensus protocol“. F Guerra, S Arévalo, A Alvarez, J Miranda. 1993. Elsevier Microprocessing and …. 6 cites.
  190. Necessary and sufficient conditions for broadcast consensus protocols“. LE Moser, PM Melliar-Smith, V Agrawala. 1993. Springer Distributed computing. 6 cites.
  191. Multi-valued byzantine broadcast: The t< n case“. M Hirt, P Raykov. 2014. Springer International Conference on the Theory and …. 6 cites.
  192. Probabilistic byzantine tolerance for cloud computing“. L Arantes, R Friedman, O Marin, …. 2015. ieeexplore.ieee.org … Systems (SRDS), 2015 …. 6 cites.
  193. Stopping times of distributed consensus protocols: A probabilistic analysis“. Ö Babaog̃lu. 1987. Elsevier Information processing letters. 6 cites.
  194. A simple proof of a simple consensus algorithm“. J Misra. 1990. books.google.com Beauty is our business. 6 cites.
  195. Fast byzantine leader election in dynamic networks“. J Augustine, G Pandurangan, P Robinson. 2015. Springer International Symposium on …. 6 cites.
  196. A distributed robust convergence algorithm for multi-robot systems in the presence of faulty robots“. H Park, S Hutchinson. 2015. ieeexplore.ieee.org … Robots and Systems (IROS), 2015 IEEE …. 6 cites.
  197. Reaching Consensus in a Dual Fallible Scale Free Network“. SC Wang, SC Yang, KQ Yan. 2007. ieeexplore.ieee.org Wireless Communications and …. 6 cites.
  198. Adaptive request batching for byzantine replication“. AS de Sá, AE Silva Freitas, …. 2013. dl.acm.org ACM SIGOPS Operating …. 6 cites.
  199. Optimistic byzantine fault tolerance“. W Zhao. 2016. Taylor & Francis International Journal of Parallel, Emergent and …. 6 cites.
  200. Resilient consensus protocol in the presence of trusted nodes“. W Abbas, Y Vorobeychik, …. 2014. ieeexplore.ieee.org Resilient Control Systems …. 6 cites.
  201. The consensus problem with dual failure nodes in a cloud computing environment“. SS Wang, SC Wang. 2014. Elsevier Information Sciences. 6 cites.
  202. An analysis of the cryptocurrency industry“. R Farell. 2015. repository.upenn.edu . 6 cites.
  203. Unbeatable consensus“. A Castaneda, YA Gonczarowski, Y Moses. 2014. Springer International Symposium on …. 6 cites.
  204. Edge fault tolerance on sparse networks“. N Chandran, J Garay, R Ostrovsky. 2012. Springer International Colloquium on Automata …. 6 cites.
  205. Virtual trees for the byzantine generals algorithm“. A Tikvati, M Ben-Ari, YBD Kolikant. 2004. dl.acm.org ACM SIGCSE Bulletin. 6 cites.
  206. Virtual trees for the byzantine generals algorithm“. A Tikvati, M Ben-Ari, YBD Kolikant. 2004. dl.acm.org ACM SIGCSE Bulletin. 6 cites.
  207. Attribute agreement“. YC Tay. 1989. dl.acm.org Proceedings of the eighth ACM SIGACT-SIGMOD …. 6 cites.
  208. Constant-Space Localized Byzantine Consensus.“. D Dolev, EN Hoch. 2008. Springer DISC. 5 cites.
  209. Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O (n^ 2) messages, and constant time“. A Mostéfaoui, M Raynal. 2017. Springer Acta Informatica. 5 cites.
  210. Timing analysis of leader-based and decentralized Byzantine consensus algorithms“. F Borran, M Hutle, A Schiper. 2012. Springer Journal of the Brazilian Computer Society. 5 cites.
  211. Semi-passive replication in the presence of byzantine faults“. HGV Ramasamy, A Agbaria, WH Sanders. 2004. Citeseer . 5 cites.
  212. A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks“. O Baldellon, A Mostéfaoui, M Raynal. 2011. Springer International Conference on …. 5 cites.
  213. Brief announcement: a leader-free byzantine consensus algorithm“. F Borran, A Schiper. 2009. Springer International Symposium on Distributed Computing. 5 cites.
  214. Brief announcement: Byzantine agreement with homonyms“. C Delporte-Gallet, H Fauconnier, R Guerraoui, …. 2010. dl.acm.org Proceedings of the …. 5 cites.
  215. Consensus When All Processes May Be Byzantine for Some Time.“. M Biely, M Hutle. 2009. Springer SSS. 5 cites.
  216. An optimal solution of byzantine agreement in a scale free network“. KQ Yan, SS Wang, SC Wang. 2008. ieeexplore.ieee.org … Information Networking and …. 5 cites.
  217. Formal verification of hybrid Byzantine agreement under link faults“. J Rushby. 2001. pdfs.semanticscholar.org … re-port, Computer Science Laboratory, SRI …. 5 cites.
  218. Capacity of Byzantine Agreement (Preliminary Draft–Work in Progress)“. N Vaidya, G Liang. 2010. Citeseer . 5 cites.
  219. When you don’t trust clients: Byzantine proposer fast paxos“. H Meling, K Marzullo, A Mei. 2012. ieeexplore.ieee.org Distributed Computing Systems …. 5 cites.
  220. The topology of asynchronous byzantine colorless tasks“. H Mendes, C Tasson, M Herlihy. 2013. irif.fr CoRR, abs/1302.6224. 5 cites.
  221. Byzantine agreement protocol & fault diagnosis agreement for mobile Ad-Hoc network“. CF Cheng, SC Wang, T Liang. 2008. Fundamenta Informaticae. 5 cites.
  222. How to implement Bracha’s O (log n) Byzantine agreement algorithm, 1985“. B Averbuch, M Blum, B Chor, S Goldwasser, S Micali. 1985. Unpublished manuscript. 5 cites.
  223. Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid Faults“. L Gong, P Lincoln, J Rushby. 0. Proceedings of the 5th IFIP Working Conference on …. 5 cites.
  224. Tight bounds for shared memory systems accessed by Byzantine processes“. N Alon, M Merritt, O Reingold, G Taubenfeld, …. 2005. Springer Distributed …. 5 cites.
  225. Byzantine fault tolerance as a service“. H Chai, W Zhao. 2012. Springer Computer Applications for Web, Human Computer …. 5 cites.
  226. Agreement and coalition formation in multiagent-based virtual marketplaces“. L Brito, J Neves. 2000. Springer Intelligent Problem Solving. Methodologies and …. 5 cites.
  227. Byzantine fault tolerance on general hybrid adversary structures“. K Kursawe, FC Freiling. 2005. 137.226.34.227 . 5 cites.
  228. hBFT: speculative Byzantine fault tolerance with minimum cost“. S Duan, S Peisert, K Levitt. 2014. escholarship.org IEEE Transactions on Dependable …. 5 cites.
  229. Byzantine fault tolerance on general hybrid adversary structures“. K Kursawe, FC Freiling. 2005. 137.226.34.227 . 5 cites.
  230. hBFT: speculative Byzantine fault tolerance with minimum cost“. S Duan, S Peisert, K Levitt. 2014. escholarship.org IEEE Transactions on Dependable …. 5 cites.
  231. A perception-based fault model for single-round agreement algorithms“. U Schmid. 2000. pdfs.semanticscholar.org . 5 cites.
  232. Approximate Byzantine consensus in sparse, mobile ad-hoc networks“. C Li, M Hurfin, Y Wang. 2014. Elsevier Journal of Parallel and Distributed Computing. 4 cites.
  233. Exact Byzantine consensus in directed graphs“. L Tseng, N Vaidya. 2012. arxiv.org arXiv preprint arXiv:1208.5075. 4 cites.
  234. Optimizing Byzantine Consensus for Fault-Tolerant Embedded Systems with Ad-Hoc and Infrastructure Networks“. HP Reiser, A Casimiro. 2007. pdfs.semanticscholar.org Proc. of the 4th Int. Workshop on …. 4 cites.
  235. Brief Announcement: Leaderless Byzantine Paxos.“. L Lamport. 2011. Springer DISC. 4 cites.
  236. Brief announcement: linear time byzantine self-stabilizing clock synchronization“. A Daliot, D Dolev, H Parnas. 2004. dl.acm.org Proceedings of the twenty-third annual …. 4 cites.
  237. Robust and speculative Byzantine randomized consensus with constant time complexity in normal conditions“. B Vavala, N Neves. 2012. ieeexplore.ieee.org … (SRDS), 2012 IEEE 31st Symposium on. 4 cites.
  238. Byzantine agreement with bounded broadcast“. J Considine, LA Levin, …. 2000. pdfs.semanticscholar.org Preprint at http://arXiv …. 4 cites.
  239. Byzantine agreement with faulty majority using bounded broadcast“. J Considine, LA Levin, D Metcalf. 2000. arxiv.org arXiv preprint cs/0012024. 4 cites.
  240. Player-centric byzantine agreement“. M Hirt, V Zikas. 2011. Springer Automata, Languages and Programming. 4 cites.
  241. Player-centric byzantine agreement“. M Hirt, V Zikas. 2011. Springer Automata, Languages and Programming. 4 cites.
  242. Hierarchical Protocol for Byzantine Agreement in a Peer-to-Peer Overlay Network“. H Yoshino, N Hayashibara, T Enokido, …. 2005. ieeexplore.ieee.org Database and Expert …. 4 cites.
  243. Capacity of byzantine agreement: Tight bound for the four node network“. G Liang, N Vaidya. 2010. dtic.mil . 4 cites.
  244. An empirical study of a scalable byzantine agreement algorithm“. O Oluwasanmi, J Saia, V King. 2010. ieeexplore.ieee.org Parallel & Distributed …. 4 cites.
  245. Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment“. CF Cheng, SC Wang, T Liang. 2008. content.iospress.com Fundamenta Informaticae. 4 cites.
  246. Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment“. CF Cheng, SC Wang, T Liang. 2008. content.iospress.com Fundamenta Informaticae. 4 cites.
  247. The Byzantine Agreement Protocol Applied to Security“. D Toth. 2005. researchgate.net . 4 cites.
  248. Artificial neural networks based algorithm for Byzantine Generals Problem“. KW Lee, HT Ewe. 2001. academia.edu … of the MMU International Symposium on …. 4 cites.
  249. Atomic broadcast: From simple diffusion to byzantine agreement“. F Cristain, H Aghilim, R Strong, D Dolev. 1984. … on Fault-tolerant Computimng (Ann Arbor …. 4 cites.
  250. Bounds on the message complexity of byzantine agreement“. SM Weber. 1990. . 4 cites.
  251. Atomic Broadcast: From Simple Diffusion to Byzantine Agreement, 15th Int. Conf. on Fault-tolerant Computing“. F Cristian, H Aghili, R Strong, D Dolev. 1985. Ann Arbor, Mi. 4 cites.
  252. Compositional design of multitolerant repetitive Byzantine agreement (preliminary version)“. SS Kulkarni, A Arora. 1997. Third Workshop on Self-Stabilizing Systems (WSS 97) …. 4 cites.
  253. Byzantine agreement under restricted types of failures (not telling the truth is different from telling of lies). Tech. ARep“. V Hadzilacos. 0. TR-19-83, Aiken Comp. Lab …. 4 cites.
  254. Randomized byzantine agreement“. MO Rabin. 1983. 24th FOCS. 4 cites.
  255. Byzantine agreement. Intellectual Leverage for the Information Society“. HR Strong, D Dolev. 1983. Digest of Papers.(Compcon 83, IEEE Computer Society …. 4 cites.
  256. Algorand: Scaling byzantine agreements for cryptocurrencies“. Y Gilad, R Hemo, S Micali, G Vlachos, N Zeldovich. 2017. people.csail.mit.edu . 4 cites.
  257. Algorand: Scaling byzantine agreements for cryptocurrencies“. Y Gilad, R Hemo, S Micali, G Vlachos, N Zeldovich. 2017. people.csail.mit.edu . 4 cites.
  258. Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation“. A Patra. 2010. users-cs.au.dk . 4 cites.
  259. Overlay network topology reconfiguration in byzantine settings“. RR Obelheiro, J da Silva Fraga. 2007. ieeexplore.ieee.org Dependable Computing, 2007 …. 4 cites.
  260. Eventually dual failure agreement“. SC Wang, CF Cheng. 2003. content.iospress.com Fundamenta Informaticae. 4 cites.
  261. Asynchronous Byzantine Agreement“. C Attiya, D Dolev, J Gill. 1984. Proc. 3rd. Annual ACM Symposium on Principles of …. 4 cites.
  262. System architecture for byzantine resilient computation in launch vehicle applications“. MJ Iacoponi, R Grisell. 1990. ieeexplore.ieee.org Digital Avionics Systems Conference …. 4 cites.
  263. Adaptive Containment of Time-Bounded Byzantine Faults.“. Y Yamauchi, T Masuzawa, D Bein. 2010. Springer SSS. 4 cites.
  264. Capacity of Byzantine Consensus with Capacity-Limited Point-to-Point Links“. G Liang, N Vaidya. 2011. arxiv.org arXiv preprint arXiv:1104.0043. 3 cites.
  265. Minimal synchrony for Byzantine consensus“. Z Bouzid, A Mostfaoui, M Raynal. 2015. dl.acm.org … of the 2015 ACM Symposium on …. 3 cites.
  266. Jr., LJJ Anonymous Byzantine consensus from moderately-hard puzzles: A model for Bitcoin“. A Miller. 2009. . 3 cites.
  267. Scalable Byzantine Consensus via Hardware-assisted Secret Sharing“. J Liu, W Li, GO Karame, N Asokan. 2016. arxiv.org arXiv preprint arXiv:1612.04997. 3 cites.
  268. Intrusion-tolerant broadcast and agreement abstractions in the presence of Byzantine processes“. A Mostéfaoui, M Raynal. 2016. ieeexplore.ieee.org IEEE Transactions on Parallel and …. 3 cites.
  269. Byzantine Agreement“. M Okun. 2008. Springer Encyclopedia of Algorithms. 3 cites.
  270. Efficient Asynchronous Verifiable Secret Sharing and Byzantine Agreement with Optimal Resilience“. A Patra, A Choudhary, CP Rangan. 2008. Cryptology ePrint. 3 cites.
  271. Optimized authenticated self-synchronizing Byzantine agreement protocols“. A Postma, T Krol, E Molenkamp. 1997. ieeexplore.ieee.org Fault-Tolerant Systems, 1997 …. 3 cites.
  272. Eventually Byzantine Agreement on CDS-based mobile ad hoc network“. ML Chiang. 2012. Elsevier Ad Hoc Networks. 3 cites.
  273. Asynchronous Consensus and Byzantine Protocols in Faulty Environments“. G Bracha, S Toueg. 1983. ecommons.cornell.edu . 3 cites.
  274. The contest between simplicity and efficiency in asynchronous byzantine agreement“. A Lewko. 2011. Springer International Symposium on Distributed Computing. 3 cites.
  275. Deductive verification of a byzantine agreement protocol“. R Krenick, M Ulbrich. 2010. lfm.iti.kit.edu . 3 cites.
  276. On the round complexity of Byzantine agreement without initial set-up“. M Okun. 2009. Elsevier Information and Computation. 3 cites.
  277. On the round complexity of Byzantine agreement without initial set-up“. M Okun. 2009. Elsevier Information and Computation. 3 cites.
  278. Towards byzantine fault tolerant publish/subscribe: A state machine approach“. L Jehl, H Meling. 2013. dl.acm.org Proceedings of the 9th Workshop on Hot Topics in …. 3 cites.
  279. Self-stabilizing byzantine pulse and clock synchronization“. EN Hoch, עזרא הוך. 0. pdfs.semanticscholar.org 2007‎. 3 cites.
  280. Adaptive Byzantine Agreement in O (t) Phases“. B Baum-Waidner. 1991. books.google.com 5 International GI/ITG/GMA Conference …. 3 cites.
  281. A Consistency Condition Supporting Design and Verification of Byzantine Adaptive Agreement Protocols“. B Baum-Waidner. 1991. Springer Kommunikation in verteilten Systemen. 3 cites.
  282. March 1986. Applications of Byzantine agreement in database systems“. H Garcia-Molina, F Pitelli, SB Davidson. 0. ACM Transactions on Database Systems. 3 cites.
  283. Byzantine agreement under network failures“. Simon Fraser University. Laboratory for Computer and , …. 1987. . 3 cites.
  284. Atomic multicast: From simple diffusion to Byzantine agreement“. F Cristian. 1984. IBM Technical Report RJ 4540 … . 3 cites.
  285. Fault-Tolerant Atomic Broadcasts: from Simple Message Difiusion to Byzantine Agreement“. F Cristian, H Aghili, R Strong, D Dolev. 1984. Tech. Report, IBM Research San … . 3 cites.
  286. Unconditional Byzantine Agreement with Good Majority; Symp. on Theoretical Aspects of Computer Science (STACS), Hamburg 1991; LNCS“. BPWB Baum-Waidner, B Pfitzmann, M Waidner. 1991. Springer-Verlag, Berlin . 3 cites.
  287. Byzantine agreement under the perception-based fault model“. M Biely. 2002. na . 3 cites.
  288. Aspect oriented decision making model for byzantine agreement“. S Murugan, V Ramachandran. 2012. Journal of Computer Science. 3 cites.
  289. On anonymous Byzantine agreement“. M Okun, A Barak. 2004. Leibniz Center TR. 3 cites.
  290. Strong, and D. Dolev. Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement. InDigest of Papers“. F Cristian. 0. The 15th International Symposium on Fault-Tolerant …. 3 cites.
  291. Byzantine agreement under unreliable multicasting network“. SC Wang, KQ Yan, CF Cheng. 2003. Pakistan Journal of Information and Technology. 3 cites.
  292. Message and bit-optimal protocol for byzantine agreement. 1990“. V Hadzilacos, JY Halpern. 0. To appear. 3 cites.
  293. Maurer, and O. von Rotz.¤ nconditional Byzantine agreement and multi-party computation secure against dishonest minorities from scratch“. M Fitzi, N Gisin. 2002. A dvances in¦ w ryptology·¶» ² (¼ te wjtq § Pe’2&¹0¹ 2 …. 3 cites.
  294. Towards reducing the communication overhead in Byzantine agreement“. F Cazacu. 2004. University of New Mexico . 3 cites.
  295. Byzantine agreement with faulty majority using bounded broadcast. CoRR“. J Considine, LA Levin, D Metcalf. 2000. arXiv preprint cs.DC/0012024. 3 cites.
  296. Byzantine agreements in secure communication“. L Wagner. 2003. Citeseer . 3 cites.
  297. Asynchronous byzantine request-set agreement algorithm for replication“. J Nakamura, T Araragi, S Masuyama. 2008. Proc. 1st AAAC Annual Meeting. 3 cites.
  298. ” Separating agreement from execution for Byzantine fault-tolerant services&quot“. J Yin, J Martin, A Venkataramani, L Alvisi, M Dahlin. 2003. … . of the 19th ACM Symposium on …. 3 cites.
  299. Consensus facit nuptias-Et non: Pope Nicholas I’s ‘Responsa’to the Bulgarians as a Source for Byzantine Marriage Customs“. A Laiou. 1985. Rechtshistorisches Journal. 3 cites.
  300. Towards an optimal algorithm for hybrid Byzantine agreement.“. M Biely. 0. publik.tuwien.ac.at 182. 3 cites.
  301. Brief announcement: Reaching approximate byzantine consensus in partially-connected mobile networks“. C Li, M Hurfin, Y Wang. 2012. Springer Distributed Computing. 2 cites.
  302. Towards the minimal synchrony for byzantine consensus“. A Mostefaoui, G Trédan. 2007. dl.acm.org Proceedings of the twenty-sixth annual ACM …. 2 cites.
  303. Adaptive and doubly-expedited one-step consensus in Byzantine asynchronous systems“. N Banu, T Izumi, K Wada. 2011. World Scientific Parallel Processing Letters. 2 cites.
  304. Parameter-independent iterative approximate byzantine consensus“. L Tseng, NH Vaidya. 2012. arxiv.org arXiv preprint arXiv:1208.4867. 2 cites.
  305. Anonymous byzantine consensus from moderately-hard puzzles: A model for bitcoin. University of Central Florida“. A Miller, JJ LaViola. 2014. Tech Report, CS-TR-14-01 . 2 cites.
  306. Byzantine Consensus in Signature-free Systems“. M Hamouna, A Mostéfaoui, G Trédan. 0. Submitted to publication. 2 cites.
  307. Self-stabilizing byzantine token circulation“. A Daliot, D Dolev. 2005. leibniz.cs.huji.ac.il . 2 cites.
  308. Clock synchronization in mobile Ad Hoc networks based on an iterative approximate byzantine consensus protocol“. C Li, Y Wang, M Hurfin. 2014. ieeexplore.ieee.org Advanced Information Networking and …. 2 cites.
  309. Technical Report NU-CCS-00-02“. PCAWB Agreement. 2000. College of Computer Science, Northeastern University. 2 cites.
  310. New efficient error-free multi-valued consensus with byzantine failures“. G Liang, N Vaidya. 2011. arxiv.org arXiv preprint arXiv:1106.1846. 2 cites.
  311. Monitoring local progress with watchdog timers deduced from global properties“. R Barbosa. 2010. ieeexplore.ieee.org Reliable Distributed Systems, 2010 29th IEEE …. 2 cites.
  312. Fast, scalable byzantine agreement in the full information model with a nonadaptive adversary“. V King, J Saia. 2009. Proceedings of the 23rd International Symposium on …. 2 cites.
  313. Accurate byzantine agreement with feedback“. VK Garg, J Bridgman, B Balasubramanian. 2011. dl.acm.org Proceedings of the 30th …. 2 cites.
  314. Consensus in byzantine asynchronous systems“. R Baldoni, JM Hélary, M Raynal, L Tanguy. 1999. hal.archives-ouvertes.fr . 2 cites.
  315. Modular randomized Byzantine k-set agreement in asynchronous message-passing systems“. A Mostéfaoui, H Moumen, M Raynal. 2016. dl.acm.org Proceedings of the 17th …. 2 cites.
  316. Almost-safe Byzantine agreement in sparse networks with random faults“. A Pelc. 1995. World Scientific Parallel processing letters. 2 cites.
  317. Towards Recoverable Hybrid Byzantine Consensus“. HP Reiser, R Kapitza. 2009. net.t-labs.tu-berlin.de . 1 cites.
  318. Time-Free Authenticated Byzantine Consensus“. H Moumen, A Mostefaoui. 2010. ieeexplore.ieee.org Network Computing and …. 1 cites.
  319. Byzantine consensus for unknown dynamic networks“. E Taheri, M Izadi. 2015. Springer The Journal of Supercomputing. 1 cites.
  320. Asynchronous Byzantine Consensus with 2f+ 1 Processes (extended version)“. M Correia, GS Veronese, LC Lung. 2009. repositorio.ul.pt . 1 cites.
  321. Capacity of Byzantine consensus in capacity limited point-to-point networks“. G Liang, N Vaidya. 2012. ieeexplore.ieee.org Communication Systems and Networks …. 1 cites.
  322. Minimal synchrony for asynchronous Byzantine consensus“. Z Bouzid, A Mostefaoui, M Raynal. 2015. hal.inria.fr . 1 cites.
  323. Reaching approximate byzantine consensus in partially-connected mobile networks“. C Li, M Hurfin, Y Wang. 2012. arxiv.org arXiv preprint arXiv:1206.0089. 1 cites.
  324. D. polev, and J. Gil, Asynchronous Byzantine Consensus“. H Attiya. 0. Proc. 3rd ACM Symp. 1 cites.
  325. The complexity of asynchronous Byzantine consensus“. P Dutta, R Guerraoui, M Vukolic. 2004. infoscience.epfl.ch . 1 cites.
  326. Information Theoretically Secure Byzantine Paxos“. AS Aiyer, L Alvisi, A Clement, HC Li. 2007. cs.utexas.edu . 1 cites.
  327. Unstructured membership management for byzantine fault tolerance in clouds“. JB Lim, D Jung, T Suh, H Yu. 2014. ieeexplore.ieee.org Architecture of Computing …. 1 cites.

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.