Any language in IP has a divertible ZKIP

Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya

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

6 被引用数 (Scopus)

抄録

A notion of “divertible” zero-knowledge interactive proof systems was introduced by Okamoto and Ohta, and they showed that for any commutative random self-reducible relation, there exists a divertible (perfect) zero-knowledge interactive proof system of possession of information. In addition, Burmester and Desmedt proved that for any language L ∈ NP, there exists a divertible zero-knowledge interactive proof system for the language L under the assumption that probabilistic encryption homomorphisms exist. In this paper, we classify the notion of divertible into three types, i.e., perfectly divertible, almost perfectly divertible, and computationally divertible, and investigate which complexity class of languages has a perfectly (almost perfectly) (computationally) divertible zero-knowledge interactive proof system. The main results in this paper are: (1) there exists a perfectly divertible perfect zero-knowledge interactive proof system for graph non-isomorphism (GNI) without any unproven assumption; and (2) for any language L having an interactive proof system, there exists a computationally divertible computational zero-knowledge interactive proof system for the language L under the assumption that probabilistic encryption homomorphisms exist.

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

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

フィンガープリント

「Any language in IP has a divertible ZKIP」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル