Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption

In this paper we resolve an open problem regarding resettable zero knowledge in the bare public-key (BPK for short) model: Does there exist constant round resettable zero knowledge argument with concurrent soundness for NP in BPK model without assuming sub-exponential hardness? We give a positive answer to this question by presenting such a protocol for any language in NP in the bare public-key model assuming only collision-resistant hash functions against polynomial-time adversaries. Key Words. Resettable Zero Knowledge, Concurrent Soundness, Bare PublicKey Model, Resettably sound Zero Knowledge.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Yi Deng, Dongdai Lin
• Keywords: Concurrent Soundness, CORR 2006, Education, Model, Resettable Zero Knowledge