On the complexity of constant round ZKIP of possession of knowledge

Toshiya Itoh, Kouichi Sakurai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

6 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルAdvances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings
編集者Hideki Imai, Tsutomu Matsumoto, Ronald L. Rivest
出版社Springer Verlag
ページ331-345
ページ数15
ISBN(印刷版)9783540573326
DOI
出版ステータス出版済み - 1993
外部発表はい
イベント1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991 - Fujiyoshida, 日本
継続期間: 11 11 199111 14 1991

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
739 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991
国/地域日本
CityFujiyoshida
Period11/11/9111/14/91

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

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

引用スタイル