We present a public-key encryption scheme with the following properties. Given a branching program P and an encryptionc of an inputx, it is possible to efficiently compute a succinctciphertextc′ from… (More)

We investigate the extent to which correlated secret randomness can help in secure computation with no honest majority. It is known that correlated randomness can be used to evaluate any circuit of… (More)

We introduce and study the notion of non-interactive secure multiparty computation (NIMPC). An NIMPC protocol for a function f(x1, . . . , xn) is specified by a joint probability distribution R =… (More)

• A set of parties with private inputs wish to compute some joint function of their inputs. • The protocol proceeds in rounds. • Parties wish to preserve some security properties. E.g., privacy and… (More)

Motivated by the goal of improving the concrete efficiency of secure multiparty computation (MPC), we revisit the question of MPC with only two rounds of interaction. We consider a minimal setting in… (More)

A randomized encoding of a function f(x) is a randomized function f̂(x, r), such that the “encoding” f̂(x, r) reveals f(x) and essentially no additional information about x. Randomized encodings of… (More)

We present a framework for constructing compact FHE (fully homomorphic encryption) which is circuit-private in the malicious setting. That is, even if both maliciously formed public key and… (More)

Locally decodable codes (LDC) [1,5] are error correcting codes that allow decoding (any) individual symbol of the message, by reading only few symbols of the codeword. Consider an application such as… (More)

We consider information-theoretic secure two-party computation in the plain model where no reliable channels are assumed, and all communication is performed over the binary symmetric channel (BSC)… (More)