We put forward a new algebraic framework to generalize and analyze Diffie–Hellman like
decisional assumptions which allows us to argue about security and applications by …

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 …

Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as the
Groth-Sahai proofs, are an extremely powerful tool in pairing-based cryptography. A series …

Abstract Structure-preserving signatures (SPS) are signature schemes where messages,
signatures and public keys all consist of elements of a group over which a bilinear map is …

In 2009, Abdalla et al. proposed a reasonably practical password-authenticated key
exchange (PAKE) secure against adaptive adversaries in the universal composability (UC) …

Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a recent paradigm,
suggested by Jutla and Roy (Asiacrypt'13), which is motivated by the Groth-Sahai seminal …

Outsourced decryption attribute-based encryption (OD-ABE) is emerging as a promising
cryptographic tool to provide efficient fine-grained access control for data accessing and …

We construct the first (almost) tightly-secure unbounded-simulation-sound quasi-adaptive
non-interactive zero-knowledge arguments (USS-QA-NIZK) for linear-subspace languages …

Recently, Bellare et al. defined subversion-resistance (security in the case the CRS creator
may be malicious) for NIZK. In particular, a Sub-ZK NIZK is zero-knowledge, even in the …

Quasi-adaptive non-interactive zero-knowledge proof (QA-NIZK) systems and structure-
preserving signature (SPS) schemes are two powerful tools for constructing practical pairing …