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.

摘要：

基于双线性映射以及椭圆曲线上的离散对数难题，提出了一种认证过程中不需要密钥生成中心介入的用户间身份认证方案，并扩展到有多个密钥生成中心的情形。该方案与已有方案相比具有更少的计算量与通信次数，且实现了双向认证；最后证明所提出的方案在椭圆曲线离散对数难解假设下能有效抵抗伪造用户攻击，冒充攻击和重放攻击，具有较好的安全性。

关键词: 双线性映射;基于身份的加密;身份认证