Filters








3,065 Hits in 4.6 sec

On the number of authenticated rounds in Byzantine Agreement [chapter]

Malte Borcherding
1995 Lecture Notes in Computer Science  
doi:10.1007/bfb0022150 fatcat:ymsajkcuhbcorjpt2pd6hvuy44

The consensus problem in unreliable distributed systems (a brief survey) [chapter]

Michael J. Fischer
1983 Lecture Notes in Computer Science  
We survey the considerable literature on this problem that has developed over the past few years and give an informal overview of the major theoretical results in the area. ¡  ...  Agreement problems involve a system of processes, some of which may be faulty. A fundamental problem of fault-tolerant distributed computing is for the reliable processes to reach a consensus.  ...  Acknowledgement The author is grateful for Ming Kao for help in assembling the bibliography and to Paul Hudak for many helpful comments on an early draft of this paper.  ... 
doi:10.1007/3-540-12689-9_99 fatcat:mcno7yn4sjhjjbkib23ljjaqzy

Homonyms with Forgeable Identifiers [chapter]

Carole Delporte-Gallet, Hugues Fauconnier, Hung Tran-The
2012 Lecture Notes in Computer Science  
We consider here the Byzantine Agreement problem (BA) in synchronous systems with homonyms in the case where some identifiers may be forgeable.  ...  Assuming that at most t processes may be Byzantine and at most k (t ≤ k ≤ l) of these identifiers are forgeable in the sense that any Byzantine process can falsely use them, we prove that Byzantine Agreement  ...  Interestingly, the solvability of Byzantine Agreement depends only on the number of identifiers and the number of forgeable identifiers.  ... 
doi:10.1007/978-3-642-31104-8_15 fatcat:xwnffn2ddbg4fff3p7bxnypgjy

Extending binary Byzantine agreement to multivalued Byzantine agreement

Russell Turpin, Brian A. Coan
1984 Information Processing Letters  
A binary Byzantine agreement algorithm can be extended to produce a multivalued Byzantine agreement algorithm.  ...  The resulting multivalued algorithm is cheaper than previously published algorithms when the cost of transmitting values from the multivalued domain is significant.  ...  Acknowledgment Mani Chandy, while teaching a distributed algorithms class, first posed the Byzantine generals problem to Russell Turpin, who also would like to thank Jay Misra and Doug Neuse for their  ... 
doi:10.1016/0020-0190(84)90027-9 fatcat:wmlci75lyzee3azdhbywxxqv6y

Levels of authentication in distributed agreement [chapter]

Malte Borcherding
1996 Lecture Notes in Computer Science  
Reaching agreement in the presence of Byzantine (arbitrary) faults is a fundamental problem in distributed systems.  ...  In the past, agreement protocols using message authentication required complete agreement on all public keys.  ...  Summary In this paper, we h a ve focused on protocols for Byzantine agreement and crusader agreement in the presence of incomplete and incorrect authentication.  ... 
doi:10.1007/3-540-61769-8_4 fatcat:mmhhtbuupbfjlhjno6e7anj7ba

An efficient algorithm for byzantine agreement without authentication

Danny Dolev, Michael J. Fischer, Rob Fowler, Nancy A. Lynch, H. Raymond Strong
1982 Information and Control  
Byzantine Agreement involves a system of n processes, of which some t may be faulty.  ...  If the transmitter sends the same value to each process, then all correct processes must agree on that value, but in any case, they must agree on some value.  ...  ACKNOWLEDGMENTS We would like to acknowledge the careful reading and helpful suggestions of the referee.  ... 
doi:10.1016/s0019-9958(82)90776-8 fatcat:xdoudcmzxvhczot2tb3aqrs5wa

Byzantine agreement with homonyms

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
The impossibility proofs use the fact that a Byzantine process can send multiple messages to the same recipient in a round.  ...  case, increasing the number of correct processes can actually make it harder to reach agreement.  ...  We are grateful to Christian Cachin for his useful comments on our model with homonyms. A small subset of our results was presented in a preliminary form in [7] .  ... 
doi:10.1145/1993806.1993810 dblp:conf/podc/Delporte-GalletFGKRT11 fatcat:cneitujhavcifhplnq6h4ymvsu

Asynchronous Byzantine Agreement in Incomplete Networks [Technical Report] [article]

Ye Wang, Roger Wattenhofer
2020 arXiv   pre-print
The Byzantine agreement problem is considered to be a core problem in distributed systems. For example, Byzantine agreement is needed to build a blockchain, a totally ordered log of records.  ...  In this paper, we study the asynchronous Byzantine agreement problem in incomplete networks.  ...  and the number of Byzantine nodes f is less than n 3 .  ... 
arXiv:2005.12725v1 fatcat:wfnhjom2onf3jml5wj5kqr2xgy

Byzantine agreement with homonyms

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2013 Distributed computing  
The impossibility proofs use the fact that a Byzantine process can send multiple messages to the same recipient in a round.  ...  case, increasing the number of correct processes can actually make it harder to reach agreement.  ...  We are grateful to Christian Cachin for his useful comments on our model with homonyms. A small subset of our results was presented in a preliminary form in [7] .  ... 
doi:10.1007/s00446-013-0190-3 fatcat:bodvget4cfeexagynedcti4x4q

Secure Computation without Agreement [chapter]

Shafi Goldwasser, Yehuda Lindell
2002 Lecture Notes in Computer Science  
Such protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine Agreement.  ...  It has recently been shown that executions of authenticated Byzantine Agreement protocols in which more than a third of the parties are corrupted, cannot be composed concurrently, in parallel, or even  ...  for running authenticated Byzantine Agreement). 3.  ... 
doi:10.1007/3-540-36108-1_2 fatcat:gdsqn5o3w5eipcb5oo4szcly2q

Secure and Efficient Asynchronous Broadcast Protocols [chapter]

Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup
2001 Lecture Notes in Computer Science  
Reliable broadcast is a basic primitive, also known as the Byzantine generals problem, providing agreement on a delivered message.  ...  Apparently, no such efficient asynchronous atomic broadcast protocol maintaining liveness and safety in the Byzantine model has appeared previously in the literature.  ...  First, one round of commitment exchanges is added before the agreement loop.  ... 
doi:10.1007/3-540-44647-8_31 fatcat:6tcue5nvt5er5pxwjdefgjjxai

Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency [chapter]

Zarko Milosevic, Martin Hutle, André Schiper
2009 Lecture Notes in Computer Science  
In this context, the literature distinguishes authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption that the signature cannot be forged by any other process  ...  The power of WIC is illustrated on two seminal Byzantine consensus algorithms: the Castro-Liskov PBFT algorithm (no signatures) and the Martin-Alvisi FaB Paxos algorithms (signatures).  ...  We would like to thank Nuno Santos for his comments on an earlier version of the paper.  ... 
doi:10.1007/978-3-642-10877-8_24 fatcat:vurshepcszbibgvldfm3gou4ga

Optimal Communication Complexity of Authenticated Byzantine Agreement [article]

Atsuki Momose, Ling Ren
2021 arXiv   pre-print
Byzantine Agreement (BA) is one of the most fundamental problems in distributed computing, and its communication complexity is an important efficiency metric.  ...  The first protocol achieves the optimal resilience of f < n/2 but requires a trusted setup for threshold signature.  ...  In Byzantine Agreement (BA), each party has an input value, and all parties try to decide on the same value. The requirement of BA is defined as follows. Definition 1 (Byzantine Agreement (BA)).  ... 
arXiv:2007.13175v4 fatcat:3r73b5dmovhbxgc6ibxuhx2wje

On Expected Constant-Round Protocols for Byzantine Agreement [chapter]

Jonathan Katz, Chiu-Yuen Koo
2006 Lecture Notes in Computer Science  
Here, we show an expected constant-round protocol for authenticated Byzantine agreement assuming honest majority (i.e., t < n/2), and relying only on the existence of a secure signature scheme and a public-key  ...  In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds.  ...  Prior Work on Broadcast/Byzantine Agreement In a synchronous network with pairwise authenticated channels and no additional set-up assumptions, BA among n parties is achievable iff the number of corrupted  ... 
doi:10.1007/11818175_27 fatcat:vfi2lflcsfaw7fo34voqljgkvi

Efficient Synchronous Byzantine Consensus [article]

Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, Ling Ren
2017 arXiv   pre-print
Our protocol also solves synchronous authenticated Byzantine agreement in expected 8 rounds. The best previous solution (Katz and Koo, 2006) requires expected 24 rounds.  ...  We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting.  ...  Fellowship award, the HUJI Cyber Security Research Center and the Israel National Cyber Bureau in the Prime Minister's Office.  ... 
arXiv:1704.02397v2 fatcat:f32yncnnqvftvpduoc243j3rrq
« Previous Showing results 1 — 15 out of 3,065 results