Abstract

In recent years, due to the wide applications of social network and electronic business, privacy protection in the cyber world has attracted much attention. And in general, in order to solve the problems to set up a secure channel over public Internet, authenticated key agreement protocols can be adopted because it can achieve authentication of the corresponding participants and confidentiality of data transmission at the same time. Next, many authenticated key agreement protocols use various functional algorithms, such as dynamic identity and chaotic maps to achieve privacy protection. In this paper, we firstly put forward a new method to solve privacy protection problem, called One-Time Commitment, which is more efficient than One-Time Password. Then a new robust biometrics-based authenticated key agreement protocol with privacy protection using interactive hashing is given for mobile network. Our protocol has the feature of high-efficient and user friendly at the same time. Security of the protocol is based on the biometric authentication, a secure one way hash function and a pair of secure interactive hashing. Moreover the proposed protocol can not only refrain from many consuming algorithms, such as modular exponential computing, scalar multiplication on an elliptic curve, and even symmetric encryption, but is also robust to many kinds of attacks, such as replay attack, perfect forward secrecy and so on. Finally, we provide the secure proof and the efficiency analysis about our proposed scheme.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.