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 …

Multi-client functional encryption (MCFE) allows ℓ clients to encrypt ciphertexts (C _ t, 1, C _
t, 2, ..., C _ t, ℓ) under some label. Each client can encrypt his own data X_i for a label t using …

We introduce the first candidate Lattice-based designated verifier (DV) zero knowledge
sUccinct Non-interactive Argument (ZK-SNARG) protocol, named LUNA, with quasi-optimal …

We give a tighter security proof for authenticated key exchange (AKE) protocols that are
generically constructed from key encapsulation mechanisms (KEMs) in the quantum random …

Selective opening (SO) security is a security notion for public-key encryption schemes that
captures security against adaptive corruptions of senders. SO security comes in chosen …

Abstract “All-but-many lossy trapdoor functions”(ABM-LTF) are a powerful cryptographic
primitive studied by Hofheinz (Eurocrypt 2012). ABM-LTFs are parametrised with tags: a …

Constrained pseudorandom functions (CPRFs) allow learning “constrained” PRF keys that
can evaluate the PRF on a subset of the input space, or based on some predicate. First …

Abstract In (STOC, 2008), Gentry, Peikert, and Vaikuntanathan proposed the first identity-
based encryption (GPV-IBE) scheme based on a post-quantum assumption, namely, the …

We construct the first tightly secure authenticated key exchange (AKE) protocol from lattices.
Known tight constructions are all based on Diffie-Hellman-like assumptions. Thus, our …

We propose four public-key encryption schemes with tight simulation-based selective-
opening security against chosen-ciphertext attacks (SIM-SO-CCA) in the random oracle …