抄録
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
- Hardware and Architecture
- Information Systems
- Electrical and Electronic Engineering