A Round-Efficient Authenticated Key Agreement Scheme Based on Extended Chaotic Maps for Group Cloud Meeting

Area of Science:

• Computer Science
• Cybersecurity
• Cryptography

Background:

• Cloud meetings require robust security for communication privacy.
• Existing protocols like SGPAKE face computational efficiency challenges.
• Password maintenance poses a security and usability burden.

Purpose of the Study:

• To propose an efficient and secure passwordless group authentication key agreement protocol for cloud meetings.
• To enhance the computational efficiency of existing group key agreement schemes.
• To ensure strong communication privacy and security in dynamic cloud meeting environments.

Main Methods:

• Application of an extended chaotic map for passwordless group authentication.
• Development of the Passwordless Group Authentication Key Agreement (PL-GAKA) protocol.
• Security analysis including session key security, mutual authentication, perfect forward security, and data integrity.
• Evaluation against common attacks such as replay, impersonation, insider, and stolen-verifier attacks.

Main Results:

• PL-GAKA demonstrates improved computation efficiency compared to SGPAKE.
• The extended chaotic map provides security equivalent to Diffie-Hellman.
• The protocol ensures secure communication against various sophisticated attacks.
• Dynamic session key generation enhances short-term authentication and communication security.

Conclusions:

• PL-GAKA offers a secure and efficient passwordless solution for cloud meeting authentication.
• The protocol effectively addresses security concerns including privacy, integrity, and resilience to attacks.
• PL-GAKA presents a viable alternative to password-based and less efficient key agreement schemes.