Models and Definitions Clause Samples

Models and Definitions. Models: We consider a synchronous network in which every pair of players is connected by an unjammable, authenticated chan- nel. That is, for every pair i, j, player pi can always send mes- sages directly to pj . The adversary can neither prevent those messages from being delivered nor introduce new messages on the channel. By synchronous, we mean that all players run on a common clock, and messages are always delivered within some bounded time. Our protocols are secure even if the adversary can rush messages, i.e., even if messages from honest players are delivered before corrupted players send their messages. Our protocols are secure against Byzantine (or “active”) adver- saries, that select up to t players and coordinatedly corrupt them in an arbitrarily malicious way. The corruptions may be adap- tive, that is the adversary grows the set of corrupted players on the fly, based on the execution so far. In this framework, we consider three models, denoted Mauth , Msec, Mq :