Lower Bounds for Zero-knowledge on the Internet

Details Lower Bounds for Zero-knowledge on the Internet Lower Bounds for Zero-knowledge on the Internet

2001-07-02

arxiv.org/abs/cs/0107003v2

Computer Science

Cryptography and Security

Scientific paper

We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and these proofs may take place in an asynchronous fashion. It is known that zero-knowledge is not necessarily preserved in such an environment; we show that for a large class of protocols, it cannot be preserved. Any 4 round (computational) zero-knowledge interactive proof (or argument) for a non-trivial language L is not black-box simulatable in the asynchronous setting.

Affiliated with

Also associated with

No associations

Rating

Lower Bounds for Zero-knowledge on the Internet 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 Lower Bounds for Zero-knowledge on the Internet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds for Zero-knowledge on the Internet will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286498