CryptoDB
Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2006-21732, title={Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption}, booktitle={IACR Eprint archive}, keywords={Resettable Zero Knowledge, Concurrent Soundness, Bare Public-Key Model, Resettably sound Zero Knowledge.}, url={http://eprint.iacr.org/2006/239}, note={ ydeng@is.iscas.ac.cn 13353 received 12 Jul 2006, last revised 24 Jul 2006}, author={Yi Deng and Dongdai Lin}, year=2006 }