Outsourcing multi-party computation
We initiate the study of secure multi-party computation (MPC) in a server-aided setting,
where the parties have access to a single server that (1) does not have any input to the …
where the parties have access to a single server that (1) does not have any input to the …
Secure multiparty computation with minimal interaction
We revisit the question of secure multiparty computation (MPC) with two rounds of
interaction. It was previously shown by Gennaro et al.(Crypto 2002) that 3 or more …
interaction. It was previously shown by Gennaro et al.(Crypto 2002) that 3 or more …
Secure multi-party computation without agreement
S Goldwasser, Y Lindell - Journal of Cryptology, 2005 - Springer
It has recently been shown that authenticated Byzantine agreement, in which more than a
third of the parties are corrupted, cannot be securely realized under concurrent or parallel …
third of the parties are corrupted, cannot be securely realized under concurrent or parallel …
Secure computation with minimal interaction, revisited
Motivated by the goal of improving the concrete efficiency of secure multiparty computation
(MPC), we revisit the question of MPC with only two rounds of interaction. We consider a …
(MPC), we revisit the question of MPC with only two rounds of interaction. We consider a …
A pragmatic introduction to secure multi-party computation
Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …
to a tool for building real systems today. Over the past decade, MPC has been one of the …
Fairness versus guaranteed output delivery in secure multiparty computation
In the setting of secure multiparty computation, a set of parties wish to compute a joint
function of their private inputs. The computation should preserve security properties such as …
function of their private inputs. The computation should preserve security properties such as …
A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority
Protocols for secure multiparty computation enable a set of parties to compute a function of
their inputs without revealing anything but the output. The security properties of the protocol …
their inputs without revealing anything but the output. The security properties of the protocol …
Bounded-concurrent secure multi-party computation with a dishonest majority
R Pass - Proceedings of the thirty-sixth annual ACM symposium …, 2004 - dl.acm.org
We show how to securely realize any multi-party functionality in a way that preserves
security under an a-priori bounded number of concurrent executions, regardless of the …
security under an a-priori bounded number of concurrent executions, regardless of the …
Fast large-scale honest-majority MPC for malicious adversaries
K Chida, K Hamada, D Ikarashi, R Kikuchi… - Journal of …, 2023 - Springer
Protocols for secure multiparty computation enable a set of parties to compute a function of
their inputs without revealing anything but the output. The security properties of the protocol …
their inputs without revealing anything but the output. The security properties of the protocol …
Round-optimal secure multiparty computation with honest majority
We study the exact round complexity of secure multiparty computation (MPC) in the honest
majority setting. We construct several round-optimal n-party protocols, tolerating any t< n 2 …
majority setting. We construct several round-optimal n-party protocols, tolerating any t< n 2 …