A hidden cryptographic assumption in no-transferable indentification schemes

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

抄録

A 4-move perfect zero-knowledge argument for quadratic residuosity is discussed and the identification scheme based on this protocol is shown to be no-transferable. Note that the soundness of all known previous no-transferable protocols require no computational assumption, while our proposed protocol assumes a restriction of the power of cheating provers. Furthermore, a new notion of practical soundness is introduced and the relationship between practical soundness and no-transferable is investigated. An important consequence is that perfect zero-knowledge arguments does not always satisfy no-transferable nor practical soundness.

本文言語英語
ホスト出版物のタイトルAdvances in Cryptology ─ ASIACRYPT 1996 - International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
編集者Kwangjo Kim, Tsutomu Matsumoto
出版社Springer Verlag
ページ159-172
ページ数14
ISBN(印刷版)9783540618720
DOI
出版ステータス出版済み - 1 1 1996
イベントInternational Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996 - Kyongju, 大韓民国
継続期間: 11 3 199611 7 1996

出版物シリーズ

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

その他

その他International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 1996
Country大韓民国
CityKyongju
Period11/3/9611/7/96

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「A hidden cryptographic assumption in no-transferable indentification schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル