Model and Preliminaries Sample Clauses

Model and Preliminaries. We consider a setting with n parties P1, . . . , Pn that have access to a complete network of pairwise authenticated channels. The adversary is adaptive, and can corrupt up to t parties at any point of the protocol execution in an arbitrary manner. However, we make two standard assumptions on the capability of the adversary (see, e.g., [5, 3]). First, parties can perform an atomic send operation, i.e., they can send a message to any number of parties simultaneously and without the adversary corrupting them in between (different) sends. Second, the adversary cannot perform after-the-fact removal, i.e., cannot take back messages sent by parties while they were still honest.5 We consider protocols in the synchronous and asynchronous network settings. In a synchronous network, we assume communication in lock-step rounds where messages sent by a party at the start of a round arrives at its destination by the end of that round. On the other hand, in an asynchronous network, messages are assumed to arrive at their destination eventually.