Multivariate symmetric polynomial based Group Key Management for Vehicular Ad hoc Networks

Secure and privacy-aware traffic information as a service in VANET-based clouds

“…In case of any key compromise detected by the authorities and/or reported by the users, it should be updated right away. The overhead incurred by the keys updates is outlined in [32,33,34,35]. The aforementioned schemes are semantically close to our scenario and can be implemented in our proposed scheme.…”

“…We believe that many efficient key management and updating schemes exist in the literature. To the best of our knowledge, [32,33,34,35] can be incorporated with our scheme to carry out the group key update procedure without shaking the ba range is not covered due to many factors including vegetation, tall buildings, and even tall vehicles create non line transmission range [30]. Hence in that case, our proposed cloud covering the one hop area, but also enables vehicles to construct long range traffic view through fine grained traffic information from the cloud We use location-based encryption (already explained in previous sub reasons and encrypt MV with K geolock .…”

“…We believe that many efficient key management and updating schemes exist in the literature. To the best of our knowledge, [32,33,34,35] can be incorporated with our scheme to carry out seline functionality of our proposed scheme.…”

A Secure and Authenticated Key Management Protocol (SA-KMP) for Vehicular Networks

“…For any two vehicles to determine a common key, each of them has to broadcast the list of the key identifiers on their key ring using a challenge-response protocol. In [13], D.A. Don et al have introduced the multivariate polynomial scheme by which two vehicles establish a key by substituting the unique ID into its own univariate polynomial share pre-loaded by the authority.…”

Towards trusted and secure communications in a vehicular environment

“…In the polynomial-based approach [89,90,91] In another approach called the matrix-based key establishment protocol [92,93,94,95], a shared key can be established via the symmetric properties of the matrix Keys and corresponding key identifiers are then generated and pre-loaded onto each point in the 2-D grid. Each node in the network is then given a set of keys that can be described by a set of lines that passes through the node's position (i, j).…”