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

2006/07/10 by Yi Deng, Deng, Yi, Dongdai Lin +1
Computer Science · #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Internet Traffic Analysis and Secure E-voting #Privacy-Preserving Technologies in Data

paper · pdf · doi:10.48550/arxiv.cs/0607035

openalex publication_date 2006/07/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model
• On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
• On Concurrent and Resettable Zero-Knowledge Proofs for NP
• Adaptive Concurrent Non-Malleability with Bare Public-Keys
• Unclonable Non-Interactive Zero-Knowledge