3 research outputs found
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments
We present a new multiparty computation protocol secure against a static and malicious dishonest majority. Unlike most previous protocols that were based on working on MAC-ed secret shares, our approach is based on computations on homomorphic commitments to secret shares. Specifically we show how to realize MPC using any additively-homomorphic commitment scheme, even if such a scheme is an interactive two-party protocol.
Our new approach enables us to do arithmetic computation over arbitrary finite fields. In addition, since our protocol computes over committed values, it can be readily composed within larger protocols, and can also be used for efficiently implementing committing OT or committed OT. This is done in two steps, each of independent interest:
1. Black-box extension of any (possibly interactive) two-party additively homomorphic commitment scheme to an additively homomorphic multiparty commitment scheme, only using coin-tossing and a “weak” equality evaluation functionality.
2. Realizing multiplication of multiparty commitments based on a lightweight preprocessing approach.
Finally we show how to use the fully homomorphic commitments to compute any functionality securely in the presence of a malicious adversary corrupting any number of parties
Efficient, Actively Secure MPC with a Dishonest Majority: a Survey
The last ten years have seen a tremendous growth in the interest and practicality of
secure multiparty computation (MPC) and its possible applications. Secure MPC is indeed
a very hot research topic and recent advances in the
eld have already been translated into
commercial products world-wide. A major pillar in this advance has been in the case of
active security with a dishonest majority, mainly due to the SPDZ-line of work protocols.
This survey gives an overview of these protocols, with a focus of the original SPDZ paper
(CRYPTO 2012) and its subsequent optimizations. It also covers some
alternative approaches based on oblivious transfer, oblivious linear-function evaluation, and
constant-round protocols
Highly Efficient OT-Based Multiplication Protocols
We present a new OT-based two-party multiplication protocol that is almost as efficient as Gilboa\u27s semi-honest protocol (Crypto \u2799), but has a high-level of security against malicious adversaries without further compilation. The achieved security suffices for many applications, and, assuming DDH, can be cheaply compiled into full security