Correctness Proof

Set r to be an integer that is bigger or equal to

the desired 1/?. The algorithm satisfies the

agreement and validity requirements because

for any adversary:

• If no message is lost the processes all decisions will be identical.

• Look at the first message omitted by the adversary: only if this message is omitted at round key there might be disagreement.

• Remember that key is selected uniformly at random from the range [1..r].

Previous slide

Next slide

Back to first slide

View graphic version