On the complexity of constant round ZKIP of possession of knowledge

Toshiya Itoh, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In this paper, we 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 on input x ∈ {0,1}*, outputs y such that (x, y) ∈ R with overwhelming probability if x ∈ dom R, and outputs “⊥” with probability 1 if x ∉ dom R. In the present paper, we also show that without any unproven assumption, there exists a four move blackbox simulation perfect zero-knowledge interactive proof system of possession of the prime factorization, which is optimal in the light of the round complexity.

Original languageEnglish
Title of host publicationAdvances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings
EditorsHideki Imai, Tsutomu Matsumoto, Ronald L. Rivest
PublisherSpringer Verlag
Pages331-345
Number of pages15
ISBN (Print)9783540573326
Publication statusPublished - Jan 1 1993
Event1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991 - Fujiyoshida, Japan
Duration: Nov 11 1991Nov 14 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume739 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991
CountryJapan
CityFujiyoshida
Period11/11/9111/14/91

Fingerprint

Interactive Proof Systems
Zero-knowledge Proof
Black Box
Perfect Simulation
L'Hôpital's Rule
Probabilistic Algorithms
Output
Factorization
Polynomial-time Algorithm
Polynomials
Simulation
Knowledge

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Itoh, T., & Sakurai, K. (1993). On the complexity of constant round ZKIP of possession of knowledge. In H. Imai, T. Matsumoto, & R. L. Rivest (Eds.), Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings (pp. 331-345). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 739 LNCS). Springer Verlag.

On the complexity of constant round ZKIP of possession of knowledge. / Itoh, Toshiya; Sakurai, Kouichi.

Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. ed. / Hideki Imai; Tsutomu Matsumoto; Ronald L. Rivest. Springer Verlag, 1993. p. 331-345 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 739 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Itoh, T & Sakurai, K 1993, On the complexity of constant round ZKIP of possession of knowledge. in H Imai, T Matsumoto & RL Rivest (eds), Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 739 LNCS, Springer Verlag, pp. 331-345, 1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991, Fujiyoshida, Japan, 11/11/91.
Itoh T, Sakurai K. On the complexity of constant round ZKIP of possession of knowledge. In Imai H, Matsumoto T, Rivest RL, editors, Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. Springer Verlag. 1993. p. 331-345. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Itoh, Toshiya ; Sakurai, Kouichi. / On the complexity of constant round ZKIP of possession of knowledge. Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings. editor / Hideki Imai ; Tsutomu Matsumoto ; Ronald L. Rivest. Springer Verlag, 1993. pp. 331-345 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{43b11e3105e54d39aa968fe1142dddc2,
title = "On the complexity of constant round ZKIP of possession of knowledge",
abstract = "In this paper, we 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 on input x ∈ {0,1}*, outputs y such that (x, y) ∈ R with overwhelming probability if x ∈ dom R, and outputs “⊥” with probability 1 if x ∉ dom R. In the present paper, we also show that without any unproven assumption, there exists a four move blackbox simulation perfect zero-knowledge interactive proof system of possession of the prime factorization, which is optimal in the light of the round complexity.",
author = "Toshiya Itoh and Kouichi Sakurai",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "9783540573326",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "331--345",
editor = "Hideki Imai and Tsutomu Matsumoto and Rivest, {Ronald L.}",
booktitle = "Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings",
address = "Germany",

}

TY - GEN

T1 - On the complexity of constant round ZKIP of possession of knowledge

AU - Itoh, Toshiya

AU - Sakurai, Kouichi

PY - 1993/1/1

Y1 - 1993/1/1

N2 - In this paper, we 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 on input x ∈ {0,1}*, outputs y such that (x, y) ∈ R with overwhelming probability if x ∈ dom R, and outputs “⊥” with probability 1 if x ∉ dom R. In the present paper, we also show that without any unproven assumption, there exists a four move blackbox simulation perfect zero-knowledge interactive proof system of possession of the prime factorization, which is optimal in the light of the round complexity.

AB - In this paper, we 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 on input x ∈ {0,1}*, outputs y such that (x, y) ∈ R with overwhelming probability if x ∈ dom R, and outputs “⊥” with probability 1 if x ∉ dom R. In the present paper, we also show that without any unproven assumption, there exists a four move blackbox simulation perfect zero-knowledge interactive proof system of possession of the prime factorization, which is optimal in the light of the round complexity.

UR - http://www.scopus.com/inward/record.url?scp=84879820140&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879820140&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84879820140

SN - 9783540573326

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 331

EP - 345

BT - Advances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings

A2 - Imai, Hideki

A2 - Matsumoto, Tsutomu

A2 - Rivest, Ronald L.

PB - Springer Verlag

ER -