Cryptology ePrint Archive: Report 2014/809

Server-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model

Ignacio Cascudo and Ivan Damgård and Oriol Farràs and Samuel Ranellucci

Abstract: We consider secure two-party computation in the client-server model. In our scenario, two adversaries operate \emph{separately but simultaneously}, each of them corrupting one of the parties and a restricted subset of servers that they interact with. We model security in this setting via the local universal composability framework introduced by Canetti and Vald and show that information-theoretically secure two-party computation is possible if and only if there is always at least one server which remains uncorrupted. Moreover, in our protocols each of the servers only needs to communicate with the two clients, i.e. no messages are exchanged directly between servers. This communication pattern is minimal.

Category / Keywords: two-party computation, simultaneous corruption, universal composability with local adversaries, oblivious transfer

Date: received 7 Oct 2014, last revised 28 Jul 2015

Contact author: ignacio at cs au dk

Available format(s): PDF | BibTeX Citation

Version: 20150728:140434 (All versions of this report)

Short URL: ia.cr/2014/809

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]