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$.
Source: IACR Cryptology ePrint Archive
Authors: Kai-Min Chung, Huijia Lin, Rafael Pass
Institutions: Cornell University, Massachusetts Institute of Technology
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1807056319
