[14 marks]
Hint: A possible line of investigation is to consider that the token from p to r takes a long transmission time, much longer than the time the token from r may take to reach p.
A ® TTP: (A, B);
(* A informs TTP of its fair-exchange partner*)
TTP ® A: |
(A, B, TTP, |
K, EOO); |
A ® B: |
MA = {eK(M), |
SigA(H(eK(M))}; |
B ® TTP: |
SigB(H(MA)); |
|
TTP ® B: |
(A, B, TTP, |
K, EOO); |
TTP ® A: |
SigB(H(MA)); |
|
Notations used bear their conventional meaning:
Page 3 of 4
A precedence relation can be defined between two events that occur during a distributed computation by considering the order in which the events are received at each node. The event with the earliest receipt time is considered to precede the event with the later receipt time.
Copyright © 2012 - 2024 Apaxresearchers - All Rights Reserved.