Communication and Adversary Model. Parties have access to a complete network of point-to-point authenticated xxxx- xxxx. The network is synchronous, meaning that any message sent by an honest party is delivered within a known amount of time. In this setting, protocols are typically described in rounds. We consider an adaptive adversary that can corrupt up to t parties at any point in the protocol’s execution, causing them to deviate arbitrarily from the protocol. Moreover, the adversary is strongly xxxxxxx: it can observe the messages sent by honest parties in a round before choosing its own messages for that round, and, when an honest party sends a message during some round, it can immediately corrupt that party and replace the message with another of its choice.
