Message transfer and authentication Clause Samples

Message transfer and authentication. 1. Ui chooses a random si (0 ≤ si ≤ q − 1), and broadcasts Zi = gsi . 2. After receiving every Zj (1 ≤ j ≤ n, j ƒ= i), Ui verifies that none of them equals 1. If the check succeeds, Ui computes and broadcasts Ai,i−1 and Ai,i+1, where Z = Z1||Z2||··· ||Zn, Ai,i−1 = H1(i||i − 1||Z||gsi−1si ||g||IDu), and Ai,i+1 = H1(i||i + 1||Z||gsi+1si ||g||IDu).