Non-interactive zero-knowledge proofs to multiple verifiers

K Yang, X Wang - International Conference on the Theory and …, 2022 - Springer
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …
被引用次数：19 相关文章

Non-interactive Zero-Knowledge Proofs to Multiple Verifiers

K Yang, X Wang - … on the Theory and Application of …, 2022 - scholars.northwestern.edu
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …

Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers

K Yang, X Wang - Cryptology ePrint Archive, 2022 - eprint.iacr.org
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to $
n $ verifiers at a time efficiently. The proofs are secure against the collusion of a prover and …
[PDF] archive.org

[PDF][PDF] Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers

K Yang, X Wang - scholar.archive.org
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …

Non-interactive Zero-Knowledge Proofs to Multiple Verifiers

K Yang, X Wang - International Conference on the Theory and …, 2022 - dl.acm.org
In this paper, we study zero-knowledge (ZK) proofs for circuit satisfiability that can prove to n
verifiers at a time efficiently. The proofs are secure against the collusion of a prover and a …