There is a growing demand for sharing information across multiple autonomous and private databases. The problem is usually formulated as a secure multiparty computation problem where a set of parties wish to jointly compute a function of their private inputs such that the parties learn only the result of the function but nothing else. In this paper we analyze existing and potential solutions fo...

We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then O(cnκ) is an upper bound for active security with optimal resilience t < n/2 and security parameter κ. This improves on the communicatio...

We present a new approach towards constructing round-optimal secure multiparty computation (MPC) protocols against malicious adversaries without trusted setup assumptions. Our approach builds on ideas previously developed in the context of covert multiparty computation [Chandran et al., FOCS’07] even though we do not seek covert security. Using our new approach, we obtain the following results:...

There has been concern over the apparent conflict between privacy and data mining. There is no inherent conflict, as most types of data mining produce summary results that do not reveal information about individuals. The process of data mining may use private data, leading to the potential for privacy breaches. Secure Multiparty Computation shows that results can be produced without revealing t...

Operations under malicious attack are usually studied in a very narrow context. The typical example is in the context of point-to-point communication networks in a graph. The question is whether after k nodes have been destroyed, each remaining node can continue communicating to any remaining one. The topic was generalized to (1) secure distributed computation (secure multiparty computation); (...

Data interaction scenarios involving multiple parties in network communities have problems of trust, data security, and reliability the parties, secure multiparty computation(SMPC) can effectively solve these problems. To address security fairness issues SMPC, this study considers that semi-honest participants lead to deviations protocol, combines information entropy mutual present an n-round e...

Project co-funded by the European Commission within the 6th Framework Programme Dissemination Level PU Public X PP Restricted to other programme participants (including the Commission services) RE Restricted to a group specified by the consortium (including the Commission services) CO Confidential, only for members of the consortium (including the Commission services) The information in this do...

This paper, pertaining to the design of a new security model with multiparty computation for security, aims to study the rational model and UC (universal composability) model as well as design a security protocol for the requirements of the models. The structures of secret sharing agreement, fair computation agreement, bit analysis agreement and the applications of these agreements on security ...

In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (like privacy and correctness). An adaptively secure protocol is one in which the security properties are preserved even if an adversary can adaptively and dynamically corrupt parties during a computation. This provides ...