TY - JOUR
T1 - On achieving the "best of both worlds" in secure multiparty computation
AU - Ishai, Yuval
AU - Katz, Jonathan
AU - Kushilevitz, Eyal
AU - Lindell, Yehuda
AU - Petrank, Erez
PY - 2011
Y1 - 2011
N2 - Two settings are traditionally considered for secure multiparty computation, depending on whether or not a majority of the parties are assumed to be honest. Existing protocols that assume an honest majority provide "full security" (and, in particular, guarantee output delivery and fairness) when this assumption holds, but are completely insecure if this assumption is violated. On the other hand, known protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a single party is dishonest. It is natural to wonder whether it is possible to achieve the "best of both worlds": Namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) and show some positive results regarding what can be achieved.
AB - Two settings are traditionally considered for secure multiparty computation, depending on whether or not a majority of the parties are assumed to be honest. Existing protocols that assume an honest majority provide "full security" (and, in particular, guarantee output delivery and fairness) when this assumption holds, but are completely insecure if this assumption is violated. On the other hand, known protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a single party is dishonest. It is natural to wonder whether it is possible to achieve the "best of both worlds": Namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) and show some positive results regarding what can be achieved.
KW - Secure computation
KW - Theory of cryptography
UR - http://www.scopus.com/inward/record.url?scp=79952946379&partnerID=8YFLogxK
U2 - 10.1137/100783224
DO - 10.1137/100783224
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:79952946379
SN - 0097-5397
VL - 40
SP - 122
EP - 141
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 1
ER -