Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
[PDF][PDF] Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
C Weng, K Yang, J Katz, X Wang - 2021 - scholar.archive.org
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
Wolverine: Fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits
C Weng, K Yang, J Katz… - 42nd IEEE Symposium …, 2021 - scholars.northwestern.edu
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
C Weng, K Yang, J Katz, X Wang - 2021 IEEE Symposium on Security …, 2021 - computer.org
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
C Weng, K Yang, J Katz, X Wang - Cryptology ePrint Archive, 2020 - eprint.iacr.org
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
[PDF][PDF] Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
C Weng, K Yang, J Katz, X Wang - 2021 - eprint.iacr.org
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …
attracted much attention. Existing solutions suffer from either significant prover overhead (ie …