Abstract
Electric vehicle charging is becoming more commonplace, but a number of challenges remain. For example, the wireless communications between vehicle users and aggregators can be subject to exploitation and hence, several authentication schemes have been designed to support varying levels of privacy protection. However, there are a number of limitations observed in existing authentication schemes, and examples include lack of anonymity and not considering charging peak in their design (and consequently, not meeting low energy consumption requirement in smart grid environments). More recently, there have been attempts to utilize Chevyshev chaotic map in the design of authentication mechanism, with the aims of reducing computational costs yet achieving high security. However, the security requirements of Chebyshev polynomials pose new challenges to the construction of Chebyshev chaotic maps-based authentication schemes. To solve these limitations, we propose an efficient Chebyshev polynomials algorithm by adopting a square matrix-based binary exponentiation algorithm to provide secure and efficient Chebyshev polynomial computation. We further construct an energy-efficient authentication and key negotiation scheme for the smart grid environments based on the proposed algorithm. Compared with five other competing schemes, our proposed authentication scheme achieves reduced computational and communication costs. In addition, the ProVerif tool is used to analyze the security of our proposed authentication scheme. The results show that the proposed scheme outperforms these five other schemes in terms of computation and communication overheads while achieving privacy preserving.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.