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

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

2006-07-10

arxiv.org/abs/cs/0607035v3

Computer Science

Cryptography and Security

19 page

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151741