On the complexity of constant round ZKIP of possession of knowledge

Tosyiya Itoh, Kouichi Sakurai

研究成果: ジャーナルへの寄稿学術誌査読

7 被引用数 (Scopus)

抄録

In this paper, we investigate the round complexity of zero-knowledge interactive proof systems of possession of knowledge, and mainly show that if a relation R has a three move blackbox simulation zero-knowledge interactive proof system of possession of knowledge, then there exists a probabilistic polynomial time algorithm that can be satisfied under certain conditions. The result can be generalized to zero-knowledge interactive proof systems of possession of knowledge with more than four moves, because it s known that there exist a 'four' move blackbox simulation perfect zero-knowledge interactive proof system of possession of knowledge for a nontrivial relation R.

本文言語英語
ページ(範囲)31-39
ページ数9
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E76-A
1
出版ステータス出版済み - 1月 1993
外部発表はい

All Science Journal Classification (ASJC) codes

  • ハードウェアとアーキテクチャ
  • 情報システム
  • 電子工学および電気工学

フィンガープリント

「On the complexity of constant round ZKIP of possession of knowledge」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル