We present SimplePIR, the fastest single-server private information retrieval scheme known
to date. SimplePIR's security holds under the learning-with-errors assumption. To answer a …

We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our
scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable …

Tiptoe is a private web search engine that allows clients to search over hundreds of millions
of documents, while revealing no information about their search query to the search engine's …

Non-interactive publicly verifiable secret sharing (PVSS) schemes enables (re-) sharing of
secrets in a decentralized setting in the presence of malicious parties. A recently proposed …

We show the existence of indistinguishability obfuscators (iO) for general circuits assuming
subexponential security of:(a) the Learning with Errors (LWE) assumption (with …

We construct indistinguishability obfuscation (iO) solely under circular-security properties of
encryption schemes based on the Learning with Errors (LWE) problem. Circular-security …

We present a rate-1 construction of a publicly verifiable non-interactive argument system for
batch-NP (also called a BARG), under the LWE assumption. Namely, a proof corresponding …

Homomorphic encryption (HE) is often viewed as impractical, both in communication and
computation. Here we provide an additively homomorphic encryption scheme based on …

We introduce a new primitive named Delay Encryption, and give an efficient instantiation
based on isogenies of supersingular curves and pairings. Delay Encryption is related to …

We propose a new approach to construct general-purpose indistinguishability obfuscation
(iO). Our construction is obtained via a new intermediate primitive that we call split fully …