Cryptographic keys exchange model for smart city applications

Abstract

This study presents a secret key sharing protocol that establishes cryptographically secured communication between two entities. A new symmetric key exchange scenario for smart city applications is presented in this research. The protocol is based on the specific properties of the Fuss‐Catalan numbers and the Lattice Path combinatorics. The proposed scenario consists of three phases: generating a Fuss‐Catalan object based on the grid dimension, defining the movement in the Lattice Path Grid and defining the key equalisation rules. In the experimental part, the authors present the security analysis of the protocol as well as its test. Also, they examine the equivalence of the proposed with Maurer's satellite scenario and suggest a new scenario that implements an information‐theoretical protocol for the public key distribution. Additionally, a comparison with related studies and methods is provided, as well as a comparison with satellite scenario, which proves the advantages of solution presented by the authors. Finally, they propose further research directions regarding key management in smart city applications.

A Center-Rule-Based Neighborhood Search Algorithm for Roadside Units Deployment in Emergency Scenarios

“…Taking the road with ID 1 as an example, each Cell is numbered from 0 to K in the east direction in Figure 1, such that the first Cell (at the intersection) is numbered 0. Taking the ID information of the road into consideration, we use A crash occurred on C 3 1 at the time ξ, which leads to a traffic jam heading east, is shown in Figure 1. For simplicity, we assume that all vehicles travel at a constant speed.…”

“…When R 0 1 receives this message, it will disseminate the data packet in all directions, helping vehicles heading to its destination passing by road with ID 1 to reroute. The road sequence of the packet dissemination is: C 3 1 → C 2 1 → C 1 1 → C 0 1 . We will discuss the process of message dissemination in the case of RSUs (in Section 3.1) and no RSUs (in Section 3.2) in Cells, respectively.…”

“…Based on the analysis in Section 2, we considered deploying RSUs at intersections to help disseminate information. We assume that all RSUs are connected via a backbone network, just as Merha et al did in [3] and Chen et al did in [5], which can relay up-to-date information from one RSU to some RSUs in distant regions in a very short time. RSUs work together to coordinate actions and to exchange or process various types of information.…”

“…(1) Center rule (K = 1): Take four positions of the grids obtained by the quartering method near the center of the road network as the initial positions, as shown in Figure 9. The four positions are (3,3), (3,4), (4,3), and (4, 4) respectively.…”

“…Specifically, V2V communication technology is based on a Vehicular Ad Hoc Network (VANET). VANET, which is a vital part of the intelligent transportation system (ITS), can improve road safety and traffic efficiency using wireless communication technology, meanwhile providing various entertainment service information to enhance drivers' and passengers' experience while ensure data confidentiality, reliability, and integrity by the data encryption technique [2,3]. VANET, created by applying the principles of mobile ad hoc…”