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
DOIs
Publication statusPublished - 1993
Externally publishedYes
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

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the complexity of constant round ZKIP of possession of knowledge'. Together they form a unique fingerprint.

  • 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. https://doi.org/10.1007/3-540-57332-1_28