[PDF] Top 20 Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

... universally composable (UC) ...resultant protocol using the security of its ...a protocol remains secure even when it is concurrently executed with any other protocols in any ...MPC protocol ... See full document

... of black-box access to cryptographic ...a constant round multi-party protocol where the party have only black-box access to a ...first ... See full document

... Secure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should ... See full document

... secure multi-party computation (MPC) for arbitrary functionalities [Yao82, Yao86, Kil88, IPS08, IKO + 11, BL18, ...high round complexity (as, ... See full document

... the protocol are called the “garbled circuit generation sessions” (or GCG sessions in ...The protocol employed to generate these garbled circuits in the GCG sessions is a protocol secure only against ... See full document

... make black box use of an Oblivious Transfer (OT) subprotocol, which is then implemented in the trusted setup model using Beaver’s ‘pre-computation’ construction [5], where the precomputation ... See full document

... the computation of the table of g might not agree with the inputs used for the computation of the table of g 0 ...offline computation must verify the consistency of the computations of different ...a ... See full document

... a black-box simulator of an o( log n n ) round protocol for an n-party functionality does not gain anything via “rewindings” in the adaptive ...r round (such that r is o( log n n ... See full document

... multiparty computation (SMC) offers a technique to preserve functionality and data privacy in mobile ...cryptographic construction feasible on mobile devices securely outsource the bulk of the ... See full document

... zero-knowledge protocol of Prab- hakaran et al. [PRS02] and is constructed in a black-box way from one-way ...external protocol, and furthermore, even though the extractor rewinds the ... See full document

... Our protocol in the semi-honest setting relies on a common reference string ...universally composable computation in the presence of malicious adversaries corrupting half or more of the parties, even ... See full document

... Secure multi-party computation enables a set parties to mutually run a protocol that computes some function f on their private inputs, while preserving a number of security ...the ... See full document

... OT protocol of ...the protocol of [32] as ...OT protocol of [32] without relying on the concurrent security of the coin tossing part (and therefore without using CCA-secure commitments ...the ... See full document

... Secure multi-party computation (MPC) allows multiple par- ties to compute a known function over inputs held by each party, without any party having to reveal its private ... See full document

... the protocol succeeds, in which case every party receives its output, or the protocol aborts, in which case all honest parties learn that the protocol ...the protocol aborts.) The GMW ... See full document

... a constant number of communication rounds and is based on using an enhanced trapdoor ...the multi-party case (namely, se- cure computation involving more than two parties), the pro- tocols of ... See full document

... one party at a time until that resolution protocol is ...the protocol), and while the communication channel is under adversary’s control, it is assumed that the adversary cannot prevent the honest ... See full document

... general-adversary protocol is highly relevant: For example for n = 25, |Z| is expected to be around one million, and a protocol communicating |Z| · Poly(n) might be acceptable, whereas a protocol ... See full document

... Our protocol for general adversaries is based on [HMZ08], which is an adaptation of the perfectly secure protocol of [Mau02] to the statistical ...generic protocol construction, it is ... See full document

... Abstract. Multiplicative monotone span program is one of the impor- tant tools to realize secure multiparty computation. It is essential to construct multiplicative monotone span programs for secure multiparty ... See full document