The framework of universal composability (UC) is inherently asynchronous, but several approaches for adding synchrony to the framework have been proposed. However, we show that the existing proposals do not provide the expected guarantees. Given this, we propose a “clean slate” approach to defining synchrony in the UC framework by introducing functionalities exactly meant to model, respectively, bounded-delay networks and loosely synchronized clocks. We show that the expected guarantees of synchronous computation can be realized given these functionalities, and that previous models can all be expressed within our new framework.
Category / Keywords: cryptographic protocols / Original Publication (with minor differences): IACR-TCC-2013 Date: received 10 Jun 2011, last revised 26 Oct 2013 Contact author: vzikas at cs ucla edu Available format(s): PDF | BibTeX Citation Version: 20131026:194047 (All versions of this report) Short URL: ia.cr/2011/310