Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 31-39 |
| Number of pages | 9 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E76-A |
| Issue number | 1 |
| Publication status | Published - Jan 1993 |
| Externally published | Yes |
Fingerprint
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Information Systems
- Electrical and Electronic Engineering
Cite this
On the complexity of constant round ZKIP of possession of knowledge. / Itoh, Tosyiya; Sakurai, Kouichi.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E76-A, No. 1, 01.1993, p. 31-39.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On the complexity of constant round ZKIP of possession of knowledge
AU - Itoh, Tosyiya
AU - Sakurai, Kouichi
PY - 1993/1
Y1 - 1993/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027341949&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027341949&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0027341949
VL - E76-A
SP - 31
EP - 39
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 1
ER -