[PDF] Top 20 Recent Results in Scalable Multi-Party Computation

... Oblivious Parallel RAM. While parallelism has been extensively used in var- ious computer architectures for accelerating computations, most ORAM models of computation (see Section 2.2) are not parallel. In the ... See full document

... each party or data custodians as in referred here namely Secure Multiparty computation and partial information hiding ...Multiparty Computation provides a robust level of security where as the other ... See full document

... to multi-site regression [23, 24] can guarantee the precision of model ...secure multi-party computation (SMC) methods [18, 27–33] have been developed for distrib- uted model ...of ... See full document

... more recent non-regular BJMM variant, and then we take the minimum of the ...more recent techniques to the regular case, but this is out of the scope of this ... See full document

... Adaptively Secure Composition: More than Meets the Eye. Somewhat surprisingly, a 2-party adaptively secure protocol fails to guarantee security when executed in the setting of n-parties, even if only two of the ... See full document

... composable computation in the presence of malicious adversaries corrupting half or more of the parties, even in a static-corruption ...that results of Garg and Sahai [18] indicate that a CRS (or some other ... See full document

... Evaluation. We have implemented EzPC using ABY [18] as the cryptographic back-end. We compare EzPC with Yao-based compil- ers in Section 2.1 and with specialized protocols in Section 7. We evaluate EzPC by implementing a ... See full document

... soundness results of preservation of uniformity properties for protocols built upon our abstraction of LSSS-based ...soundness results of preservation of uniformity ... See full document

... two- party version of Fairplay, which increases the overhead by a factor of c in order to reduce the cheating probability of malicious adversaries to ...1/c). Recent work [15], describes a highly optimized ... See full document

... That is, four basic operations of arithmetic (addition, subtraction, multiplication, and division) hold as integration of sub computation by each server. In this case, each server can not know the original data a ... See full document

... In this paper we considered a new type of potential attackers in collaborative data publishing – a coalition of data providers, called m-adversary. Privacy threats introduced by m-adversaries are modeled by a new privacy ... See full document

... Achieving a simulatable protocol. A harder problem is how to simulate the output phase in which ciphertexts containing the outputs are decrypted. In the simulation we cannot expect that these ciphertexts are correctly ... See full document

... key/MAC for each share value. In [DPSZ12], called the SPDZ protocol hereafter, the authors obtain a more efficient online protocol by replacing the MACs from [BDOZ11] with global MACs which authenticate the shared values ... See full document

... 4. Lastly, unlike the TinyOLE scheme [7], our scheme is scalable, in that it extends to the multi-party case with n participants. In fact, computing n shares (one for each participant) to a single ... See full document

... During computation over secret shares by compute parties, we rely on the underlying security of the SPDZ ...query results are never “in the clear” within the Jana ... See full document

... two party computation 2 , albeit in non-simultaneous message model where no broadcast channel is available ...A recent work [GMPP15] shows a similar lower bound of 4 rounds assuming broadcast ... See full document

... optimistic multi-party fair exchange protocols that efficiently guarantee fairness in any exchange topology (including complete ...a party sends his item but in return he does not receive an item, he ... See full document

... Our results demonstrate that ID-MPC is not only the most desirable notion from a practical point of view, but it also has the potential to be efficiently ... See full document

... classical results and [27, 28] for more recent work) make black box use of an Oblivious Transfer (OT) subprotocol, which is then implemented in the trusted setup model using Beaver’s ... See full document

... the recent work of Ciampi et ...specific multi-party functionalities four-round constructions have been obtained, ...multiparty computation protocols in the common reference string model under ... See full document