Filters








143 Hits in 4.9 sec

Time-Free and Timer-Based Assumptions Can Be Combined to Solve Authenticated Byzantine Consensus [article]

Hamouma Moumen
2015 arXiv   pre-print
This paper shows that both types of assumptions are not antagonist and can be combined to solve authenticated Byzantine consensus.  ...  addition of synchrony, called Timer-Based, but the second is based on the pattern of the messages that are exchanged, called Time-Free.  ...  To our knowledge, this is the first protocol that combines between Timer-Based and Time-Free Assumptions to solve authenticated Byzantine consensus.  ... 
arXiv:1502.00050v1 fatcat:czd23j3vubgavnvp3t5iq3h42y

Minimal Synchrony for Byzantine Consensus

Zohir Bouzid, Achour Mostfaoui, Michel Raynal
2015 Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15  
possibly different timing properties), this paper investigates the synchrony assumption required to solve consensus, and presents a signature-free consensus algorithm whose synchrony requirement is the  ...  , which is the weakest synchrony assumption that allows Byzantine consensus to be solved in a message-passing system?"  ...  DISCMAT devoted to connections between mathematics and distributed computing.  ... 
doi:10.1145/2767386.2767418 dblp:conf/podc/BouzidMR15 fatcat:c4mmtnwowfaabm6necrfuu64ui

FireLedger: A High Throughput Blockchain Consensus Protocol [article]

Yehonatan Buchnik, Roy Friedman
2019 arXiv   pre-print
., they may be rescinded in case one of the last f + 1 blocks proposers was Byzantine.  ...  Blockchains are distributed secure ledgers to which transactions are issued continuously and each block of transactions is tightly coupled to its predecessors.  ...  HBB circumvents FLP by randomization and is based on a probabilistic binary Byzantine consensus [61] .  ... 
arXiv:1901.03279v6 fatcat:xckbfntrdjcd5cgzsabcvu4nei

Asynchronous Byzantine consensus

Chagit Attiya, Danny Dolev, Joseph Gil
1984 Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84  
We present a trivial protocol to reach a nontrivial consensus in bounded time.  ...  The deterministic protocol presented in this paper reaches a Strong Byzantine Agrcement in a system of asynchronous processors; and therefore can sustain arbitrary faults.  ...  We conjecture that the choice coordination problem cannot be solved in bounded time, in the presence of Byzantine Failure (the problem itself should also be redefined appropriately).  ... 
doi:10.1145/800222.806740 dblp:conf/podc/AttiyaDG84 fatcat:bpjyskviuzegvlnegln6borfd4

Failure Detection with Booting in Partially Synchronous Systems [chapter]

Josef Widder, Gérard Le Lann, Ulrich Schmid
2005 Lecture Notes in Computer Science  
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failures.  ...  of messages that are simultaneously in transit must be known a priori (while the actual delays need not be known and not even be bounded).  ...  Moreover, the overhead can be reduced further by introducing local pauses between rounds (which does not even need timers as it can be done by counting suitable local events), see [2] for details.  ... 
doi:10.1007/11408901_3 fatcat:ln5w6eafpjgt7i26b2wxmxfy4q

BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration [chapter]

Sisi Duan, Hein Meling, Sean Peisert, Haibin Zhang
2014 Lecture Notes in Computer Science  
In this paper, we describe the design and implementation of BChain, a Byzantine fault-tolerant state machine replication protocol, which performs comparably to other modern protocols in fault-free cases  ...  At the core of BChain is an efficient Byzantine failure detection mechanism called re-chaining, where faulty replicas are placed out of harm's way at the end of the chain, until they can be replaced.  ...  Moreover, we can combine all-MAC-based and signature-based BChain approaches such that the failure-free case uses MACs only and re-chaining uses signatures.  ... 
doi:10.1007/978-3-319-14472-6_7 fatcat:cdzjbluverhszbjuw3xz5vk3ku

Consensus in Byzantine asynchronous systems

Roberto Baldoni, Jean-Michel Hélary, Michel Raynal, Lenaik Tangui
2003 Journal of Discrete Algorithms  
Finally, the modular approach followed in this paper can be used to solve other problems in asynchronous systems experiencing Byzantine failures.  ...  This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules.  ...  The Vector Consensus protocol Each of the previously proposed protocols solving consensus in Byzantine systems is based on a skeleton protocol solving consensus in a process crash model.  ... 
doi:10.1016/s1570-8667(03)00025-x fatcat:to6na3hrnrfp7gu5aggqp3gbyi

Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR [article]

Oded Naor, Idit Keidar
2020 arXiv   pre-print
Existing protocols can use our round synchronization algorithm to solve Byzantine SMR with the same asymptotic performance.  ...  Recently suggested Byzantine SMR solutions such as HotStuff, Tendermint, and LibraBFT achieve progress with a linear message complexity and a constant time complexity once such round synchronization occurs  ...  Randomization is often used to solve consensus in asynchronous networks to circumvent the seminal FLP result [22] .  ... 
arXiv:2002.07539v3 fatcat:rwc3rei2yfhpppwbhbdksirmi4

Proactive Byzantine Quorum Systems [chapter]

Eduardo A. P. Alchieri, Alysson Neves Bessani, Fernando Carlos Pereira, Joni da Silva Fraga
2009 Lecture Notes in Computer Science  
All solutions proposed in this paper can be used on asynchronous systems, which requires no time assumptions.  ...  Byzantine Quorum Systems is a replication technique used to ensure availability and consistency of replicates data even in presence of arbitrary faults.  ...  Alchieri, Pereira and Fraga are supported by CNPq (Brazilian National Research Council). This work was partially supported by the FCT through the Multiannual and the CMU-Portugal Programmes.  ... 
doi:10.1007/978-3-642-05148-7_50 fatcat:zauhtwfm3zc2ld4og6ti2l2r4i

Synchronization issues in real-time systems

N. Suri, M.M. Hugue, C.J. Walter
1994 Proceedings of the IEEE  
of a common system-wide time base.  ...  This paper provides a tutorial on the terminology, issues, and techniques essential to synchronization in real-time systems.  ...  The time base can be absolute, corresponding to a physical clock, or relative, based on speci c events.  ... 
doi:10.1109/5.259425 fatcat:7mo3jwihsjhohjm3ovyjntyyj4

Implementing Trustworthy Services Using Replicated State Machines

F.B. Schneider, Lidong Zhou
2005 IEEE Security and Privacy  
The Byzantine fault model asserts that a faulty component can exhibit arbitrarily malicious (so-called "Byzantine") behavior; a system that tolerates Byzantine faults should then be able to handle anything  ...  Moreover, because any component can be viewed abstractly in terms of its state and a set of possible next-state transitions-in short, a state machine-fault-tolerant services can be built by assembling  ...  This is problematic because denial-of-service (DoS) attacks can invalidate such timing assumptions.  ... 
doi:10.1109/msp.2005.125 fatcat:e3mnqp4aqrbrxloyxfhi4nz4ci

Implementing Trustworthy Services Using Replicated State Machines [chapter]

Fred B. Schneider, Lidong Zhou
2005 Lecture Notes in Computer Science  
The Byzantine fault model asserts that a faulty component can exhibit arbitrarily malicious (so-called "Byzantine") behavior; a system that tolerates Byzantine faults should then be able to handle anything  ...  Moreover, because any component can be viewed abstractly in terms of its state and a set of possible next-state transitions-in short, a state machine-fault-tolerant services can be built by assembling  ...  This is problematic because denial-of-service (DoS) attacks can invalidate such timing assumptions.  ... 
doi:10.1007/978-3-642-11294-2_8 fatcat:pjsapx7n4fgv5ms7v2fhvg4yjq

A Research Survey on Applications of Consensus Protocols in Blockchain

Sivleen Kaur, Sheetal Chaturvedi, Aabha Sharma, Jayaprakash Kar, Debiao He
2021 Security and Communication Networks  
The consensus protocols covered in this paper include PoW (Proof of Work), PoS (Proof of Stake), DPoS (Delegated Proof of Stake), PoET (Proof of Elapsed Time), PBFT (Practical Byzantine Fault Tolerance  ...  For each consensus, we have reviewed the properties, applications, and performance in the blockchain.  ...  So, by using it in combination with another consensus mechanism, it can be optimized.  ... 
doi:10.1155/2021/6693731 fatcat:dack5qxm3ndsriypwqzn2smwve

Challenges of PBFT-Inspired Consensus for Blockchain and Enhancements over Neo dBFT

Igor M. Coelho, Vitor N. Coelho, Rodolfo P. Araujo, Wang Y. Qiang, Brett D. Rhodes
2020 Future Internet  
Blockchain technology has seen the introduction of different sorts of consensus mechanism, ranging from tasks of heavy computation to the subtle mathematical proofs of Byzantine agreements.  ...  Consensus mechanisms are a core feature for handling negotiation and agreements.  ...  This can be repeated f times (by changing f views), and sporking f + 1 replicas.  ... 
doi:10.3390/fi12080129 fatcat:hk63eean5ndc7jricbzvtdgs5y

Generalized Consensus for Practical Fault Tolerance

Mohit Garg, Sebastiano Peluso, Balaji Arun, Binoy Ravindran
2019 Proceedings of the 20th International Middleware Conference on - Middleware '19  
Experimental evaluation confirms the effectiveness of this approach: Elpis achieves up to 2x speedup over XPaxos and up to 3.5x speedup over state-of-the-art Byzantine Fault-Tolerant Consensus Protocols  ...  Past efforts such as the Cross Fault Tolerance (XFT) model address this problem by making a weaker assumption that a majority of replicates are correct and communicate synchronously.  ...  It remains to be seen how the systems can be parameterized to make the XFT assumptions tenable in different environments.  ... 
doi:10.1145/3361525.3361536 dblp:conf/middleware/GargPAR19 fatcat:mx3mliy7gfa4hiudqit7wwdtz4
« Previous Showing results 1 — 15 out of 143 results