Work

Constant-Round Concurrent Zero-Knowledge From Falsifiable Assumptions

Year: 2012
Type: preprint
Abstract: 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$.
Language: English
Open Access status: green
OpenAlex ID: W1807056319
Cites: 69
Cited by: 4
Related to: 10