Paper 2023/1013

Best of Both Worlds: Revisiting the Spymasters Double Agent Problem

Abstract

This work defines a notion of secure multiparty computation: MPC with fall-back security. Fall-back security for an $n$-party protocol is defined with respect to an adversary structure $$ wherein security is guaranteed in the presence of both a computationally unbounded adversary with adversary structure $$, and a computationally bounded adversary corrupting an arbitrarily large subset of the parties. This notion was considered in the work of Chaum (Crypto 89) via the Spymaster's double agent problem where he showed a semi-honest secure protocol for the honest majority adversary structure. Subsequent works extend this to give maliciously secure protocols tolerating threshold adversaries. Our first main result is a compiler that can transform any $$-party protocol that is semi-honestly secure with statistical security tolerating a general adversary structure $$ to one that (additionally) provides semi-honest fall-back security w.r.t $$. The resulting protocol has optimal round complexity, up to a constant factor, and is optimal in assumptions and the adversary structure. Our second result fully characterizes when malicious fall-back security is feasible. More precisely, we show that malicious fallback secure protocol w.r.t $$ exists if and only if $$ admits unconditional MPC against a semi-honest adversary (namely, iff $$).

Note: This rivision includes a comparison with prior work that was missed in the earlier version and an updated version of our claims for the threshold setting.