Abstract
In this paper we propose a new anonymous password-based authenticated key exchange protocol. The communication cost of our protocol is sub-linear O (√N), which improves a previous one of O (√N) cost, where N is the number of users in the system. We show that the session key is secure against an active adversary in the random oracle model and identity anonymity is secure against a semi-honest adversary in the standard model.
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call