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

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

Paper 2014/809

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

Ignacio Cascudo, Ivan Damgård, 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.

Metadata

Available format(s): PDF
Publication info: Preprint. MINOR revision.
Keywords: two-party computation simultaneous corruption oblivious transfer
Contact author(s): ignacio @ cs au dk
History: 2015-07-28: last of 3 revisions; 2014-10-11: received; See all versions
Short URL: https://ia.cr/2014/809
License: CC BY

BibTeX

@misc{cryptoeprint:2014/809,
      author = {Ignacio Cascudo and Ivan Damgård and Oriol Farràs and Samuel Ranellucci},
      title = {Server-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model},
      howpublished = {Cryptology ePrint Archive, Paper 2014/809},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/809}},
      url = {https://eprint.iacr.org/2014/809}
}