Common use of Protocol Analysis Clause in Contracts

Protocol Analysis. De nition 5. A node of the IG-tree is common with value v if every correct player computes the same value v for in the data conversion phase. The subtree rooted at node has a common frontier if every path from to a leaf contains at least one common node. Lemma 1. For any adversary structure A over a player subset S P satisfy- ing Qk(S; A) and any adversary set A 2 A, the restricted adversary structure Aj(S nA) satis es Qk-1(S nA; Aj(S nA)). i1

Protocol Analysis. De nition 5. A node of the IG-tree is common with value v if every correct player computes the same value v for in the data conversion phase. The subtree rooted at node has a common frontier if every path from to a leaf contains at least one common node. Lemma 1. For any adversary structure A over a player subset S P satisfy- ing Qk(S; A) and any adversary set A 2 A, the restricted adversary structure Aj(S nAc A Corollary 1. If the adversary structure ) satis es Qk-1(S nA; Aj(S nA)). i1then for every internal node of the IG-tree,