Cryptology ePrint Archive: Report 2012/563

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

Kai-Min Chung and Huijia Lin and Rafael Pass

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.

Category / Keywords: foundations / Concurrent Zero Knowledge, P-certificates, Falsifiable Assumptions, Non-black-box Simulation,

Date: received 2 Oct 2012

Contact author: chung at cs cornell edu

Available format(s): PDF | BibTeX Citation

Version: 20121007:201750 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]