|
计算机应用 2009
Efficient identification scheme with bilinear map
|
Abstract:
Concerning the discrete logarithm problem of elliptic curve and bilinear mapping,an identification scheme was proposed,and then it was extended to multi-KGC situation.The proposed scheme required less computation and communication than the existing ones and realized mutual authentication.Given the condition of the intractability of the elliptic curve discrete logarithm problem,the proposed scheme was proved secure against forged user attack,impersonation attack and replay attack.