Add to ORKGWe give a construction of a non-interactive zero-knowledge (NIZK) argument for all NP languages based on a succinct non-interactive argument (SNARG) for all NP languages and a one-way function. The succinctness requirement for the SNARG is rather mild: We only require that the proof size be $|\pi|=\mathsf{poly}(\lambda)(|x|+|w|)^\delta$ for some constant $\delta<1$, where $|x|$ is the statement length, $|w|$ is the witness length, and $\lambda$ is the security parameter. Especially, we do not require anything about the efficiency of the verification. Based on this result, we also give a generic conversion from a SNARK to a zero-knowledge SNARG assuming the existence of one-way functions where SNARK is a SNARG with the knowledge-extractabil...
and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attent...
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-so...
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptogr...
Abstract. Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitiv...
The notion of non-interactive zero-knowledge (NIZK) is of fundamental importance in cryptography. De...
Succinctness and zero-knowledge are two fundamental properties in the study of cryptographic proof s...
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used i...
Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short (i.e., independent of...
This paper presents a very simple and efficient adaptively-sound perfect NIZK argument system for an...
Non-interactive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptogr...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Pub...
In this work, we propose a simple framework of constructing efficient non-interactive zero-knowledge...
We construct a pairing-based simulation-extractable succinct non-interactive argument of knowledge (...
Non-interactive arguments enable a prover to convince a verifier that a statement is true. Recently ...
and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attent...
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-so...
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptogr...
Abstract. Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitiv...
The notion of non-interactive zero-knowledge (NIZK) is of fundamental importance in cryptography. De...
Succinctness and zero-knowledge are two fundamental properties in the study of cryptographic proof s...
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used i...
Zero-knowledge SNARKs (zk-SNARKs) are non-interactive proof systems with short (i.e., independent of...
This paper presents a very simple and efficient adaptively-sound perfect NIZK argument system for an...
Non-interactive zero-knowledge (NIZK) proof systems are fundamental primitives used in many cryptogr...
A non-interactive ZK (NIZK) proof enables verification of NP statements without revealing secrets ab...
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Pub...
In this work, we propose a simple framework of constructing efficient non-interactive zero-knowledge...
We construct a pairing-based simulation-extractable succinct non-interactive argument of knowledge (...
Non-interactive arguments enable a prover to convince a verifier that a statement is true. Recently ...
and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attent...
The existence of succinct non-interactive arguments for NP (i.e., non-interactive computationally-so...
Non-interactive zero-knowledge proofs of knowledge for general NP statements are a powerful cryptogr...