An Efficient Anonymous Password-Authenticated Key Exchange Protocol

概要

論文の詳細を見る
Recently, Viet et al., [21] have proposed an anonymous password-authenticated key exchange (PAKE) protocol against a passive server, who follows the protocol honestly but it is curious about identity of client. In this paper, we propose an efficient construction for anonymous PAKE protocol (we call it the EAR protocol) which provides semantic security of session keys in the random oracle model, with the reduction to the computational Diffie-Hellman problem, as well as anonymity against a passive server. Specially, the EAR protocol has about 50% reduction (compared to [21]) in the number of modular exponentiations for both client and server, and its communication bandwidth for the modular size of prime p is independent from the number of clients while [21] is not.
社団法人電子情報通信学会の論文
2006-07-14