A Provably Secure Group Key Agreement Scheme With Privacy Preservation for Online Social Networks Using Extended Chaotic Maps

Abstract

With the rapid growth in the popularity of mobile devices and development of network technologies, various online social networking applications have grown in popularity. While these social networking sites provide benefits in terms of enhanced connectivity with people all around the world, they can also pose security threats and raise privacy concerns due to their vulnerability to be exploited by malicious agents. Such social networking sites where members can transmit or share their social information via public channels increase the risk that these information may be exposed to unwanted users. Therefore, it is important to enhance the security of these online social network services using group session keys. These group session keys also need to be updated in case a new member joins the group or an old member leaves the social group. To enhance the trustworthiness of the online social network systems, in this paper, we propose a secure chaotic maps-based group key agreement scheme. In this proposed scheme, we also provide member anonymity to ensure the privacy of the communication between the social networking platform and the members. The proposed solution does not rely on a centralized online key center or a trusted group chairman, thus ensuring fairness. We integrate the mechanisms of message encryption and member verification into the scheme to allow the members to anonymously interact with the services of the online social network. We verify the formal security of the proposed solution using the widely accepted BAN logic analysis and simulation verification with Proverif to prove that our scheme is secure against both passive and active attacks. We also demonstrate that the proposed scheme is efficient in its implementation and achieves greater functionality criteria in comparison with similar existing proposals.