We present here a generalization of the work done by Rabin and Ben-Or in [RBO89]. We give a protocol for multiparty computation which tolerates any Q active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional altho...

Veriiable Secret Sharing is a fundamental primitive for secure cryptographic design. We present a stronger notion of veriiable secret sharing and exhibit a protocol implementing it. We show that our new notion is preferable to the old ones whenever veriiable secret sharing is used as a tool within larger protocols, rather than being a goal in itself. Indeed our deenition, and so our protocol sa...

Abstract We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE). To support our solution, we introduce version of Brakerski-Fan-Vercauteren cryptosystem implement it an open-source library. MHE-based MPC solutions have several advantages: Their transcript public, their o~ine...

We present a generic method for turning passively secure protocols into protocols secure against covert attacks. The method adds a post-execution verification phase to the protocol that allows a misbehaving party to escape detection only with negligible probability. The execution phase, after which the computed protocol result is already available for parties, has only negligible overhead added...

This work presents the construction of intelligent algorithmic mechanism based on multidimensional view of intelligent reasoning, threat analytics, cryptographic solutions and secure multiparty computation. It is basically an attempt of the cross fertilization of distributed AI, algorithmic game theory and cryptography. The mechanism evaluates innate and adaptive system immunity in terms of col...

We study a distributed adversarial model of computation in which the faults are non-stationary and can move through the network (like viruses) as well as non-threshold (there is no specific bound on the number of corrupted players at any given time). We show how to construct multiparty protocols that are perfectly secure against such generalized mobile adversaries. The key element in our soluti...

In the setting of multiparty computation, a set of mutually distrusting parties wish to securely compute a joint function of their private inputs. A protocol is adaptively secure if honest parties might get corrupted after the protocol has started. Recently (TCC 2015) three constant-round adaptively secure protocols were presented [CGP15, DKR15, GP15]. All three constructions assume that the pa...

We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not require expensive zero-knowledge proofs and its communication complexity does not depend on the computational complexity of the underlying cryptographic primitive. Our protocol withstands an active, adaptive adversary corrup...

We show how Alice and Bob can establish whether they love each other, but without the embarrassement of revealing that they do if the other party does not share their feelings. This is a “secure multiparty computation” of the AND function, where the participants cooperate in producing the result of the AND, but without learning the input bit contributed by the other party unless the result

In both information-theoretic and computationally-secure MultiParty Computation (MPC) protocols the parties are usually assumed to be connected by a complete network of secure or authenticated channels, respectively. Taking inspiration from a recent, highly efficient, threeparty honest-majority computationally-secure MPC protocol of Araki et al., we show how to perform the most costly part of a...