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 …

Bit coin is the first digital currency to see widespread adoption. While payments are
conducted between pseudonyms, Bit coin cannot offer strong privacy guarantees: payment …

An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

Abstract We propose a Multi-Authority Attribute-Based Encryption (ABE) system. In our
system, any party can become an authority and there is no requirement for any global …

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 …

We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect
completeness, perfect zero-knowledge and computational soundness. The non-interactive …

Succinct non-interactive arguments of knowledge (SNARKs) enable verifying NP statements
with complexity that is essentially independent of that required for classical NP verification …

A modular approach for cryptographic protocols leads to a simple design but often inefficient
constructions. On the other hand, ad hoc constructions may yield efficient protocols at the …

Non-interactive zero-knowledge proofs play an essential role in many cryptographic
protocols. We suggest several NIZK proof systems based on prime order groups with a …

Zero knowledge proof system which has received extensive attention since it was proposed
is an important branch of cryptography and computational complexity theory. Thereinto …