[PDF] Top 20 Adaptively Secure Multi-Party Computation with Dishonest Majority

... be adaptively corrupted), even temporarily, just to enable an MPC computation for research ...the dishonest majority setting that requires honest parties to erase its inputs would enable an ... See full document

... round secure-with-abort multiparty protocol, as well as secret-sharing and authentication ...of secure multiparty computation of [1], which requires the protocol to detect a cheating party, ... See full document

... Secure multi-party computation (MPC). In the setting of secure MPC, a set of parties with private inputs wish to jointly compute some function of their inputs while preserving certain ... See full document

... our multi-party protocol provides the first leakage-tolerant protocol that tolerates any level of leakage from any number of parties, and where the information learned in each leakage operation is ... See full document

... subexponentially secure LWE and DDH. For specific multi-party functionalities four-round constructions have been obtained, ...honest majority, the work of Damgard and Ishai [DI05] provided a ... See full document

... In the computational security model, we present an ID-MPC protocol for realizing sampling functionalities, namely ones that sample and distribute correlated random strings, which only makes a black-box use of an ... See full document

... maliciously secure protocol, we leverage the fact that we are in the honest majority ...of multi-verifier zero-knowledge (MVZK) ...of dishonest verifiers (who constitute a minority) cannot ... See full document

... computationally secure MPC protocols ...unconditionally secure protocols with perfect secrecy ...in majority- honest MPC protocols with small probability of error ... See full document

... General purpose Equivocal FHE. We mention for completeness that there is also a more generic ap- proach which will give us adaptive security based only on our Equivocal FHE: namely, we follow the same blueprint as ... See full document

... honest party who intends to erase data—to ensure that all traces of data are ...of adaptively secure protocols; for example, adaptively secure public-key encryption is fairly simple and ... See full document

... Our Contribution. As already remarked much progress has been made on implementation of MPC protocols in the last few years, but most of the “fast” implementations have been for simpler security models. For ex- ample ... See full document

... The goal of this work is to provide the first full fledged secure two-party computation tool that is read- ily deployed by the community. Fairplay provides the first solid answers to questions ... See full document

... Firstly, in our approach, every user has to participate in a registration pro- cess, which is also shown in Figure 3. In this process, each user receives a base pseudonym, that enables her to derive transaction ... See full document

... Continuous data publishing. Publishing the release R2 for T1ᵁT2 would permit an analysis on the data over the combined time period of t1 and t2. It also takes the advantage of data abundance over a longer period of time ... See full document

... for multi-party computation. We have only discussed two-party com- ...to multi-party computation by running an instance of the protocol from Theorem 6 for each pair of ... See full document

... Securing against unauthorized accesses has been an long-term goal of the database security research community and the government research statistical agencies. Solutions to such a problem require combining several ... See full document

... result party may be able to statistically remove the added noise at least in part, revealing more about the data than the data provider ...result party from obtaining sufficient samples to perform such ... See full document

... and secure data ...of computation of security algorithms. In the context of secure communication, cryptography ensures privacy and secrecy of sensitive data through encryption ...provides ... See full document

... PPkNN is a more complex problem than the execution of simple kNN queries over encrypted data. For one, the intermediate k-nearest neighbors in the classification process should not be disclosed to the cloud or any users. ... See full document

... Thus secure multiparty computation problem is transformed into how to compute the addition and multiplication in a security ...the secure multi- party computation [4,5] ... See full document