Bit coin is the first digital currency to see widespread adoption. While payments are
conducted between pseudonyms, Bit coin cannot offer strong privacy guarantees: payment …

In this work, we study indistinguishability obfuscation and functional encryption for general
circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 …

An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

We finally close the long-standing problem of constructing a noninteractive zero-knowledge
(NIZK) proof system for any NP language with security based on the plain Learning With …

We introduce a new characterization of the NP complexity class, called Quadratic Span
Programs (QSPs), which is a natural extension of span programs defined by Karchmer and …

We propose a new notion of secure multiparty computation aided by a computationally-
powerful but untrusted" cloud" server. In this notion that we call on-the-fly multiparty …

We propose the first fully homomorphic encryption scheme, solving an old open problem.
Such a scheme allows one to compute arbitrary functions over encrypted data without the …

We describe plausible lattice-based constructions with properties that approximate the
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …

Abstract We propose a Multi-Authority Attribute-Based Encryption (ABE) system. In our
system, any party can become an authority and there is no requirement for any global …

We construct a simple fully homomorphic encryption scheme, using only elementary
modular arithmetic. We use Gentry's technique to construct a fully homomorphic scheme …