Secure multi-party computation (MPC) allows a group of mutually distrustful parties to
compute a joint function on their inputs without revealing any information beyond the result …

We construct the first actively-secure threshold version of the cryptosystem based on class
groups from the so-called CL framework (Castagnos and Laguillaumie, 2015). We show …

We propose CL-PRE, a certificateless proxy re-encryption scheme for secure data sharing
with public cloud, which leverages maximal cloud resources to reduce the computing and …

Side-channel analysis and fault-injection attacks are known as major threats to any
cryptographic implementation. Hardening cryptographic implementations with appropriate …

We introduce algebraic geometric techniques in secret sharing and in secure multi-party
computation (MPC) in particular. The main result is a linear secret sharing scheme (LSSS) …

Abstract Gennaro, Gentry, Parno and Raykova proposed an efficient NIZK argument for
Circuit-SAT, based on non-standard tools like conscientious and quadratic span programs …

We study the complexity of securely evaluating arithmetic circuits over finite rings. This
question is motivated by natural secure computation tasks. Focusing mainly on the case of …

The general adversary bound is a semi-definite program (SDP) that lower-bounds the
quantum query complexity of a function. We turn this lower bound into an upper bound, by …

We give a quantum algorithm for evaluating formulas over an extended gate set, including
all two-and three-bit binary gates (eg, NAND, 3-majority). The algorithm is optimal on read …

A threshold public key encryption protocol is a public key system where the private key is
distributed among n different servers. It offers high security since no single server is …