Constant-Round Concurrent Zero-Knowledge From Falsifiable Assumptions
MetadataShow full item record
Chung, Kai-Min; Lin, Huijia; Pass, Rafael
We present a constant-round concurrent zero-knowledge protocol for $\NP$. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly speaking, that Micali's non-interactive CS-proofs are sound for languages in $\P$.
Concurrent ZK; Falsifiable Assumption; P-Certificates; Non-Black-Box Simulation