Protocol ABBA Sample Clauses

Protocol ABBA. We now present our protocol ABBA, which stands for Asynchronous Binary Byzantine Agree- ment. As usual there are n parties P1, . . . , Pn, up to t of which may be corrupted by the adversary. We denote by f the actual number of parties corrupted. The protocol uses an (n, n − t, t) threshold signature scheme S and an (n, t + 1, t) threshold signature scheme S0 (see §4.2), as well as an (n, n − t, t) threshold coin-tossing scheme (see §4.3). Let F (C) denote the value of coin with name C.