Concurrent/Resettable Zero-Knowledge Protocols for NP in the Public Key Model

Abstract

We propose a four-round protocol for concurrent and resettable zero-knowledge arguments for any langauge in NP, assuming the verifier has a pre-registered public-key. We also propose a three-round protocol with an additional timing assumption.