[PDF] Top 20 Passive Corruption in Statistical Multi-Party Computation

... between passive corruption and the various security ...the statistical model, passive corruption does not only affect secrecy, but in particular also ...and passive corrup- ... See full document

... When designing and analyzing protocols for secure computation, there are several different ad- versarial models one can consider. The original definitions of security assume a static adversary who decides which ... See full document

... 1. First, we consider the commitment functionality F, where there are two special parties – the committer C and the receiver R, and n − 2 dummy parties. Let Π be any o( log n n )-round n-party protocol that ... See full document

... Verifiable computation: There are many more verifiable computing schemes using proof- and argument-based systems, or based on fully homomorphic ...and statistical input privacy towards the verifier [3, 7, ... See full document

... Next, let us consider corruption . Money is not black. White money becomes black when possessed by corrupted agents and used for evil purposes. Let us look at some puzzles. Can e-payment or m-payment solve the ... See full document

... Abstract—Many studies have been done with the security of cloud computing. Data encryption is one of typical approaches. However, complex computing requirement needs a great deal of time and effort for the system. ... See full document

... of passive adversaries, (or even the slightly stronger setting of semi-malicious 2 adversaries) three round protocols based on the Learning With Errors assumption have been constructed by Brakerski et ...specific ... See full document

... Data collection and publishing is described in Figure 1.1. In the data collection phase, the data holder collects data from record owners (e.g., Alice and Bob). In the data publishing phase, the data holder releases the ... See full document

... allow corruption of all but one player, the maximal unqualified sets must be all sets of n − 1 ...multiparty computation protocol for the common reference string model to implement the above ... See full document

... veriable computation, privacy preserving protocols, and ...statement. Corruption of this process leads to forged proofs and for applications such as cryptocurrencies, potentially billions of dollars in ...a ... See full document

... either passive or malicious. Par- ticipants under control of a passive adversary may share information with one another but do not deviate from the MPC ... See full document

... Solution. Essentially we solve the above problem by two steps. We first show that the “basic” protocol as described above is already secure when there is exactly one honest party. Then, later in Sec. 6.2 we extend ... See full document

... The ideas from [MQU10] can be easily adapted to the quantum case. In Section 3, we introduce everlasting quantum UC (eqUC). Here Z, Sim, Adv are quantum-polynomial- time machines (representing the fact that adversaries ... See full document

... Secure Multi-Party Computation Secure Multi-Party Computation (MPC) allows a set P of n players to securely evaluate a function f even when a subset of the play- ers is corrupted ... See full document

... been the subject of investigations by many researchers, and many solutions have been published in the literature. From the security point of view, these proto- cols can be classified into two broad categories: (i) ... See full document

... a passive adversary, but we aim at achieving security even against a majority of t > n/2 colluding participants; in fact we aim at achieving security even against t = n − 1 colluding ...trusted party ... See full document

... the computation of these tables is of constant depth, this step is constant ...online computation phase, and therefore does not add any overhead to the ... See full document

... Observe that the same signature (and possibly the same commitment to the signed message) can be used in multiple secure function evaluations for possibly different functions. To capture this formally, one would need to ... See full document

... each party is participating in the secure multi-party computation protocol using a computer connected to the other computers via a network, then each party can observe and collect ... See full document

... 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