We give the first construction of non-interactive zero-knowledge (NIZK) arguments from post-
quantum assumptions other than Learning with Errors. In particular, we achieve NIZK under …

Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …

Learning parity with noise (LPN) has been widely studied and used in cryptography. It was
recently brought to new prosperity since Boyle et al.(CCS'18), putting LPN to a central role in …

We present new constructions of round-efficient, or even round-optimal, Multi-Party
Computation (MPC) protocols from Oblivious Transfer (OT) protocols. Our constructions …

Recently, Döttling and Garg (CRYPTO 2017) showed how to build identity-based encryption
(IBE) from a novel primitive termed Chameleon Encryption, which can in turn be realized …

A conjunction is a function f (x_1,\dots, x_n)= ⋀ _ i ∈ S l_i where S ⊆ n and each l_i is x_i
or\lnot x_i. Bishop et al.(CRYPTO 2018) recently proposed obfuscating conjunctions by …

In the average-case k-SUM problem, given r integers chosen uniformly at random from {0,⋯,
M-1}, the objective is to find a “solution” set of k numbers that sum to 0 modulo M. In the …

We construct somewhat homomorphic encryption schemes from the learning sparse parities
with noise (sparse LPN) problem, along with an assumption that implies linearly …

We study the relationship among public-key encryption (PKE) satisfying indistinguishability
against chosen plaintext attacks (IND-CPA security), that against chosen ciphertext attacks …

We show that chosen plaintext attacks (CPA) security is equivalent to chosen ciphertext
attacks (CCA) security for key-dependent message (KDM) security. Concretely, we show …