@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00214514,
 author = {Bagus, Santoso and Yasuhiko, Ikematsu and Shuhei, Nakamura and Takanori, Yasuda and Bagus, Santoso and Yasuhiko, Ikematsu and Shuhei, Nakamura and Takanori, Yasuda},
 book = {コンピュータセキュリティシンポジウム2021論文集},
 month = {Oct},
 note = {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., 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.},
 pages = {847--854},
 publisher = {情報処理学会},
 title = {MinRank Based Three-Pass Identification Scheme with Half Cheating Probability},
 year = {2021}
}