You are looking at a specific version 20060724:135301 of this paper.
See the latest version.
Paper 2006/239
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
Yi Deng and Dongdai Lin
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 $\mathcal{NP}$ in BPK model without assuming \emph{sub-exponential hardness}? We give a positive answer to this question by presenting such a protocol for any language in $\mathcal{NP}$ in the bare public-key model assuming only collision-resistant hash functions against \emph{polynomial-time} adversaries.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Resettable Zero KnowledgeConcurrent SoundnessBare Public-Key ModelResettably sound Zero Knowledge.
- Contact author(s)
- ydeng @ is iscas ac cn
- History
- 2006-07-24: revised
- 2006-07-14: received
- See all versions
- Short URL
- https://ia.cr/2006/239
- License
-
CC BY