Welcome to the resource topic for 2014/809
Title:
Server-Aided Two-Party Computation with Minimal Connectivity in the Simultaneous Corruption Model
Authors: Ignacio Cascudo, Ivan Damgård, Oriol Farràs, 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.
ePrint: https://eprint.iacr.org/2014/809
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .