A Secure and Efficient Group Key Agreement Scheme for VANETGroup Key Agreement Scheme • October 31st, 2024
In order to protect the security and privacy of group com- munications in VANET, a secure and efficient group key negotiation scheme needs to be designed. In order to achieve efficient anonymous privacy and authentication mechanisms, batch authentication schemes and shared key mechanisms are generally used. In this article, we propose improving a secure and efficient group key agree- ment scheme for VANET in several areas to explicitly clarify the process and ensure the safety of the dissemi- nated information.
Secure Chaotic Maps-based Group Key Agreement Scheme with Privacy PreservingGroup Key Agreement Scheme • October 11th, 2015
Nowadays chaos theory related to cryptography has been addressed widely, so there is an intuitive connection be- tween group key agreement and chaotic maps. Such a connector may lead to a novel way to construct authenti- cated and efficient group key agreement protocols. Many chaotic maps based two-party/three-party password au- thenticated key agreement (2PAKA/3PAKA) schemes have been proposed. However, to the best of our knowl- edge, no chaotic maps based group (N-party) key agree- ment protocol without using a timestamp and password has been proposed yet. In this paper, we propose the first chaotic maps-based group authentication key agree- ment protocol. The proposed protocol is based on chaotic maps to create a kind of signcryption method to trans- mit authenticated information and make the calculated consumption and communicating round restrict to an ac- ceptable bound. At the same time our proposed protocol can achieve members’ revocation or join easily, which not only refrains
An Efficient Group Key Agreement Scheme for Mobile Ad-Hoc NetworksGroup Key Agreement Scheme • November 26th, 2012
An Improved Group Key Agreement Scheme with Privacy Preserving Based on Chaotic MapsGroup Key Agreement Scheme • July 28th, 2021
Abstract—The decentralized group key agreement scheme allows a group of participants to exchange private multicast messages via the protection of a group session key in the group. Recently, Zhu proposed the first group authentication key agreement scheme based on chaotic maps and the structure of a group is organized in an ordered chain. Thus each participant needs to establish two temporary two-party session keys with its predecessor and successor in a parallel algorithm. In order to cope with dynamic groups, the group session keys are frequently updated whenever a new member joins or a member leaves the group. Zhu claimed that the proposed scheme is secure against various attacks such as replay, man-in-the-middle, impersonation and key compromise attacks. Furthermore, Zhu extended the proposed scheme to high level security attributes such as privacy preserving, no clock synchronization problem, mutual and group authentication and perfect forward secrecy etc. However, in this paper, w
A Secure and Efficient Group Key Agreement Scheme for VANETGroup Key Agreement Scheme • January 24th, 2019
