Questions tagged [byzantine]

The tag has no usage guidance.

9 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
2
votes
0answers
42 views

Is this simple Asynchronous Byzantine Consensus Protocol correct?

I'm trying to solve a problem that may arise in a system I am concerned with. It will be uncommon in practice, so I am more concerned about simplicity and correctness than performance. I have N ...
2
votes
0answers
77 views

Why is a primary node needed in pBFT algorithm for consensus?

Why is primary needed in pBFT algo? Since many issues of viewchange etc. come up because primary may be faulty - is it possible to have a version of pBFT which doesn't have nodes assigned as primary? ...
1
vote
0answers
55 views

Byzantine Generals Problem - Regular Set of Neighbors

Going through Lamport's paper, I'm a little confused by the second part of the regular set of neighbors definition. A set of nodes $\{i_1, \ldots, i_p\}$ is said to be a regular set of neighbors ...
1
vote
0answers
86 views

Byzantine Generals Problem - Oral and Signed Messages

Having just read through Lamport's paper, I was hoping someone could clarify a few things on the Oral and Signed message algorithms. Why do we have to run $OM()$, recursively by $m$? If a majority of ...
1
vote
0answers
23 views

Are Physical 2-Person Lock Systems Informed by The Byzantine Generals Problem

The Byzantine Generals Problem says a set of generals who are greater than 2/3rds loyal is required to guarantee that securely issuing an order is possible the loyal generals. Because of this, I am ...
1
vote
0answers
37 views

Can someone clarify Invariant 4.7 of the PBFT correctness proof paper?

I am reading the PBFT Correctness Proof Paper and I cannot make completely sense of the Invariant 4.7 and its proof: Here are my concerns: I assume that the symbol $\Leftrightarrow$ is used with the ...
1
vote
0answers
57 views

Number of replicas needed for fault tolerance in state machine replication

I am trying to get my head around "State Machine Replication". I understand that it is a way to ensure resilience against failures. I have read that in order to provide fault tolerance against normal ...
0
votes
0answers
80 views

Two Generals' Problem Definition

I've read various descriptions of the TGP, most of which seem vague or conflicting on the precise constraints of the problem. Specifically: is it always or sometimes impossible to reach consensus ...
0
votes
0answers
66 views

Running Time of Oral Messages Algorithm OM(m) for Byzantine Generals Fault Tolerance

Let us consider a byzantine generals problem assuming: less than 1/3 of generals are traitors Oral messages No Crypto One solution is the Oral Message algorithm OM(m), m being the maximum number ...