Non-interactive arguments enable a prover to convince a verifier that a statement is true.
Recently there has been a lot of progress both in theory and practice on constructing highly …

We introduce a new characterization of the NP complexity class, called Quadratic Span
Programs (QSPs), which is a natural extension of span programs defined by Karchmer and …

We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of
only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to …

By design, existing (pre-processing) zk-SNARKs embed a secret trapdoor in a relation-
dependent common reference strings (CRS). The trapdoor is exploited by a (hypothetical) …

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 …

Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs
have played a significant role in the theory of cryptography. However, lack of efficiency has …

Zero-knowledge protocols are one of the fundamental concepts in modern cryptography and
have countless applications. However, after more than 30 years from their introduction, there …

We construct a new group signature scheme using bilinear groups. The group signature
scheme is practical, both keys and group signatures consist of a constant number of group …

We construct the first public-key encryption (PKE) scheme whose chosen-ciphertext (ie, IND-
CCA) security can be proved under a standard assumption and does not degrade in either …

In this paper, we introduce P-signatures. A P-signature scheme consists of a signature
scheme, a commitment scheme, and (1) an interactive protocol for obtaining a signature on …