We consider the task of secure multi-party computation of arithmetic circuits over a finite
field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be …

We propose a general multiparty computation protocol secure against an active adversary
corrupting up to n-1 of the n players. The protocol may be used to compute securely …

We propose a new approach to practical two-party computation secure against an active
adversary. All prior practical protocols were based on Yao's garbled circuits. We use an OT …

An additively-homomorphic encryption scheme enables us to compute linear functions of an
encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a semi …

Credit networks model transitive trust (or credit) between users in a distributed environment
and have recently seen a rapid increase of popularity due to their flexible design and …

In the setting of secure two-party computation, two parties wish to securely compute a joint
function of their private inputs, while revealing only the output. One of the primary techniques …

Data mining is an important task to understand the valuable information for making correct
decisions. Technologies for mining self-owned data of a party are rather mature. However …

We consider secure two-party computation in a multiple-execution setting, where two parties
wish to securely evaluate the same circuit multiple times. We design efficient garbled-circuit …

In this paper we consider the problem of secure pattern matching that allows single-
character wildcards and substring matching in the malicious (stand-alone) setting. Our …

We present the first actively secure, practical protocol to generate the distributed secret keys
needed in the SPDZ offline protocol. As an added bonus our protocol results in the resulting …