Universally composable synchronous computation

Jonathan Katz*, Ueli Maurer, Björn Tackmann, Vassilis Zikas

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: they can simultaneously achieve input completeness (all honest parties' inputs are included in the computation) and guaranteed termination (honest parties do not "hang" indefinitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channels have (known) bounded latency and parties have loosely synchronized clocks. The widely-used 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 novel 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 achieved given these functionalities, and that previous similar models can all be expressed within our new framework.

Original languageEnglish
Title of host publicationTheory of Cryptography
Subtitle of host publication10th Theory of Cryptography Conference, TCC 2013, Proceedings
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages477-498
Number of pages22
ISBN (Electronic)978-3-642-36594-2
ISBN (Print)978-3-642-36593-5
DOIs
Publication statusPublished - 21 Feb 2013
Event10th Theory of Cryptography Conference - Tokyo, Japan
Duration: 3 Mar 20136 Mar 2013
https://www.iacr.org/workshops/tcc2013/

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer, Berlin, Heidelberg
Volume7785
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th Theory of Cryptography Conference
Abbreviated titleTCC 2013
Country/TerritoryJapan
CityTokyo
Period3/03/136/03/13
Internet address

Fingerprint

Dive into the research topics of 'Universally composable synchronous computation'. Together they form a unique fingerprint.

Cite this