International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 11 October 2014

Ignacio Cascudo, Ivan Damgård, Samuel Ranellucci
ePrint Report ePrint Report
We consider secure two-party computation in the client-server model where there are two adversaries that operate separately but simultaneously, each of them corrupting one of the parties and a restricted subset of servers that they interact with. We model security via the local universal composability framework introduced by Canetti and Vald and we show that information-theoretically secure two-party computation is possible if and only if there is always at least one server which remains uncorrupted.

Expand

Additional news items may be found on the IACR news page.