arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0107003cs.CR
收藏

Lower Bounds for Zero-knowledge on the Internet

Joe Kilian, Erez Petrank, Charles Rackoff

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑