A major challenge in the study of cryptography is characterizing the necessary and sufficient
assumptions required to carry out a given cryptographic task. The focus of this work is the …

We propose a new protocol for two-party computation, secure against malicious adversaries,
that is significantly faster than prior work in the single-execution setting (ie, non-amortized …

A fundamental problem in designing secure multi-party protocols is how to deal with
adaptive adversaries (ie, adversaries that may choose the corrupted parties during the …

Abstract The Universal Composability framework was introduced by Canetti to study the
security of protocols which are concurrently executed with other protocols in a network …

Already in ancient Greece, the Spartans were worried about the privacy of their messages
during military conflicts and used a transposition cipher (scytale) to render their messages …

Secure Multi-Party Computation (MPC) is one of the most powerful tools developed by
modern cryptography: it facilitates collaboration among mutually distrusting parties by …

We propose a 2-party UC-secure protocol that can compute any function securely. The
protocol requires only two messages, communication that is poly-logarithmic in the size of …

One of the major security concerns in outsourced computation is whether the computation is
performed honestly. Although cryptographically verifiable computation promises (almost) …

With the development of cloud computing, verifiable computation (VC) has attracted
considerable attentions due to its importance. However, the existing VC schemes suffer from …

We consider a new model for online secure computation on encrypted inputs in the
presence of malicious adversaries. The inputs are independent of the circuit computed in the …