Many of the currently best actively secure Multi-Party Computation (MPC) protocols like
SPDZ (Damgård et al., CRYPTO 2012) and improvements thereof use correlated …

We introduce Info-Commit, an information-theoretic protocol for polynomial commitment and
verification. With the help of a trusted initializer, a succinct commitment to a private …

It is a challenging problem to delegate the computation of a polynomial on encrypted data to
a server in an oblivious and verifiable way. In this paper, we formally define Verifiable and …

Distributed oblivious polynomial evaluation (DOPE) is a special case of two-party
computation where the sender party P 1 holds a polynomial f (x) of degree k and the receiver …

Some of the most efficient protocols for Multi-Party Computation (MPC) use a two-phase
approach where correlated randomness, in particular Beaver triples, is generated in the …

Choi, Katz, Kumaresan, and Cid put forward the conception of multiclient noninteractive
verifiable computation (MVC), enabling a group of clients to outsource computation of a …

We introduce Info-Commit, an information-theoretic protocol for polynomial commitment and
verification. With the help of a trusted initializer, a succinct commitment to a private …

Abstract Private Polynomial Evaluation (PPE) allows the service provider to outsource the
computation of a polynomial to some third party (eg the Cloud) in a verifiable way. And …

Proofs of Retrievability are protocols which allow a Client to store data remotely and to
efficiently ensure, via audits, that the entirety of that data is still intact. Dynamic Proofs of …

Security and privacy concerns of health records are challenging issues in modern
healthcare systems. Typically, in a healthcare system, doctor requires to confirm the …