New ID-based identification scheme
Yumin Wang · Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University · 2009
Verification of a user's identity in a network environment has been a difficult problem.Based on the hardness assumption of the computational Diffie-Hellman problem in a bilinear additive group,a random oracle model was designed.Using the secret key generation technique of the certificateless public key cryptosystem,a new identity(ID)-based identification scheme that can withstand reset attacks and impersonation attacks was proposed.The new ID-based identification scheme avoids not only the key revoke problem of certification-based schemes but also the key escrow problem of ID-based schemes,eliminating the previous unconditional trust assumptions in the private key generator(PKG).Finally,security proofs of the new identification scheme are given under the random oracle model.The results showed that even if the PKG was involved in the active concurrent attacks,the probability of successful impersonation attacks for any polynomial-time adversary should be negligible.