4 move perfect ZKIP of knowledge with no assumption

Takeshi Saito, Kaoru Kurosawa, Kouichi Sakurai

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

4 被引用数 (Scopus)

抄録

This paper presents a 4-move perfect ZKIP of knowledge with no cryptographic assumption for the random self reducible problems [TW87] whose domain is NP∩BPP. The certified discrete log problem is such an example. (Finding a witness is more difficult than the language membership problem.) A largely simplified 4-move ZKIP for the Hamilton Circuit problem is also shown. In our ZKIP, a trapdoor coin flipping protocol is introduced to generate a challenge bit. P and V cooperatively generate a random bit in a coin flipping protocol. In a trapdoor coin flipping protocol, V who knows the trapdoor can create the view which he can later reveal in two possible ways: both as head and as tail.

本文言語英語
ホスト出版物のタイトルAdvances in Cryptology ─ ASIACRYPT 1991 - International Conference on the Theory and Application of Cryptology, Proceedings
編集者Hideki Imai, Tsutomu Matsumoto, Ronald L. Rivest
出版社Springer Verlag
ページ321-330
ページ数10
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

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

フィンガープリント

「4 move perfect ZKIP of knowledge with no assumption」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル