Previous Work On Combining Asynchronous and Synchronous Protocols Sample Clauses

Previous Work On Combining Asynchronous and Synchronous Protocols. In a related, but different line of work, two previous works study the question of how much initial synchronous computation is needed to be able to switch to fully asynchronous computation af- terwards. Concretely, the work of Beerilova et al. [4] shows that one initial round of synchronous broadcast is enough to perform asynchronous multi-party computation against an n -minority of malicious parties. Fitzi and ▇▇▇▇▇▇▇ [20] showed that for the case of BA (and without a broadcast channel available during the synchronous rounds), 3f − n + O(1) initial synchronous rounds are sufficient in order to switch to fully asynchronous communication afterward (where again f < n denotes the number of malicious parties). In this section, we recall some basic notation and definitions.