MinRank Based Three-Pass Identification Scheme with Half Cheating Probability

• Item type: Symposium(1)
• 公開日: 2021-10-19
• タイトル: MinRank Based Three-Pass Identification Scheme with Half Cheating Probability
• タイトル / 言語: en
• タイトル: MinRank Based Three-Pass Identification Scheme with Half Cheating Probability
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 耐量子計算機暗号，多変数多項式暗号，MinRank問題
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_5794
• 資源タイプ: conference paper
• 著者所属: Department of Computer and Network Engineering, The University of Electro-Communications
• 著者所属: Institute of Mathematics for Industry, Kyushu University
• 著者所属: Department of Liberal Arts and Basic Sciences, Nihon University
• 著者所属: Institute for the Advancement of Higher Education, Okayama University of Science
• 著者所属(英): en
• 著者所属(英): Department of Computer and Network Engineering, The University of Electro-Communications
• 著者所属(英): en
• 著者所属(英): Institute of Mathematics for Industry, Kyushu University
• 著者所属(英): en
• 著者所属(英): Department of Liberal Arts and Basic Sciences, Nihon University
• 著者所属(英): en
• 著者所属(英): Institute for the Advancement of Higher Education, Okayama University of Science
• 著者名: Bagus, Santoso; Yasuhiko, Ikematsu; Shuhei, Nakamura; Takanori, Yasuda
• 著者名(英): Bagus, Santoso; Yasuhiko, Ikematsu; Shuhei, Nakamura; Takanori, Yasuda
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: In Asiacrypt 2001, Courtois proposed the first three-pass zero-knowledge identification (ID) scheme based on the minrank problem. However, in Courtois' ID scheme, the cheating probability, i.e., the success probability of cheating prover, is 2/3, which is larger than half. In this paper, we propose the first three-pass zero-knowledge ID scheme based on the minrank problem with the cheating probability of exactly half even with only two-bit challenge space. Our proposed ID scheme reduces the necessary number of rounds in order to achieve the targeted security level against impersonation.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: In Asiacrypt 2001, Courtois proposed the first three-pass zero-knowledge identification (ID) scheme based on the minrank problem. However, in Courtois' ID scheme, the cheating probability, i.e., the success probability of cheating prover, is 2/3, which is larger than half. In this paper, we propose the first three-pass zero-knowledge ID scheme based on the minrank problem with the cheating probability of exactly half even with only two-bit challenge space. Our proposed ID scheme reduces the necessary number of rounds in order to achieve the targeted security level against impersonation.
• 書誌情報: コンピュータセキュリティシンポジウム2021論文集; p. 847-854, 発行日 2021-10-19
• 出版者 / 言語: ja
• 出版者: 情報処理学会