Checking Phase Sample Clauses

Checking Phase. Here the parties, on having private input message of A bits each (i.e. miα’s), jointly perform some computation in order to determine and agree on a set of t′ + 1 parties called c′h ′, such that the honest parties in c′h hold a common l/t bit message, say mα∗ . In case of failure due to the inconsistencies among the inputs of the honest parties, the parties abort any further computation for current segment and agree on a predefined message m†α. So in this case current segment terminates with all honest parties agreeing on common output m∗α = mα† . On the other hand, if c′h is generated and agreed among the parties, then the computation for current segment proceeds to the next phase. It is to be noted that Pc′h will be always obtained if the initial messages of the honest parties in P′ are same.

Checking Phase. Participate in the code Checking, presented in Fig. 1 to in P hold common bits, say m . If P is generated then proceed to the determine and agree on Pc'h ⊆ P' of size t' + 1 such that all the honest parties