[PDF] Top 20 Efficient General-Adversary Multi-Party Computation

... vs. General Adversaries Clearly, general adversaries are more flexible, which is relevant in particular when the set of players is not very ...less efficient than thresh- old protocols; more ... See full document

... an adversary corrupting up to (1/3 − ) fraction of parties, for some fixed positive ...each party communicate with all other ...each party uses in the ...performing general MPC. The protocol ... See full document

... more general discussion on how trusted erasures may be a problematic ...MPC computation for research ...an adversary, simply by aborting the protocol, to cause all honest parties to lose all of their ... 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 ...recent efficient construction of Lindell and Pinkas ... See full document

... in general, as we do not know the number of times we need to ...the adversary until we suc- cessfully extracted the ...the adversary completes the first three messages of the ... 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 implemented. To this end, one can instantiate our construction ... See full document

... the adversary cannot prevent the honest parties from learning their respective out- ...the adversary can possibly prevent the honest parties from learning their outputs, but then also the corrupted parties ... See full document

... ) field elements, where ℓ is the number of monomials in F , as defined above. Although we may not achieve efficiency for functions with a large number of monomials, for functions with a small number of monomials, ... See full document

... Secure computation enables parties with inputs to compute a function on the inputs while keeping them ...secure computation should satisfy, ...an adversary, and there are two classical ... See full document

... the adversary can potentially create a set of shares different from those generated by the multiplication protocol but so that the sacrifice check passes; this can be viewed as re-randomising shares, as was ... See full document

... verifiable multi-party computation scheme for shared data providing public verifiability and unconditional privacy towards the servers and parties verifying the correctness of the ...single ... See full document

... the adversary obtains output while an honest party does ...the adversary to lead the protocol to a deadlock where no party receives output however the honest parties have wasted resources by ... See full document

... the multi-QID anonymity requirement helps avoid unnecessary masking and, therefore, preserves more of the cluster ...highly efficient and scalable for multi ... 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

... the computation is performed by m parties, the former solution tolerates fewer than m/3 corruptions, while the latter can handle any number of corrupt ...secure computation are identical to those generated ... See full document

... if efficient markets hypothesis is true and prices reflect even the “informed” traders’ private information, then the informed traders have no incentive to garner costly private ... See full document

... Our computational implementation of a symbolic protocol is a probabilistic polynomial-time algorithm that expects as input the symbolic protocol Π , a set of deterministic polynomial-time algorithms A for the ... See full document

... the multi-party computation was introduced three decades ago by Yao (1982), but few practical applications of multi-party computation is ...the multi-party ... See full document

... However, Yao ’ s garbled circuit is only secure in 2-party semi-honest scenarios, which is not sufficient for practical use. Usually, there are more than 2 parties or participants engaged in the same computing ... See full document

... more efficient than executing m instances of an OT ...secure multi-party computation [GMW87,Gol04], and a bit-OT protocol with O(1) communication complexity implies secure computation ... See full document