MPC vs. SFE: Unconditional and computational security

Martin Hirt*, Ueli Maurer, Vassilis Zikas

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

In secure computation among a set of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, passive, and fail corruption. The adversary's corruption power is characterized by a so-called adversary structure which enumerates the adversary's corruption options, each option being a triple (A,E,F) of subsets of , where the adversary can actively corrupt the players in A, passively corrupt the players in E, and fail-corrupt the players in F. This paper is concerned with characterizing for which adversary structures general secure function evaluation (SFE) and secure (reactive) multi-party computation (MPC) is possible, in various models. This has been achieved so far only for the very special model of perfect security, where, interestingly, the conditions for SFE and MPC are distinct. Such a separation was first observed by Ishai et al. in the context of computational security. We give the exact conditions for general SFE and MPC to be possible for information-theoretic security (with negligible error probability) and for computational security, assuming a broadcast channel, with and without setup. In all these settings we confirm the strict separation between SFE and MPC. As a simple consequence of our results we solve an open problem for computationally secure MPC in a threshold model with all three corruption types.

Original languageEnglish
Title of host publicationAdvances in Cryptology - ASIACRYPT 2008
Subtitle of host publication14th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages1-18
Number of pages18
ISBN (Electronic)978-3-540-89255-7
ISBN (Print)978-3-540-89254-0
DOIs
Publication statusPublished - 1 Dec 2008
Event14th International Conference on the Theory and Application of Cryptology and Information Security - Melbourne, VIC, Australia
Duration: 7 Dec 200811 Dec 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer, Berlin, Heidelberg
Volume5350
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on the Theory and Application of Cryptology and Information Security
Abbreviated titleASIACRYPT 2008
Country/TerritoryAustralia
CityMelbourne, VIC
Period7/12/0811/12/08

Fingerprint

Dive into the research topics of 'MPC vs. SFE: Unconditional and computational security'. Together they form a unique fingerprint.

Cite this