Paper Info
Title
Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions
Abstract
An anonymous password-authenticated key exchange (anonymous PAKE) protocol is designed to provide both password-only authentication and user anonymity. In this paper, we propose a very-efficient anonymous PAKE (called, VEAP) protocol that provides the most efficiency among their kinds in terms of computation and communication costs. The VEAP protocol guarantees semantic security of session keys in the random oracle model under the chosen target CDH problem, and unconditional user anonymity against a semi-honest server. If the pre-computation is allowed, the computation cost of the VEAP protocol is the same as the well-known Diffie-Hellman protocol! In addition, we extend the VEAP protocol in two ways.
Year
DOI
Venue
2009
10.1007/978-3-642-02181-7_16
AAECC
Keywords
Field
DocType
veap protocol,communication cost,very-efficient anonymous pake,anonymous password-authenticated key exchange,anonymous pake,very-efficient anonymous password-authenticated key,unconditional user anonymity,well-known diffie-hellman protocol,computation cost,user anonymity,chosen target cdh problem,semantic security,diffie hellman,random oracle model
Discrete mathematics,Key exchange,Interlock protocol,Oakley protocol,Authenticated Key Exchange,Computer network,Password,Anonymity,Stateless protocol,Mathematics,Universal composability
Conference
Volume
ISSN
Citations 
5527
0302-9743
8
PageRank 
References 
Authors
0.51
15
3
Name
Order
Citations
PageRank
Seonghan Shin1548.57
kazukuni kobara238747.00
Hideki Imai380.51