Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

We present a modular framework for the design of efficient adaptively secure attribute-based
encryption (ABE) schemes for a large class of predicates under the standard k-Lin …

We present two practically efficient functional encryption schemes for a large class of
quadratic functionalities. Specifically, our constructions enable the computation of so-called …

We present the first fully secure Identity-Based Encryption scheme (IBE) from the standard
assumptions where the security loss depends only on the security parameter and is …

We define a novel notion of quasi-adaptive non-interactive zero-knowledge (NIZK) proofs for
probability distributions on parameterized languages. It is quasi-adaptive in the sense that …

In this work, we propose the first identity-based matchmaking encryption (IB-ME) scheme
under the standard assumptions in the standard model. This scheme is proven to be secure …

We consider the problem of constructing anonymous credentials for use in a setting where
the issuer of credentials is also the verifier, or more generally where the issuer and verifier …

Threshold cryptography is a fundamental distributed computational paradigm for enhancing
the availability and the security of cryptographic public-key schemes. It does it by dividing …

The cloud computing paradigm provides numerous tempting advantages, enabling users to
store and share their data conveniently. However, users are naturally resistant to directly …

In this paper, we focus on the constructions of adaptively secure identity-based encryption
(IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing …