Title
Wolverine: Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
Abstract
Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently attracted much attention. Existing solutions suffer from either significant prover overhead (i.e., high memory usage) or relatively high communication complexity (at least κ bits per gate, for computational security parameter κ). In this paper, we propose a new protocol for constant-round interactive ZK...
Year
DOI
Venue
2021
10.1109/SP40001.2021.00056
2021 IEEE Symposium on Security and Privacy (SP)
DocType
ISBN
Citations 
Conference
978-1-7281-8934-5
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Chenkai Weng122.05
Kang Yang222.38
Jonathan Katz37579347.97
Xiao Wang401.01