Optimal-round semi-honest-quantum PAKE protocol with chaotic maps
Chaonan Wang, Lu Zhang, Hongfeng Zhu
There is an intuitive connection between quantum technology and chaos theory which may lead to a novel way to construct password-authenticated key exchange (PAKE) protocols to resist quantum attacks efficiently. This paper designs an optimal-round semi-honest-quantum PAKE protocol with chaotic maps. In which the clients act as classical users while the server acts as a quantum user with the ability to prepare entangled quantum, this semi-quantum environment makes the application process more efficient and convenient and reduces the cost of deploying the environment. In addition, the protocol takes full advantage of the true randomness of multiple GHZ-like states, as well as the ergodicity of chaotic maps and the sensitivity of initial conditions to realise the key exchange and the session key generation process, and guarantees the security, randomness and unpredictability of the session keys. Our protocol is an optimal-round design, i.e., only one communication is needed to complete the key exchange process, which greatly reduces the number of communications and the possibility of key information being intercepted. Finally, the content of security proof and efficiency analysis also demonstrate our protocol is suitable for efficiently protecting authentication keys and feasible to implement.
International Journal of Information and Computer Security•Jan 1, 2025•0 citations