Provably Secure Symmetric-Key Privacy-Preserving authenticated key agreement protocol
Liang Ni, Hengsheng Zhou, Yawei Zhang +2 more
In recent years, the rapid development of Quantum Computing technology has had a huge impact on the security of traditional Public Key Cryptography. However, the security of Hash functions and Symmetric Cryptographic algorithms is relatively less impacted by this security threaten and commonly have higher execution efficiency. This two primitives can offset the security impact by appropriately increasing the output scale of a Hash function and symmetric key respectively. Therefore, the Symmetric Key Authenticated Key Agreement(SAKA) protocol which constructed mainly by Hash functions and symmetric cryptographic algorithms has gradually attracted more attention. In this paper we proposed a provably secure SAKA scheme. We extend the security model used by Ferreira et al to formally prove the security of our protocol by introducing a criterion for indistinguishability of identities and Synchronization Robustness property. Our protocol not only captures basic security properties such as Perfect Forward Secrecy, Entity Authentication and Key Indistinguishability but also achieved Privacy Preservation and Full Synchronization Robustness. Furthermore, its implementation does not need to rely on a huge and complex Public key Infrastructure(PKI), so we can easily deploy it in a coucurrent environment. Comparison results indicate that the proposal consumes the least computation resource and reasonable communication cost among nine SAKA protocols while equiping 10 security properties.
International Conference on Communication and Network Security (ICCNS)•Dec 6, 2023•0 citations