Professional Documents
Culture Documents
The Byzantine Generals Problems
The Byzantine Generals Problems
The Byzantine Generals Problems
Communicate only be
messenger
Motivation
Conclusion
Formally
1. All loyal lieutenants obey the same order
Assumptions:
Algorithm OM(0) :
2.For each i, let vi be the value lieutenant i receives from the commander. Lieutenant
i acts as the commander in Algorithm OM(m-1) to send the value vi to each of the
n-2 other lieutenants.
3.For each i, and each j ≠ i, let vi be the value lieutenant i received from lieutenant j in
step 2 (using Algorithm OM(m-1)). Lieutenant i uses the value Majority(v1, v2, …
vn).
Oral Message algorithm
Lemma 1:
Theorem 1:
OM(0):???
L1 A L2 L3
R
A
R
Decision?? L1 = m (A, A, R); L2 = m (A, A, R); Both attack!
Oral Message algorithm
Example: Bad Commander
Scenario: m=1, n=4, traitor = C
C
A A
OM(1): R
L1 L2 L3
A
OM(0):???
L1 A L2 R L3
A
R
A
Decision?? L1=m(A, R, A); L2=m(A, R, A); L3=m(A,R,A); Attack!
Signed Message algorithm
More assumptions:
choice(V):
• If V={v} then choice(V)= v
• choice(Empty)=Default
Signed Message algorithm
SM(1) Example: Bad Commander
Scenario: m=1, n=m+2=3, bad commander
C
A:0 R:0
L1 L2
R:0:L2
V1={A,R} V2={R,A}
Both L1 and L2 can trust orders are from C
Both apply same decision to {A,R}
Signed Message algorithm
SM(2): Bad Commander+
Scenario: m=2, n=m+2=4, bad commander and L3
C Goal? L1 and L2
A:0 x
A:0 must make same
decision
L1 L2 L3
A:0:L1 R:0:L3:L1
L1 A:0:L2 L2 A:0:L3 L3
L1 L2
R:0:L3
Oral messages:
Signed messages: